Ieee Transactions on Communications, Accepted for Publication Generalized Design of Low-complexity Block Diagonalization Type Precoding Algorithms for Multiuser Mimo Systems
Ieee Transactions on Communications, Accepted for Publication Generalized Design of Low-complexity Block Diagonalization Type Precoding Algorithms for Multiuser Mimo Systems
复制标题
DOI：
--
复制
发表时间：
--
期刊：
影响因子：
--
通讯作者：
Keke Zu;R. C. de Lamare;M. Haardt
中科院分区：
文献类型：
--
作者：
Keke Zu;R. C. de Lamare;M. Haardt
基于块对角化（BD）的预编码技术是多用户MIMO （MU-MIMO）系统中众所周知的线性传输策略。通过在发射端采用bd型预编码算法，将MU-MIMO广播信道分解为多个独立并行的单用户MIMO （SU-MIMO）信道，在高数据速率下实现最大分集顺序。bd型预编码算法的主要计算复杂度来自于两种奇异值分解（SVD）运算，这取决于用户数量和每个用户信道矩阵的维数。本文提出了低复杂度预编码算法，以降低bd型预编码算法的计算复杂度，提高其性能。我们设计了一种基于通用信道反转技术、QR分解和晶格约简的策略，将MU-MIMO信道解耦为等效的SU-MIMO信道。分析和仿真结果表明，所提出的预编码算法具有与bd型预编码算法相当的和速率性能，误码率（BER）性能显著提高，且简化了接收机结构，且复杂度大大降低。
—Block diagonalization (BD) based precoding techniques are well-known linear transmit strategies for multiuser MIMO (MU-MIMO) systems. By employing BD-type precoding algorithms at the transmit side, the MU-MIMO broadcast channel is decomposed into multiple independent parallel single user MIMO (SU-MIMO) channels and achieves the maximum diversity order at high data rates. The main computational complexity of BD-type precoding algorithms comes from two singular value decomposition (SVD) operations, which depend on the number of users and the dimensions of each user's channel matrix. In this work, low-complexity precoding algorithms are proposed to reduce the computational complexity and improve the performance of BD-type precoding algorithms. We devise a strategy based on a common channel inversion technique, QR decompositions, and lattice reductions to decouple the MU-MIMO channel into equivalent SU-MIMO channels. Analytical and simulation results show that the proposed precoding algorithms can achieve a comparable sum-rate performance as BD-type precoding algorithms, substantial bit error rate (BER) performance gains, and a simplified receiver structure, while requiring a much lower complexity.