环上基于前向-后向递归的低复杂度MIMO检测器的收敛性和密度演化
Convergence and Density Evolution of a Low-Complexity MIMO Detector based on Forward-Backward Recursion over a Ring
摘要：
研究了一种基于环型成对图的低复杂度迭代MIMO检测算法的收敛性和密度演化。要考虑的检测算法实际上是前向-后向递归，并且最初在[13]中提出，其中分析了高斯输入的链路级性能和收敛性。本文给出了离散字母表的收敛性证明和二进制输入的密度演化框架，以给出在没有信道编码的情况下的平均SINR和出错率（BER）的渐近性能。通过密度演化得到的误码率曲线与仿真结果吻合较好，验证了密度演化分析的有效性和检测算法的性能。
英文摘要：
Convergence and density evolution of a low complexity, iterative MIMO detection based on belief propagation (BP) over a ring-type pair-wise graph are presented in this paper. The detection algorithm to be considered is effectively a forward-backward recursion and was originally proposed in [13], where the link level performance and the convergence for Gaussian input were analyzed. Presented here are the convergence proof for discrete alphabet and the density evolution framework for binary input to give an asymptotic performance in terms of average SINR and bit error rate (BER) without channel coding. The BER curve obtained via density evolution shows a good match with simulation results, verifying the effectiveness of the density evolution analysis and the performance of the detection algorithm.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
