返回
A Fixed-Complexity Smart Candidate Adding Algorithm for Soft-Output MIMO Detection
DOI:10.1109/JSTSP.2009.2035800.png)
摘要
En 中文
We present a soft-output multiple-input multiple-output (MIMO) detection algorithm that achieves near max-log optimal error rate performance with low- and fixed-computational complexity. The proposed smart ordering and candidate adding (SOCA) algorithm combines a smart-ordered QR decomposition with smart candidate adding and a parallel layer-by-layer search of the detection tree. In contrast to prior algorithms that use smart candidate adding, the proposed algorithm has fixed computational complexity, and it never visits a node more than once. Results indicate that the SOCA algorithm has an attractive performance-complexity profile for both fast and slow fading 4 4 and 8 8 MIMO channels with quadrature amplitude modulation (QAM) inputs.
Keyword:
Breadth-first
list detection
parallel smart candidate adding
smart-ordered QR
smart ordering and candidate adding (SOCA)
soft-output multiple-input multiple-output (MIMO) detection
tree search
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.7
论文数:
2.0K
被引数:
1.4W
机构
引用论文
Extending a fixed-complexity sphere decoder to obtain likelihood information for turbo-MIMO systems扩展固定复杂度球形解码器以获取turbo-mimo系统的似然信息

