Subspace-Based Blind Channel Identification for Cyclic Prefix Systems Using Few Received Blocks
Borching Su
Vaidyanathan, P.P.
California Inst. for Technol., Pasadena;
This paper appears in: Signal Processing, IEEE Transactions on
Publication Date: Oct. 2007
Volume: 55,
Issue: 10
On page(s): 4979-4993
ISSN: 1053-587X
INSPEC Accession Number: 9624773
Digital Object Identifier: 10.1109/TSP.2007.896262
Current Version Published: 2007-09-24
Abstract
In this paper, a novel generalization of subspace-based blind channel identification methods in cyclic prefix (CP) systems is proposed. For the generalization, a new system parameter called repetition index is introduced whose value is unity for previously reported special cases. By choosing a repetition index larger than unity, the number of received blocks needed for blind identification is significantly reduced compared to all previously reported methods. This feature makes the method more realistic especially in wireless environments where the channel state is usually fast-varying. Given the number of received blocks available, the minimum value of repetition index is derived. Theoretical limit allows the proposed method to perform blind identification using only three received blocks in absence of noise. In practice, the number of received blocks needed to yield a satisfactory bit-error-rate (BER) performance is usually on the order of half the block size. Simulation results not only demonstrate the capability of the algorithm to perform blind identification using fewer received blocks, but also show that in some cases system performance can be improved by choosing a repetition index larger than needed. Simulation of the proposed method over time-varying channels clearly demonstrates the improvement over previously reported methods.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
