Title :
A blind symbol recovery for dual antenna OFDM systems
Author :
Son, Jae H. ; Williams, Douglas B.
Author_Institution :
Sch. of Electr. & Comput. Eng., Georgia Inst. of Technol., Atlanta, GA, USA
Abstract :
Blind symbol recovery is attractive in OFDM systems because it saves bandwidth that would otherwise be lost to training sequences or pilot tones. Here, a space-frequency implementation of iterative least square constant modulus algorithm (ILS-CMA) on dual antenna OFDM systems is explored and shown to have modest computational complexity compared to the conventional OFDM symbol recovery scheme using channel estimation and frequency domain equalization. It is shown through computer simulations that the symbol error rate (SER) performance of ILS-CMA is close to or even better than the perfect dual antenna combiner for the cases both with or without a cyclic prefix (CP). Also, a fast convergence behavior (less than 10 iterations) is achieved at 20 dB SNR or above with some modest convergence error value.
Keywords :
OFDM modulation; antenna arrays; channel estimation; computational complexity; convergence of numerical methods; error statistics; frequency-domain analysis; iterative methods; least squares approximations; 20 dB; blind symbol recovery; block adaptation scheme; channel estimation; computational complexity; convergence; cyclic prefix; dual antenna OFDM systems; fading channel; frequency domain equalization; iterative least square constant modulus algorithm; orthogonal frequency division multiplexing; space-frequency implementation; symbol error rate; time-varying channel; Bandwidth; Channel estimation; Computational complexity; Computer simulation; Convergence; Error analysis; Frequency domain analysis; Iterative algorithms; Least squares approximation; OFDM;
Conference_Titel :
Digital Signal Processing Workshop, 2002 and the 2nd Signal Processing Education Workshop. Proceedings of 2002 IEEE 10th
Print_ISBN :
0-7803-8116-5
DOI :
10.1109/DSPWS.2002.1231070