Fixed-complexity sphere encoder for multi-user MIMO systems
Fixed-complexity sphere encoder for multi-user MIMO systems
复制标题
用于多用户 MIMO 系统的固定复杂度球形编码器
DOI：
--
复制
发表时间：
2011
影响因子：
3.6
通讯作者：
K. Chang
中科院分区：
文献类型：
--
作者：
Manar Mohaisen;K. Chang
在本文中，我们提出了一个固定复杂度的球编码器（FSE）的多用户多输入多输出（MU-MIMO）系统。所提出的FSE实现了性能和复杂性之间的可扩展折衷。此外，因为它有一个并行树搜索结构，建议的编码器可以很容易地流水线，导致在前面的延迟大大减少。仿真和分析结果表明，在4 × 4 MU-MIMO系统中，该编码器的计算复杂度仅为传统QR分解M算法编码器（QRDM-E）的11.5%。此外，建议的编码器的编码吞吐量是7.5倍的QRDM-E的BER性能与可容忍的退化，同时实现最佳的分集阶数。
In this paper, we propose a fixed-complexity sphere encoder (FSE) for multi-user multi-input multi-output (MU-MIMO) systems. The proposed FSE accomplishes a scalable tradeoff between performance and complexity. Also, because it has a parallel tree-search structure, the proposed encoder can be easily pipelined, leading to a tremendous reduction in the preceding latency. The complexity of the proposed encoder is also analyzed, and we propose two techniques that reduce it. Simulation and analytical results demonstrate that in a 4 × 4 MU-MIMO system, the proposed FSE requires only 11.5% of the computational complexity needed by the conventional QR decomposition with M-algorithm encoder (QRDM-E). Also, the encoding throughput of the proposed encoder is 7.5 times that of the QRDM-E with tolerable degradation in the BER performance, while achieving the optimum diversity order.