多天线系统译码的矩阵提升半定规划
Matrix-Lifting Semi-Definite Programming for Decoding in Multiple Antenna Systems
摘要：
本文提出了一种计算效率高的多天线系统的解码器。所提出的算法可以用于任何星座（QAM或PSK）和任何标记方法。解码器是基于矩阵提升半定规划（SDP）。所提出的方法的强度在于一个新的松弛算法应用于Mobasher等人的方法。这导致变量的数量从$(NK+1)^2$减少到$(2N+K)^2$，其中$N$是天线的数量和$K$是在每个实维星座点的数量。由于求解SDP的计算复杂性是变量数目的多项式函数，因此我们具有显著的复杂性降低。此外，该方法提供了一个更好的性能相比，最好的准最大似然解码方法在文献中报道。
英文摘要：
This paper presents a computationally efficient decoder for multiple antenna systems. The proposed algorithm can be used for any constellation (QAM or PSK) and any labeling method. The decoder is based on matrix-lifting Semi-Definite Programming (SDP). The strength of the proposed method lies in a new relaxation algorithm applied to the method of Mobasher et al. This results in a reduction of the number of variables from $(NK+1)^2$ to $(2N+K)^2$, where $N$ is the number of antennas and $K$ is the number of constellation points in each real dimension. Since the computational complexity of solving SDP is a polynomial function of the number of variables, we have a significant complexity reduction. Moreover, the proposed method offers a better performance as compared to the best quasi-maximum likelihood decoding methods reported in the literature.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
