.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Asymptotic equivalence
matched zero-padded (MZP) block transmission
pre-equalization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.7
论文数:
1.3W
被引数:
5.3W
机构
引用论文
.png){kind=icon}
Signal shaping for peak-power and dynamics reduction in transmission schemes employing precoding
PREAI
分享收藏
查看更多内容