IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Online ISSN : 1745-1337
Print ISSN : 0916-8508
Volume E96.A , Issue 9
Showing 1-12 articles out of 12 articles from the selected issue
Regular Section
  • Kenta NIWA, Yusuke HIOKA, Sumitaka SAKAUCHI, Ken'ichi FURUYA, Yoichi H ...
    Type: PAPER
    Subject area: Engineering Acoustics
    2013 Volume E96.A Issue 9 Pages 1831-1839
    Published: September 01, 2013
    Released: September 01, 2013
    JOURNALS RESTRICTED ACCESS
    A method to estimate sound source orientation in a reverberant room using a microphone array is proposed. We extend the conventional modeling of a room transfer function based on the image method in order to take into account the directivity of a sound source. With this extension, a transfer function between a sound source and a listener (or a microphone) is described by the superposition of transfer functions from each image source to the listener multiplied by the source directivity; thus, the sound source orientation can be estimated by analyzing how the image sources are distributed (power distribution of image sources) from observed signals. We applied eigenvalue analysis to the spatial correlation matrix of the microphone array observation to obtain the power distribution of image sources. Bsed on the assumption that the spatial correlation matrix for each set of source position and orientation is known a priori, the variation of the eigenspace can be modeled. By comparing the eigenspace of observed signals and that of pre-learned models, we estimated the sound source orientation. Through experiments using seven microphones, the sound source orientation was estimated with high accuracy by increasing the reverberation time of a room.
    Download PDF (2072K)
  • Cheol-Joong KIM, Dongkyoung CHWA
    Type: PAPER
    Subject area: Nonlinear Problems
    2013 Volume E96.A Issue 9 Pages 1840-1847
    Published: September 01, 2013
    Released: September 01, 2013
    JOURNALS RESTRICTED ACCESS
    This paper proposes the synchronization control method for two different unified chaotic systems with unknown mismatched parameters using sum of squares method. Previously, feedback-linearizing and stabilization terms were used in the controller for the synchronization problem. However, they used just a constant matrix as a stabilization control gain, whose performance is shown to be valid only for a linear model. Thus, we propose the novel control method for the synchronization of the two different unified chaotic systems with unknown mismatched parameters via sum of squares method. We design the stabilization control input which is of the polynomial form by sum of squares method and also the adaptive law for the estimation of the unknown mismatched parameter between the master and slave systems. Since we can use the polynomial control input which is dependent on the system states as the stabilization controller, the proposed method can have better performance than the previous methods. Numerical simulations for both uni-directional and bi-directional chaotic systems show the validity and advantage of the proposed method.
    Download PDF (1098K)
  • Dan NIU, Xiao WU, Zhou JIN, Yasuaki INOUE
    Type: PAPER
    Subject area: Circuit Theory
    2013 Volume E96.A Issue 9 Pages 1848-1856
    Published: September 01, 2013
    Released: September 01, 2013
    JOURNALS RESTRICTED ACCESS
    Finding DC operating points of nonlinear circuits is an important and difficult task. The Newton-Raphson method adopted in the SPICE-like simulators often fails to converge to a solution. To overcome this convergence problem, homotopy methods have been studied from various viewpoints. However, the previous studies are mainly focused on the bipolar transistor circuits. Also the efficiencies of the previous homotopy methods for MOS transistor circuits are not satisfactory. Therefore, finding a more efficient homotopy method for MOS transistor circuits becomes necessary and important. This paper proposes a Newton fixed-point homotopy method for MOS transistor circuits and proposes an embedding algorithm in the implementation as well. Moreover, the global convergence theorems of the proposed Newton fixed-point homotopy method for MOS transistor circuits are also proved. Numerical examples show that the efficiencies for finding DC operating points of MOS transistor circuits by the proposed MOS Newton fixed-point homotopy method with the two embedding types can be largely enhanced (can larger than 50%) comparing with the conventional MOS homotopy methods, especially for some large-scale MOS transistor circuits which can not be easily solved by the SPICE3 and HSPICE simulators.
    Download PDF (1143K)
  • XiaoBo JIANG, DeSheng YE, HongYuan LI, WenTao WU, XiangMin XU
    Type: PAPER
    Subject area: VLSI Design Technology and CAD
    2013 Volume E96.A Issue 9 Pages 1857-1863
    Published: September 01, 2013
    Released: September 01, 2013
    JOURNALS RESTRICTED ACCESS
    We propose an asynchronous datapath for the low-density parity-check decoder to decrease power consumption. Glitches and redundant computations are decreased by the asynchronous design. Taking advantage of the statistical characteristics of the input data, we develop novel key arithmetic elements in the datapath to reduce redundant computations. Two other types of datapaths, including normal synchronous design and clock-gating design, are implemented for comparisons with the proposed design. The three designs use similar architectures and realize the same function by using the 0.18µm process of the Semiconductor Manufacturing International Corporation. Post-layout result shows that the proposed asynchronous design exhibits the lowest power consumption. The proposed asynchronous design saves 48.7% and 21.9% more power than the normal synchronous and clock-gating designs, respectively. The performance of the proposed datapath is slightly worse than the clock-gating design but is better than the synchronous design. The proposed design is approximately 7% larger than the other two designs.
    Download PDF (2276K)
  • Fushan WEI, Zhenfeng ZHANG, Chuangui MA
    Type: PAPER
    Subject area: Cryptography and Information Security
    2013 Volume E96.A Issue 9 Pages 1864-1871
    Published: September 01, 2013
    Released: September 01, 2013
    JOURNALS RESTRICTED ACCESS
    In this paper, we point out that Yoon et al.'s gateway-oriented password-based authenticated key exchange (GPAKE) protocol is inefficiently and incorrectly designed to overcome the undetectable on-line dictionary attack. To remedy these problems, we propose a new GPAKE protocol and prove its security in the random oracle model. Performance analysis demonstrates that our protocol is more secure and efficient than previous protocols.
    Download PDF (977K)
  • Young-Sik KIM, Ji-Woong JANG, Sang-Hyo KIM, Jong-Seon NO
    Type: PAPER
    Subject area: Spread Spectrum Technologies and Applications
    2013 Volume E96.A Issue 9 Pages 1872-1882
    Published: September 01, 2013
    Released: September 01, 2013
    JOURNALS RESTRICTED ACCESS
    In this paper, for an odd prime p, new quaternary sequences of even period 2p with ideal autocorrelation property are constructed using the binary Legendre sequences of period p. For the new quaternary sequences, two properties which are considered as the major characteristics of pseudo-random sequences are derived. Firstly, the autocorrelation distribution of the proposed quaternary sequences is derived and it is shown that the autocorrelation values of the proposed quaternary sequences are optimal. For both p≡1 mod 4 and p≡3 mod 4, we can construct optimal quaternary sequences while only for p≡3 mod 4, the binary Legendre sequences can satisfy ideal autocorrelation property. Secondly, the linear complexity of the proposed quaternary sequences is also derived by counting non-zero coefficients of the discrete Fourier transform over the finite field Fq which is the splitting field of x2p-1. It is shown that the linear complexity of the quaternary sequences is larger than or equal to p or (3p+1)/2 for p≡1 mod 4 or p≡3 mod 4, respectively.
    Download PDF (755K)
  • Duc-Hung LE, Katsumi INOUE, Cong-Kha PHAM
    Type: LETTER
    Subject area: VLSI Design Technology and CAD
    2013 Volume E96.A Issue 9 Pages 1883-1888
    Published: September 01, 2013
    Released: September 01, 2013
    JOURNALS RESTRICTED ACCESS
    A CAM-based matching system for fast exact pattern matching is implemented on a hardware system with FPGA and ASIC. The system has a simple structure, and does not employ any Central Processor Unit (CPU) as well as complicated computations. We take advantage of Content Addressable Memory (CAM) which has an ability of parallel multi-match mode for designing the system. The system is applied to fast pattern matching with various required search patterns without using search principles. In this paper, the authors present a CAM-based system for fast exact pattern matching on 2-D data.
    Download PDF (668K)
  • Man LIANG, Haibin KAN
    Type: LETTER
    Subject area: Cryptography and Information Security
    2013 Volume E96.A Issue 9 Pages 1889-1894
    Published: September 01, 2013
    Released: September 01, 2013
    JOURNALS RESTRICTED ACCESS
    Wireless sensor network (WSN) using network coding is vulnerable to pollution attacks. Existing authentication schemes addressing this attack either burden the sensor node with a higher computation overhead, or fail to provide an efficient way to mitigate two recently reported attacks: tag pollution attacks and repetitive attacks, which makes them inapplicable to WSN. This paper proposes an efficient hybrid cryptographic scheme for WSN with securing network coding. Our scheme can resist not only normal pollution attacks, but the emerging tag pollution and repetitive attacks in an efficient way. In particular, our scheme is immediately suited for distributing multiple generations using a single public key. Experimental results show that our scheme can significantly improve the computation efficiency at a sensor node under the two above-mentioned attacks.
    Download PDF (160K)
  • Songtao LIANG, Haibin KAN
    Type: LETTER
    Subject area: Coding Theory
    2013 Volume E96.A Issue 9 Pages 1895-1900
    Published: September 01, 2013
    Released: September 01, 2013
    JOURNALS RESTRICTED ACCESS
    This paper introduces two schemes to put the decoding of the convolutional network code (CNC) into practice, which are named the Intermittent Packet Transmission Scheme (IPTS) and the Redundancy Packet Transmission Scheme (RPTS). According to the decoding formula of the sink nodes, we can see that, at the time k+δ in order to decode the source packet generated at time k, the sink node should know all the source packets generated before k-1. This is impractical. The two schemes we devised make it unnecessary. A construction algorithm is also given about the RPTS networks. For the two schemes, we analyze the strengths and weaknesses and point out their implemented condition.
    Download PDF (432K)
  • Jiao DU, Qiaoyan WEN, Jie ZHANG, Xin LIAO
    Type: LETTER
    Subject area: Coding Theory
    2013 Volume E96.A Issue 9 Pages 1901-1904
    Published: September 01, 2013
    Released: September 01, 2013
    JOURNALS RESTRICTED ACCESS
    Orthogonal arrays have important applications in statistics and computer science, as well as in coding theory. In this letter, a new construction method of symmetric orthogonal arrays of strength t is proposed, which is a concatenation of two orthogonal partitions according to a latin square. As far as we know, this is a new construction of symmetric orthogonal arrays of strength t, where t is a given integer. Based on the different latin squares, we also study the enumeration problem of orthogonal partitions, and a lower bound on the count of orthogonal partitions is derived.
    Download PDF (97K)
  • Hye-Yeon JEONG, Hyoung-Kyu SONG
    Type: LETTER
    Subject area: Communication Theory and Signals
    2013 Volume E96.A Issue 9 Pages 1905-1908
    Published: September 01, 2013
    Released: September 01, 2013
    JOURNALS RESTRICTED ACCESS
    In this letter, an adaptive detection scheme for a multiple-input multiple-output (MIMO) system is proposed. In order to reduce the complexity of the decoding steps, the initial symbol is obtained by a MMSE equalizer and then the symbol ordering is performed by the channel state. After the received symbols are divided according to the channel state, some of the symbols are detected by using the MMSE detector with low complexity. With cancelation processing, the remainder symbols are detected for the K-best detector. The proposed adaptive detection scheme combines the MMSE and K-best detector based on the channel state. Therefore, the proposed adaptive detector achieves a good performance.
    Download PDF (349K)
  • Ji-Hoon LEE, Woo-Jin SONG
    Type: LETTER
    Subject area: Communication Theory and Signals
    2013 Volume E96.A Issue 9 Pages 1909-1913
    Published: September 01, 2013
    Released: September 01, 2013
    JOURNALS RESTRICTED ACCESS
    Spectrum sensing is one of the main functions in cognitive radio networks. To improve the sensing performance and increase spectrum efficiency, a number of cooperative spectrum sensing methods have been proposed. However, most of these methods focused on a single-channel environment. In this letter, we present a novel cooperative spectrum sensing method based on cooperator selection in a multi-channel cognitive radio network. Using reinforcement learning, a cognitive radio user can select reliable and robust cooperators, without any a priori knowledge. Using the proposed method, a cognitive radio user can achieve better sensing capability and overcome performance degradation problems due to malicious users or erratic user behavior. Numerical results show that the proposed method can achieve excellent performance.
    Download PDF (571K)
feedback
Top