.png){kind=icon}
返回
Low Complexity Detection Algorithms in Large-Scale MIMO Systems
.png){kind=icon}
PRE
AI
DOI：10.1109/TWC.2015.2495163.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this contribution, we present low-complexity detection algorithms in large-scale MIMO systems where they achieve significantly better bit error rate (BER) performance than known heuristic algorithms in large-scale MIMO literature, such as local ascent search (LAS) and reactive tabu search (RTS) algorithms, especially at higher-order modulations. The proposed techniques are developed from the conventional quadratic programming (QP) detector. The first one is based on performing two stages of a QP detector with a novel combination of both interference cancellation and shadow area constraints of the constellation. The second one is based on the branch and bound search tree algorithm. The efficacy of the proposed algorithms is investigated at various QAM modulations. Computer simulations show that the proposed algorithms outperform LAS and RTS algorithms in both uncoded and turbo coded BER performance, especially at higher QAM levels, with no significant change in complexity as the modulation level increases. Also, an extension of the QP detector for iterative detection and decoding is developed for the case of QPSK using a low complexity approach.
Keyword:
Large-scale MIMO
quadratic programming
two-stage quadratic programming
branch and bound
complexity
iterative detection and decoding
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.7
论文数:
1.3W
被引数:
5.3W
机构
引用论文
.png){kind=icon}
分享收藏Prognostic and Predictive Relevance of Primary Tumor Location in Patients With RAS Wild-Type Metastatic Colorectal CancerRAS 野生型转移性结直肠癌患者原发肿瘤位置的预后和预测相关性
OAAI
OAAI分享收藏
查看更多内容