The search functionality is under construction.
The search functionality is under construction.

Keyword Search Result

[Keyword] (42807hit)

4181-4200hit(42807hit)

  • Empirical Discussion of Reliable Wireless Communications in Vehicles

    Tadahide KUNITACHI  Kazuhiko KINOSHITA  Takashi WATANABE  

     
    PAPER

      Pubricized:
    2018/10/15
      Vol:
    E102-B No:4
      Page(s):
    751-759

    Recent works on enhancing the comfort and convenience of vehicles have revealed the advantage of various wireless sensor nodes for information collection. For the highly required reliability in vehicles, Reliable Wireless Communication based on Substitute Forwarding (RWCSF) has been proposed. It ensures that 99.999% of communications can finish within 20ms, which is the quality of communication equivalent to wired links. However, the performance was evaluated in very limited situations, where two or more communications never occurred simultaneously and no noise was present. In this paper, we enhance RWCSF to achieve the target communication quality even if two or more communications occur simultaneously. In addition, we evaluate the enhanced method in various types of vehicles that create internal noise.

  • A Parallel Flow Monitoring Technique That Achieves Accurate Delay Measurement

    Kohei WATABE  Shintaro HIRAKAWA  Kenji NAKAGAWA  

     
    PAPER-Network Management/Operation

      Pubricized:
    2018/10/03
      Vol:
    E102-B No:4
      Page(s):
    865-875

    In this paper, a parallel flow monitoring technique that achieves accurate measurement of end-to-end delay of networks is proposed. In network monitoring tasks, network researchers and practitioners usually monitor multiple probe flows to measure delays on multiple paths in parallel. However, when they measure an end-to-end delay on a path, information of flows except for the flow along the path is not utilized in the conventional method. Generally, paths of flows share common parts in parallel monitoring. In the proposed method, information of flows on paths that share common parts, utilizes to measure delay on a path by partially converting the observation results of a flow to those of another flow. We perform simulations to confirm that the observation results of 72 parallel flows of active measurement are appropriately converted between each other. When the 99th-percentile of the end-to-end delay for each flow are measured, the accuracy of the proposed method is doubled compared with the conventional method.

  • Low-Profile Supergain Antenna Composed of Asymmetric Dipole Elements Backed by Planar Reflector for IoT Applications Open Access

    Suguru KOJIMA  Takuji ARIMA  Toru UNO  

     
    PAPER-Antennas and Propagation

      Pubricized:
    2018/10/15
      Vol:
    E102-B No:4
      Page(s):
    884-890

    This paper proposes a low-profile unidirectional supergain antenna applicable to wireless communication devices such as mobile terminals, the Internet of Things and so on. The antennas used for such systems are required to be not only electrically low-profile but also unsusceptible to surrounding objects such as human body and/or electrical equipment. The proposed antenna achieves both requirements due to its supergain property using planar elements and a closely placed planar reflector. The primary antenna is an asymmetric dipole type, and consists of a monopole element mounted on an edge of a rectangular conducting plane. Both elements are placed on a dielectric substrate backed by the planar reflector. It is numerically and experimentally shown that the supergain property is achieved by optimizing the geometrical parameters of the antenna. It is also shown that the impedance characteristics can be successfully adjusted by changing the lengths of the ground plane element and the monopole element. Thus, no additional impedance matching circuit is necessary. Furthermore, it is shown that surrounding objects have insignificant impact on the antenna performance.

  • Non-Orthogonal Pilot Analysis for Single-Cell Massive MIMO Circumstances

    Pengxiang LI  Yuehong GAO  Zhidu LI  Hongwen YANG  

     
    PAPER-Wireless Communication Technologies

      Pubricized:
    2018/10/05
      Vol:
    E102-B No:4
      Page(s):
    901-912

    This paper analyzes the performance of single-cell massive multiple-input multiple-output (MIMO) systems with non-orthogonal pilots. Specifically, closed-form expressions of the normalized channel estimation error and achievable uplink capacity are derived for both least squares (LS) and minimum mean square error (MMSE) estimation. Then a pilot reconstruction scheme based on orthogonal Procrustes principle (OPP) is provided to reduce the total normalized mean square error (NMSE) of channel estimations. With these reconstructed pilots, a two-step pilot assignment method is formulated by considering the correlation coefficient among pilots to reduce the maximum NMSE. Based on this assignment method, a step-by-step pilot power allocation scheme is further proposed to improve the average uplink signal-to-interference and noise ratio (SINR). At last, simulation results demonstrate the superiority of the proposed approaches.

  • Transmit Beam Selection Scheme for Massive MIMO Using Expected Beam Responses

    Yoshihito KUBO  Yukitoshi SANADA  

     
    PAPER-Wireless Communication Technologies

      Pubricized:
    2018/10/12
      Vol:
    E102-B No:4
      Page(s):
    913-920

    Massive multiple-input multiple-output (MIMO) realizes simultaneous transmission to a large number of mobile stations (MSs) and improves frequency utilization efficiency. It is drawing attention as the key technology of the fifth-generation (5G) mobile communication systems. The 5G system is going to be implemented in a high frequency band and massive MIMO beamforming (BF) is applied to compensate propagation loss. In the conventional BF scheme, a transmit beam is selected based on the power of received signals over subcarriers. The signal on a different subcarrier is transmitted with a different directivity. To improve the accuracy of beam selection, this paper proposes a transmit beam selection scheme for massive MIMO. The proposed scheme calculates the expected responses of the signals over the subcarriers based on the relative directivity between a base station (BS) and a MS. The MS calculates the correlation between the received signals and each of the expected response sequences. It then selects the beam with the highest correlation value. It is shown in this paper that the proposed scheme can improve the average signal-to-noise ratio of a received signal by about 1.5dB as compared with that of the power based search scheme. It is also shown that the proposed scheme with limited response coefficients can reduce the computational complexity by a factor of 1/100 while it still increases the average SNR by about 1.0dB.

  • Design and Calibration of a Small-Footprint, Low-Frequency, and Low-Power Gate Leakage Timer Using Differential Leakage Technique Open Access

    Yuya NISHIO  Atsuki KOBAYASHI  Kiichi NIITSU  

     
    PAPER

      Vol:
    E102-C No:4
      Page(s):
    269-275

    This study proposes a design and calibration method for a small-footprint, low-frequency, and low-power gate leakage timer using a differential leakage technique for IoT applications. The proposed gate leakage timer is different from conventional ones because it is composed of two leakage sources and exploits differential leakage current for the charging capacitor. This solution alleviates the inherent trade-off between small-footprint and low-frequency in the conventional gate leakage timer. Furthermore, a calibration method to suppress variations of the output frequency is proposed in this paper. To verify the effectiveness of the proposed gate leakage timer, a test chip was fabricated using 55-nm-DDC-CMOS technology. The test chip successfully demonstrates the highest figure of merit (FoM) of the product of the capacitor area (0.072µm2) and output frequency (0.11Hz), which corresponds to an improvement by a factor of 2,121 compared to the conventional one. It also demonstrates the operation with 4.5pW power consumption. The total footprint can be reduced to be 28µm2, which enables low-cost and low-power IoT edges. The scaling scenario shows that the proposed technique is conducive to technology scaling.

  • All-Optical Modulation Format Conversion and Applications in Future Photonic Networks Open Access

    Ken MISHINA  Daisuke HISANO  Akihiro MARUTA  

     
    INVITED PAPER

      Vol:
    E102-C No:4
      Page(s):
    304-315

    A number of all-optical signal processing schemes based on nonlinear optical effects have been proposed and demonstrated for use in future photonic networks. Since various modulation formats have been developed for optical communication systems, all-optical converters between different modulation formats will be a key technology to connect networks transparently and efficiently. This paper reviews our recent works on all-optical modulation format conversion technologies in order to highlight the fundamental principles and applications in variety of all-optical signal processing schemes.

  • Activity Recognition Using RFID Phase Profiling in Smart Library

    Yegang DU  Yuto LIM  Yasuo TAN  

     
    PAPER

      Pubricized:
    2019/02/05
      Vol:
    E102-D No:4
      Page(s):
    768-776

    In the library, recognizing the activity of the reader can better uncover the reading habit of the reader and make book management more convenient. In this study, we present the design and implementation of a reading activity recognition approach based on passive RFID tags. By collecting and analyzing the phase profiling distribution feature, our approach can trace the reader's trajectory, recognize which book is picked up, and detect the book misplacement. We give a detailed analysis of the factors that can affect phase profiling in theory and combine these factors with relevant activities. The proposed approach recognizes the activities based on the amplitude of the variation of phase profiling, so that the activities can be inferred in real time through the phase monitoring of tags. We then implement our approach with off-the-shelf RFID equipment, and the experiments show that our approach can achieve high accuracy and efficiency in activity recognition in a real-world situation. We conclude our work and further discuss the necessity of a personalized book recommendation system in future libraries.

  • FOREWORD Open Access

    Koji Eguchi  

     
    FOREWORD

      Vol:
    E102-D No:4
      Page(s):
    724-724
  • Secure Directional Modulation Using the Symmetrical Multi-Carrier Frequency Diverse Array with Logarithmical Frequency Increment

    Tao XIE  Jiang ZHU  Qian CHENG  Junshan LUO  

     
    PAPER-Communication Theory and Signals

      Vol:
    E102-A No:4
      Page(s):
    633-640

    Wireless communication security has become a hot topic in recent years. The directional modulation (DM) is a promising secure communication technique that has attracted attentions of many researchers. Several different frequency diverse arrays (FDAs) are used to obtain the direction-range-dependent DM signals in previous literatures. However, most of them are not ideal enough to obtain a nonperiodic dot-shaped secure area. In this paper, the symmetrical multi-carrier frequency diverse array with logarithmical frequency increment, named the symmetrical-multilog-FDA, is used to obtain the direction-range-dependent DM signals that are normal at the desired locations while disordered at other locations. Based on the symmetrical-multilog-FDA, we derive the closed-form expression of baseband-weighted vector using the artificial-noise-aided zero-forcing approach. Compared with previous schemes, the proposed scheme can obtain a more fine-focusing nonperiodic dot-shaped secure area at the desired location. In addition, it can achieve a point-to-multipoint secure communication for multiple cooperative receivers at different locations.

  • A Multiple Cyclic-Route Generation Method with Route Length Constraint Considering Point-of-Interests

    Tensei NISHIMURA  Kazuaki ISHIKAWA  Toshinori TAKAYAMA  Masao YANAGISAWA  Nozomu TOGAWA  

     
    PAPER-Intelligent Transport System

      Vol:
    E102-A No:4
      Page(s):
    641-653

    With the spread of map applications, route generation has become a familiar function. Most of route generation methods search a route from a starting point to a destination point with the shortest time or shortest length, but more enjoyable route generation is recently focused on. Particularly, cyclic-route generation for strolling requires to suggest to a user more than one route passing through several POIs (Point-of-Interests), to satisfy the user's preferences as much as possible. In this paper, we propose a multiple cyclic-route generation method with a route length constraint considering POIs. Firstly, our proposed method finds out a set of reference points based on the route length constraint. Secondly, we search a non-cyclic route from one reference point to the next one and finally generate a cyclic route by connecting these non-cyclic routes. Compared with previous methods, our proposed method generates a cyclic route closer to the route length constraint, reduces the number of the same points passing through by approximately 80%, and increases the number of POIs passed approximately 1.49 times.

  • Design and Feasibility Study: Customized Virtual Buttons for Electronic Mobile Devices

    Seungtaek SONG  Namhyun KIM  Sungkil LEE  Joyce Jiyoung WHANG  Jinkyu LEE  

     
    LETTER-Algorithms and Data Structures

      Vol:
    E102-A No:4
      Page(s):
    668-671

    Smartphone users often want to customize the positions and functions of physical buttons to accommodate their own usage patterns; however, this is unfeasible for electronic mobile devices based on COTS (Commercial Off-The-Shelf) due to high production costs and hardware design constraints. In this letter, we present the design and implementation of customized virtual buttons that are localized using only common built-in sensors of electronic mobile devices. We develop sophisticated strategies firstly to detect when a user taps one of the virtual buttons, and secondly to locate the position of the tapped virtual button. The virtual-button scheme is implemented and demonstrated in a COTS-based smartphone. The feasibility study shows that, with up to nine virtual buttons on five different sides of the smartphone, the proposed virtual buttons can operate with greater than 90% accuracy.

  • Co-Saliency Detection via Local Prediction and Global Refinement

    Jun WANG  Lei HU  Ning LI  Chang TIAN  Zhaofeng ZHANG  Mingyong ZENG  Zhangkai LUO  Huaping GUAN  

     
    PAPER-Image

      Vol:
    E102-A No:4
      Page(s):
    654-664

    This paper presents a novel model in the field of image co-saliency detection. Previous works simply design low level handcrafted features or extract deep features based on image patches for co-saliency calculation, which neglect the entire object perception properties. Besides, they also neglect the problem of visual similar region's mismatching when designing co-saliency calculation model. To solve these problems, we propose a novel strategy by considering both local prediction and global refinement (LPGR). In the local prediction stage, we train a deep convolutional saliency detection network in an end-to-end manner which only use the fully convolutional layers for saliency map prediction to capture the entire object perception properties and reduce feature redundancy. In the global refinement stage, we construct a unified co-saliency refinement model by integrating global appearance similarity into a co-saliency diffusion function, realizing the propagation and optimization of local saliency values in the context of entire image group. To overcome the adverse effects of visual similar regions' mismatching, we innovatively incorporates the inter-images saliency spread constraint (ISC) term into our co-saliency calculation function. Experimental results on public datasets demonstrate consistent performance gains of the proposed model over the state-of-the-art methods.

  • Inferring Latent Traffic Demand Offered to an Overloaded Link with Modeling QoS-Degradation Effect Open Access

    Keisuke ISHIBASHI  Shigeaki HARADA  Ryoichi KAWAHARA  

     
    PAPER-Fundamental Theories for Communications

      Pubricized:
    2018/10/10
      Vol:
    E102-B No:4
      Page(s):
    790-798

    In this paper, we propose a CTRIL (Common Trend and Regression with Independent Loss) model to infer latent traffic demand in overloaded links as well as how much it is reduced due to QoS (Quality of Service) degradation. To appropriately provision link bandwidth for such overloaded links, we need to infer how much traffic will increase without QoS degradation. Because original latent traffic demand cannot be observed, we propose a method that compares the other traffic time series of an underloaded link, and by assuming that the latent traffic demands in both overloaded and underloaded are common, and actualized traffic demand in the overloaded link is decreased from common pattern due to the effect of QoS degradation. To realize the method, we developed a CTRIL model on the basis of a state-space model where observed traffic is generated from a latent trend but is decreased by the QoS degradation. By applying the CTRIL model to actual HTTP (Hypertext transfer protocol) traffic and QoS time series data, we reveal that 1% packet loss decreases traffic demand by 12.3%, and the estimated latent traffic demand is larger than the observed one by 23.0%.

  • A Note on Two Constructions of Zero-Difference Balanced Functions

    Zongxiang YI  Yuyin YU  Chunming TANG  Yanbin ZHENG  

     
    LETTER-Cryptography and Information Security

      Vol:
    E102-A No:4
      Page(s):
    680-684

    Notes on two constructions of zero-difference balanced (ZDB) functions are made in this letter. Then ZDB functions over Ze×∏ki=0 Fqi are obtained. And it shows that all the known ZDB functions using cyclotomic cosets over Zn are special cases of a generic construction. Moreover, applications of these ZDB functions are presented.

  • A Novel Radio Resource Optimization Scheme in Closed Access Femtocell Networks Based on Bat Algorithm Open Access

    I Wayan MUSTIKA  Nifty FATH  Selo SULISTYO  Koji YAMAMOTO  Hidekazu MURATA  

     
    INVITED PAPER

      Pubricized:
    2018/10/15
      Vol:
    E102-B No:4
      Page(s):
    660-669

    Femtocell has been considered as a key promising technology to improve the capacity of a cellular system. However, the femtocells deployed inside a macrocell coverage are potentially suffered from excessive interference. This paper proposes a novel radio resource optimization in closed access femtocell networks based on bat algorithm. Bat algorithm is inspired by the behavior of bats in their echolocation process. While the original bat algorithm is designed to solve the complex optimization problem in continuous search space, the proposed modified bat algorithm extends the search optimization in a discrete search space which is suitable for radio resource allocation problem. The simulation results verify the convergence of the proposed optimization scheme to the global optimal solution and reveal that the proposed scheme based on modified bat algorithm facilitates the improvement of the femtocell network capacity.

  • Proactive Eavesdropping for Suspicious Millimeter Wave Wireless Communications with Spoofing Relay

    Cheng CHEN  Haibo DAI  Tianwen GUO  Qiang YU  Baoyun WANG  

     
    LETTER-Communication Theory and Signals

      Vol:
    E102-A No:4
      Page(s):
    691-696

    This paper investigates the wireless information surveillance in a suspicious millimeter wave (mmWave) wireless communication system via the spoofing relay based proactive eavesdropping approach. Specifically, the legitimate monitor in the system acts as a relay to simultaneously eavesdrop and send spoofing signals to vary the source transmission rate. To maximize the effective eavesdropping rate, an optimization problem for both hybrid precoding design and power distribution is formulated. Since the problem is fractional and non-convex, we resort to the Dinkelbach method to equivalently reduce the original problem into a series of non-fractional problems, which is still coupling. Afterwards, based on the BCD-type method, the non-fractional problem is reduced to three subproblems with two introduced parameters. Then the GS-PDD-based algorithm is proposed to obtain the optimal solution by alternately optimizing the three subproblems and simultaneously updating the introduced parameters. Numerical results verify the effectiveness and superiority of our proposed scheme.

  • Distributed Compressed Sensing via Generalized Approximate Message Passing for Jointly Sparse Signals

    Jingjing SI  Yinbo CHENG  Kai LIU  

     
    LETTER-Image

      Vol:
    E102-A No:4
      Page(s):
    702-707

    Generalized approximate message passing (GAMP) is introduced into distributed compressed sensing (DCS) to reconstruct jointly sparse signals under the mixed support-set model. A GAMP algorithm with known support-set is presented and the matching pursuit generalized approximate message passing (MPGAMP) algorithm is modified. Then, a new joint recovery algorithm, referred to as the joint MPGAMP algorithm, is proposed. It sets up the jointly shared support-set of the signal ensemble with the support exploration ability of matching pursuit and recovers the signals' amplitudes on the support-set with the good reconstruction performance of GAMP. Numerical investigation shows that the joint MPGAMP algorithm provides performance improvements in DCS reconstruction compared to joint orthogonal matching pursuit, joint look ahead orthogonal matching pursuit and regular MPGAMP.

  • Learning in Two-Player Matrix Games by Policy Gradient Lagging Anchor

    Shiyao DING  Toshimitsu USHIO  

     
    LETTER-Mathematical Systems Science

      Vol:
    E102-A No:4
      Page(s):
    708-711

    It is known that policy gradient algorithm can not guarantee the convergence to a Nash equilibrium in mixed policies when it is applied in matrix games. To overcome this problem, we propose a novel multi-agent reinforcement learning (MARL) algorithm called a policy gradient lagging anchor (PGLA) algorithm. And we prove that the agents' policies can converge to a Nash equilibrium in mixed policies by using the PGLA algorithm in two-player two-action matrix games. By simulation, we confirm the convergence and also show that the PGLA algorithm has a better convergence than the LR-I lagging anchor algorithm.

  • Simple and Complete Resynchronization for Wireless Sensor Networks Open Access

    Hiromi YAGIRI  Takeshi OKADOME  

     
    PAPER

      Pubricized:
    2018/10/15
      Vol:
    E102-B No:4
      Page(s):
    679-689

    The methods proposed in this paper enable resynchronization when a synchronization deviation occurs in a sensor node without a beacon or an ack in a wireless sensor network under ultra-limited but stable resources such as the energy generated from tiny solar cell batteries. The method for a single-hop network is straightforward; when a receiver does not receive data, it is simply placed in recovery mode, in which the receiver sets its cycle length TB to (b±γ)T, where b is non-negative integer, 0 < γ < 1, and T is its cycle length in normal mode, and in which the receiver sets its active interval WB to a value that satisfies WB ≥ W + γT, where W is its active interval in normal mode. In contrast, a sender stays in normal mode. Resynchronization methods for linear multi-hop and tree-based multi-hop sensor networks are constructed using the method for a single-hop network. All the methods proposed here are complete because they are always able to resynchronize networks. The results of simulations based on the resynchronization methods are given and those of an experiment using actual sensor nodes with wireless modules are also presented, which show that the methods are feasible.

4181-4200hit(42807hit)