IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Online ISSN : 1745-1337
Print ISSN : 0916-8508
Volume E94.A , Issue 5
Showing 1-6 articles out of 6 articles from the selected issue
Regular Section
  • Zhenyu ZHOU, Takuro SATO
    Type: PAPER
    Subject area: Digital Signal Processing
    2011 Volume E94.A Issue 5 Pages 1173-1183
    Published: May 01, 2011
    Released: May 01, 2011
    JOURNALS RESTRICTED ACCESS
    Due to the reuse factor reduction, the attendant increase in co-channel interference (CCI) becomes the limiting factor in the performance of the orthogonal frequency division multiplexing (OFDM) based cellular systems. In the previous work, we proposed the least mean square-blind joint maximum likelihood sequence estimation (LMS-BJMLSE) algorithm, which is effective for CCI cancellation in OFDM systems with only one receive antenna. However, LMS-BJMLSE requires a long training sequence (TS) for channel estimation, which reduces the transmission efficiency. In this paper, we propose a subcarrier identification and interpolation algorithm, in which the subcarriers are divided into groups based on the coherence bandwidth, and the slowest converging subcarrier in each group is identified by exploiting the correlation between the mean-square error (MSE) produced by LMS and the mean-square deviation (MSD) of the desired channel estimate. The identified poor channel estimate is replaced by the interpolation result using the adjacent subcarriers' channel estimates. Simulation results demonstrate that the proposed algorithm can reduce the required training sequence dramatically for both the cases of single interference and dual interference. We also generalize LMS-BJMLSE from single antenna to receiver diversity, which is shown to provide a huge improvement.
    Download PDF (2290K)
  • Kil Hyun KWON, Dae Gwan LEE
    Type: PAPER
    Subject area: Digital Signal Processing
    2011 Volume E94.A Issue 5 Pages 1184-1193
    Published: May 01, 2011
    Released: May 01, 2011
    JOURNALS RESTRICTED ACCESS
    We find necessary and sufficient conditions for the (shifted) oversampling expansions to hold in wavelet subspaces. In particular, we characterize scaling functions with the (shifted) oversampling property. We also obtain L2 and L norm estimates for the truncation and aliasing errors of the oversampling expansion.
    Download PDF (313K)
  • Sehoon KIM, Sangchul WON
    Type: PAPER
    Subject area: Systems and Control
    2011 Volume E94.A Issue 5 Pages 1194-1200
    Published: May 01, 2011
    Released: May 01, 2011
    JOURNALS RESTRICTED ACCESS
    In this paper, we propose a robust state estimation method using a particle filter (PF) for a class of nonlinear systems which have stochastic parameter uncertainties. A robust PF was designed using prediction and correction structure. The proposed PF draws particles from a simple proposal density function and corrects the particles with particle-wise correction gains. We present a method to obtain an error variance of each particle and its upper bound, which is minimized to determine the correction gain. The proposed method is less restrictive on system nonlinearities and noise statistics; moreover, it can be applied regardless of system stability. The effectiveness of the proposed robust PF is illustrated via an example based on Chua's circuit.
    Download PDF (581K)
  • Minglu JIANG, Zhangcai HUANG, Atsushi KUROKAWA, Qiang LI, Bin LIN, Yas ...
    Type: PAPER
    Subject area: VLSI Design Technology and CAD
    2011 Volume E94.A Issue 5 Pages 1201-1209
    Published: May 01, 2011
    Released: May 01, 2011
    JOURNALS RESTRICTED ACCESS
    Gate delay evaluation is always a vital concern for high-performance digital VLSI designs. As the feature size of VLSIs decreases to the nano-meter region, the work to obtain an accurate gate delay value becomes more difficult and time consuming than ever. The conventional methods usually use iterative algorithms to ensure the accuracy of the effective capacitance Ceff, which is usually used to compute the gate delay with interconnect loads and to capture the output signal shape of the real gate response. Accordingly, the efficiency is sacrificed. In this paper, an accurate and efficient approach is proposed for gate delay estimation. With the linear relationship of gate output time points and Ceff, a polynomial approximation is used to make the nonlinear effective capacitance equation be solved without iterative method. Compared to the conventional methods, the proposed method improves the efficiency of gate delay calculation. Meanwhile, experimental results show that the proposed method is in good agreement with SPICE results and the average error is 2.8%.
    Download PDF (1048K)
  • Sang-Dong KIM, Jong-Hun LEE
    Type: LETTER
    Subject area: Digital Signal Processing
    2011 Volume E94.A Issue 5 Pages 1210-1213
    Published: May 01, 2011
    Released: May 01, 2011
    JOURNALS RESTRICTED ACCESS
    In this paper, we propose a memory-efficient structure for a pulse Doppler radar in order to reduce the hardware's complexity. The conventional pulse Doppler radar is computed by fast frequency transform (FFT) of all range cells in order to extract the velocity of targets. We observed that this method requires a huge amount of memory to perform the FFT processes for all of the range cells. Therefore, instead of detecting the velocity of all range cells, the proposed architecture extracts the velocity of the targets by using the cells related to the moving targets. According to our simulations and experiments, the detection performance of this proposed architecture is 93.5%, and the proposed structure can reduce the hardware's complexity by up to 66.2% compared with the conventional structure.
    Download PDF (321K)
  • Xiaoni DU, Zhixiong CHEN
    Type: LETTER
    Subject area: Information Theory
    2011 Volume E94.A Issue 5 Pages 1214-1217
    Published: May 01, 2011
    Released: May 01, 2011
    JOURNALS RESTRICTED ACCESS
    Let p be an odd prime number. We define a family of quaternary sequences of period 2p using generalized cyclotomic classes over the residue class ring modulo 2p. We compute exact values of the linear complexity, which are larger than half of the period. Such sequences are ‘good’ enough from the viewpoint of linear complexity.
    Download PDF (79K)
feedback
Top