Low Complexity Pre-Equalization Algorithms for Zero-Padded Block Transmission

Author

Wen, Wenkun ; Xia, Minghua ; Wu, Yik-Chung

Author_Institution

LTE R&D Center, New Postcom Equip. Co., Ltd., Guangzhou, China

Volume

9

Issue

8

fYear

2010

fDate

8/1/2010 12:00:00 AM

Firstpage

2498

Lastpage

2504

Abstract

The zero-padded block transmission with linear time-domain pre-equalizer is studied in this paper. A matched filter is exploited to guarantee the stability of the zero-forcing (ZF) and minimum mean square error (MMSE) pre-equalization. Then, in order to compute the pre-equalizers efficiently, an asymptotic decomposition is developed for the positive-definite Hermitian banded Toeplitz matrix. Compared to the direct matrix inverse methods or the Levinson-Durbin algorithm, the computational complexity of the proposed algorithm is significantly decreased and there is no bit error rate degradation when data block length is large.

Keywords

Hermitian matrices; Toeplitz matrices; channel estimation; least mean squares methods; time-domain analysis; Levinson-Durbin algorithm; asymptotic decomposition; direct matrix inverse method; low complexity pre-equalization algorithm; minimum mean square error pre-equalization; positive-definite Hermitian banded Toeplitz matrix; time-domain pre-equalizer; zero-forcing pre-equalization; zero-padded block transmission; Bit error rate; Computational complexity; Degradation; Inverse problems; Matched filters; Matrix decomposition; Mean square error methods; Signal to noise ratio; Stability; Transmitters; Asymptotic equivalence; matched zero-padded (MZP) block transmission; pre-equalization;

fLanguage

English

Journal_Title

Wireless Communications, IEEE Transactions on

Publisher

ieee

ISSN

1536-1276

Type

jour

DOI

10.1109/TWC.2010.061710.090411

Filename

5494776