Real-Valued Fixed-Complexity Sphere Decoder for High Dimensional QAM-MIMO Systems
Real-Valued Fixed-Complexity Sphere Decoder for High Dimensional QAM-MIMO Systems
复制标题
DOI：
10.1109/tsp.2011.2159213
复制
发表时间：
2011-09
影响因子：
5.4
通讯作者：
C. Zheng;X. Chu;J. McAllister;Roger Francis Woods
中科院分区：
文献类型：
--
作者：
C. Zheng;X. Chu;J. McAllister;Roger Francis Woods
高性能，低计算复杂性检测算法的开发是实时多输入多输出（MIMO）通信系统设计的关键挑战。固定复合体球解码器（FSD）算法是最有前途的方法之一，由于其确定性，高度平行的结构，可以实现准ML解码精度和高性能实现。但是，随着MIMO传输天线的增加，计算复杂性的指数增长遭受了指数级的损失，从而严重限制了其可扩展性到更大的MIMO系统拓扑。在此对应关系中，我们通过将新颖的切割方案应用于实价FSD算法的解码树，提出了解决此问题的解决方案。新型的实价固定复合体形解码器（RFSD）算法得出的衍生成与FSD相似的准ML解码性能，但计算复杂性的平均降低了70％，正如我们从理论和实施方面的实施方面所证明的，对于高正面的放大器调制了（ QAM）-MIMO系统。
The development of high performance, low computational complexity detection algorithms is a key challenge for real-time multiple-input multiple-output (MIMO) communication system design. The fixed-complexity sphere decoder (FSD) algorithm is one of the most promising approaches, enabling quasi-ML decoding accuracy and high performance implementation due to its deterministic, highly parallel structure. However, it suffers from exponential growth in computational complexity as the number of MIMO transmit antennas increases, critically limiting its scalability to larger MIMO system topologies. In this correspondence, we present a solution to this problem by applying a novel cutting protocol to the decoding tree of a real-valued FSD algorithm. The new real-valued fixed-complexity sphere decoder (RFSD) algorithm derived achieves similar quasi-ML decoding performance as FSD, but with an average 70% reduction in computational complexity, as we demonstrate from both theoretical and implementation perspectives for quadrature amplitude modulation (QAM)-MIMO systems.