.png){kind=icon}
返回
Iterative Reduced-Search Decoding for Coded Partial-Response Channels
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2008.060427.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The full-complexity soft-input/soft-output (SISO) detector based on the BUR algorithm for coded partial-response channels has a computational complexity growing exponentially with channel memory length. In this letter, we propose a low-complexity soft-output channel detector based on the Chase decoding algorithm, which was previously applied to decode turbo product codes. At each iteration, the proposed detector forms a candidate list using all possible combinations of bit patterns in the weakest indices based on tentative hard estimates and a priori information fed back from the outer decoder. To demonstrate the performance/complexity tradeoff of the proposed detector, simulation results over rate-8/9 turbo-coded EPR4 and ME(2)PR4 channels are presented, respectively. It is shown that the proposed detector can significantly reduce the computational complexity with only a small performance loss compared to the BCJR algorithm.
Keyword:
Chase decoding
local search
turbo codes
turbo equalization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.3
论文数:
1.2W
被引数:
4.2W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容