Low complexity pre-equalization algorithms for zero-padded block transmission

Authors:
Wenkun Wen;Minghua Xia;Yik-Chung Wu
Affiliations:
New Postcom Equipment Co., Ltd., LTE R&D Center, Guangzhou, China;Department of Electrical and Electronic Engineering, The University of Hong Kong, Hong Kong;Department of Electrical and Electronic Engineering, The University of Hong Kong, Hong Kong
Venue:
IEEE Transactions on Wireless Communications
Year:
2010

Citing 10
Cited 0

Digital signal processing (3rd ed.): principles, algorithms, and applications

Digital signal processing (3rd ed.): principles, algorithms, and applications
Matrix computations (3rd ed.)

Matrix computations (3rd ed.)
Precoding and Signal Shaping for Digital Transmission

Precoding and Signal Shaping for Digital Transmission
Wireless Communications

Wireless Communications
Toeplitz and circulant matrices: a review

Communications and Information Theory
Full-rank and rank-deficient precoding schemes for single-carrier block transmissions

IEEE Transactions on Signal Processing
Sensitivity of Multiband ZP-OFDM Ultra-Wide-Band and Receivers to Synchronization Errors

IEEE Transactions on Signal Processing
Redundant filterbank precoders and equalizers. I. Unification andoptimal designs

IEEE Transactions on Signal Processing
Redundant filterbank precoders and equalizers. II. Blind channelestimation, synchronization, and direct equalization

IEEE Transactions on Signal Processing
Linear transmit processing in MIMO communications systems

IEEE Transactions on Signal Processing - Part I

Quantified Score

Hi-index	0.01

Visualization

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.