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