.png){kind=icon}
.png){kind=icon}
Return
Low Complexity Pre-Equalization Algorithms for Zero-Padded Block Transmission
.png){kind=icon}
PRE
AI
DOI：10.1109/TWC.2010.061710.090411.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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:
Asymptotic equivalence
matched zero-padded (MZP) block transmission
pre-equalization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.7
Papers:
1.3W
Citations:
5.3W