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

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 asy...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on wireless communications 2010-08, Vol.9 (8), p.2498-2504
Main Authors: Wen, Wenkun, Xia, Minghua, Wu, Yik-Chung
Format: Article
Language:English
Subjects:
Algorithms
Asymptotic equivalence
Asymptotic properties
Bit error rate
Blocking
Complexity
Computational complexity
Degradation
Inverse method
Inverse problems
Matched filters
matched zero-padded (MZP) block transmission
Matrix decomposition
Mean square error methods
pre-equalization
Signal to noise ratio
Stability
Transmitters
Wireless communication
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1536-1276
1558-2248
DOI:10.1109/TWC.2010.061710.090411