.png){kind=icon}
返回
The list-sequential (LISS) algorithm and its application
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2007.896097.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
For iterative detection/decoding (turbo) schemes, we modify sequential decoding, which contrary to a posteriori probability (APP) Bahl-Cocke-Jelinek-Raviv (BCJR) decoding, enjoys a complexity almost independent of the number of states. This novel list-sequential (LISS) decoder avoids most of the drawbacks of the classical sequential decoders, such as variable workload and erased frames when working within a turbo scheme. It uses a metric containing a priori and channel values, a metric length bias term for speeding up the tree search, a soft extension of paths without increasing the stack size, and soft weighting to obtain a soft output. We present several turbo applications using the LISS including equalization, single-antenna interference cancellation, multiuser and multiple-input multiple-output detection. It is shown that the LISS achieves the optimal (genie) or APP performance at a bit-error rate after the outer decoder of less than 10(-4), but it also works with channels which have a high number of taps, constellation points, antennas, and states where the APP (BCJR) algorithm becomes infeasible.
Keyword:
equalization
interference cancellation
multiple-input multiple-output (MIMO)
multiuser detection (MUD)
sequential decoding
turbo detection
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
暂无机构信息
引用论文
.png){kind=icon}
查看更多内容