IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Online ISSN : 1745-1337
Print ISSN : 0916-8508
Volume E102.A , Issue 4
Showing 1-15 articles out of 15 articles from the selected issue
Regular Section
  • Kai WANG, Man ZHOU, Lin ZHOU, Jiaying TU
    Type: PAPER
    Subject area: Digital Signal Processing
    2019 Volume E102.A Issue 4 Pages 616-623
    Published: April 01, 2019
    Released: April 01, 2019
    JOURNALS RESTRICTED ACCESS

    Many autocorrelation-based frequency estimation algorithms have been proposed. However, some of them cannot construct a strict linear prediction (LP) property among the adjacent autocorrelation lags, which affects the estimators' performance. To improve the precision of frequency estimation, two novel autocorrelation based frequency estimation methods of the real sinusoid signal in additive white Gaussian noise (AWGN) are proposed in this paper. Firstly, a simple method is introduced to transform the real sinusoid signal into the noncircular signal. Secondly, the autocorrelation of the noncircular signal is analyzed and a strict LP property is constructed among the adjacent autocorrelation lags of the noncircular signal. Thirdly, the least squares (LS) and reformed Pisarenko harmonic decomposer (RPHD) frameworks are employed to improve estimation accuracy. The simulation results match well with the theoretical values. In addition, computer simulations demonstrate that the proposed algorithm provides high estimation accuracy and good noise suppression capability.

    Download PDF (703K)
  • Kota ASAI, Shigeru YAMASHITA
    Type: PAPER
    Subject area: VLSI Design Technology and CAD
    2019 Volume E102.A Issue 4 Pages 624-632
    Published: April 01, 2019
    Released: April 01, 2019
    JOURNALS RESTRICTED ACCESS

    A topological quantum circuit is a representation model for topological quantum computation, which attracts much attention recently as a promising fault-tolerant quantum computation model by using 3D cluster states. A topological quantum circuit can be considered as a set of “loops,” and we can transform the topology of loops without changing the functionality of the circuit if the transformation satisfies certain conditions. Thus, there have been proposed many researches to optimize topological quantum circuits by transforming the topology. There are two directions of research to optimize topological quantum circuits. The first group of research considers so-called a placement and wiring problem where we consider how to place “parts” in a 3D space which corresponds to already optimized sub-circuits. The second group of research focuses on how to optimize the structure and locations of loops in a relatively small circuit which is treated as one part in the above-mentioned first group of research. This paper proposes a new idea for the second group of research; our idea is to consider topological transformations as a placement and wiring problem for modules which we derive from the information how loops are crossed. By using such a formulation, we can use the techniques for placement and wiring problems, and successfully obtain an optimized solution. We confirm by our experiment that our method indeed can reduce the cost much more than the method by Paetznick and Fowler.

    Download PDF (2196K)
  • Tao XIE, Jiang ZHU, Qian CHENG, Junshan LUO
    Type: PAPER
    Subject area: Communication Theory and Signals
    2019 Volume E102.A Issue 4 Pages 633-640
    Published: April 01, 2019
    Released: April 01, 2019
    JOURNALS RESTRICTED ACCESS

    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.

    Download PDF (2809K)
  • Tensei NISHIMURA, Kazuaki ISHIKAWA, Toshinori TAKAYAMA, Masao YANAGISA ...
    Type: PAPER
    Subject area: Intelligent Transport System
    2019 Volume E102.A Issue 4 Pages 641-653
    Published: April 01, 2019
    Released: April 01, 2019
    JOURNALS RESTRICTED ACCESS

    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.

    Download PDF (1718K)
  • Jun WANG, Lei HU, Ning LI, Chang TIAN, Zhaofeng ZHANG, Mingyong ZENG, ...
    Type: PAPER
    Subject area: Image
    2019 Volume E102.A Issue 4 Pages 654-664
    Published: April 01, 2019
    Released: April 01, 2019
    JOURNALS RESTRICTED ACCESS

    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.

    Download PDF (5154K)
  • Bo WANG, Yuanzheng LIU, Xiaohua ZHANG, Jun CHENG
    Type: LETTER
    Subject area: Nonlinear Problems
    2019 Volume E102.A Issue 4 Pages 665-667
    Published: April 01, 2019
    Released: April 01, 2019
    JOURNALS RESTRICTED ACCESS

    This paper concerned the research on a memristive chaotic system and the generated random sequence; by constructing a piecewise-linear memristor model, a kind of chaotic system is constructed, and corresponding numerical simulation and dynamical analysis are carried out to show the dynamics of the new memristive chaotic system. Finally the proposed memristive chaotic system is used to generate random sequence for the possible application in encryption field.

    Download PDF (738K)
  • Seungtaek SONG, Namhyun KIM, Sungkil LEE, Joyce Jiyoung WHANG, Jinkyu ...
    Type: LETTER
    Subject area: Algorithms and Data Structures
    2019 Volume E102.A Issue 4 Pages 668-671
    Published: April 01, 2019
    Released: April 01, 2019
    JOURNALS RESTRICTED ACCESS

    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.

    Download PDF (474K)
  • Yindong CHEN, Liu ZHANG, Deng TANG, Weihong CAI
    Type: LETTER
    Subject area: Cryptography and Information Security
    2019 Volume E102.A Issue 4 Pages 672-675
    Published: April 01, 2019
    Released: April 01, 2019
    JOURNALS RESTRICTED ACCESS

    In recent years, algebraic attacks and fast algebraic attacks have received a lot of attention in the cryptographic community. There are three Boolean functions achieving optimal algebraic immunity based on primitive element of F2n. The support of Boolean functions in [1]-[3] have the same parameter s, which makes us have a large number of Boolean functions with good properties. However, we prove that the Boolean functions are affine equivalence when s takes different values.

    Download PDF (144K)
  • Minghui YANG, Dongdai LIN, Qiuyan WANG, Jian GAO
    Type: LETTER
    Subject area: Cryptography and Information Security
    2019 Volume E102.A Issue 4 Pages 676-679
    Published: April 01, 2019
    Released: April 01, 2019
    JOURNALS RESTRICTED ACCESS

    In this paper, new classes of binary generalized cyclotomic sequences of period 2pm+1qn+1 are constructed. These sequences are balanced. We calculate the linear complexity of the constructed sequences with a simple method. The results show that the linear complexity of such sequences attains the maximum.

    Download PDF (147K)
  • Zongxiang YI, Yuyin YU, Chunming TANG, Yanbin ZHENG
    Type: LETTER
    Subject area: Cryptography and Information Security
    2019 Volume E102.A Issue 4 Pages 680-684
    Published: April 01, 2019
    Released: April 01, 2019
    JOURNALS RESTRICTED ACCESS

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

    Download PDF (301K)
  • Fanxin ZENG, Lijia GE, Xiping HE, Guixin XUAN, Guojun LI, Zhenyu ZHANG ...
    Type: LETTER
    Subject area: Information Theory
    2019 Volume E102.A Issue 4 Pages 685-690
    Published: April 01, 2019
    Released: April 01, 2019
    JOURNALS RESTRICTED ACCESS

    The shift-and-add property (SAP) of a p-ary m-sequence {ak} with period N=pn-1 means that this sequence satisfies the equation {ak+η}+{ak+τ}={ak+λ} for some integers η, τ and λ. For an arbitrarily-given p-ary m-sequence {ak}, we develop an algebraic approach to determine the integer λ for the arbitrarily-given integers η and τ. And all trinomials can be given. Our calculation only depends on the reciprocal polynomial of the primitive polynomial which produces the given m-sequence {ak}, and the cyclotomic cosets mod pn-1.

    Download PDF (280K)
  • Cheng CHEN, Haibo DAI, Tianwen GUO, Qiang YU, Baoyun WANG
    Type: LETTER
    Subject area: Communication Theory and Signals
    2019 Volume E102.A Issue 4 Pages 691-696
    Published: April 01, 2019
    Released: April 01, 2019
    JOURNALS RESTRICTED ACCESS

    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.

    Download PDF (398K)
  • Ohyun JO, Juyeop KIM, Kyung-Seop SHIN, Gyung-Ho HWANG
    Type: LETTER
    Subject area: Communication Theory and Signals
    2019 Volume E102.A Issue 4 Pages 697-701
    Published: April 01, 2019
    Released: April 01, 2019
    JOURNALS RESTRICTED ACCESS

    To improve the efficiency of spectrum utilization, cognitive radio systems attempt to use temporarily unoccupied spectrum which is referred to as a spectrum hole. To this end, QoS (Quality of Service) is one of the most important issues in practical cognitive radio systems. In this article, an efficient spectrum management scheme using self-reserving spectrum is proposed to support QoS for cognitive radio users. The self-reservation of a spectrum hole can minimize service dropping probability by using the statistical characteristics of spectrum bands while using optimum amount of resources. In addition, it realizes seamless service for users by eliminating spectrum entry procedure that includes spectrum sensing, spectrum request, and spectrum grant. Performance analysis and intensive system level simulations confirm the efficiency of the proposed algorithms.

    Download PDF (307K)
  • Jingjing SI, Yinbo CHENG, Kai LIU
    Type: LETTER
    Subject area: Image
    2019 Volume E102.A Issue 4 Pages 702-707
    Published: April 01, 2019
    Released: April 01, 2019
    JOURNALS RESTRICTED ACCESS

    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.

    Download PDF (355K)
  • Shiyao DING, Toshimitsu USHIO
    Type: LETTER
    Subject area: Mathematical Systems Science
    2019 Volume E102.A Issue 4 Pages 708-711
    Published: April 01, 2019
    Released: April 01, 2019
    JOURNALS RESTRICTED ACCESS

    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.

    Download PDF (509K)
feedback
Top