上海交通大学 电子信息与电气工程学院,上海,200240
纸质出版:2019
移动端阅览
吕尉邦, 贺光辉. 一种适用于多用户MIMO系统的低复杂度S-GMI-THP预编码算法及硬件实现[J]. 微电子学与计算机, 2019, 36(7): 6-11.
LÜ Wei-bang, HE Guang-hui. A low complexity S-GMI-THP precoding algorithm and hardware implementation for multi-user MIMO systems[J]. 2019, 36(7): 6-11.
区块对角化(Block Diagonalization
BD)预编码技术广泛应用于多用户MIMO(Multiple-Input Multiple-Output)
其算法的计算复杂性主要来源于两次奇异值分解操作.S-GMI(Simplified Generalized MMSE Channel Inversion)算法提出以一次QR分解代替BD算法中一次奇异值分解.本文提出S-GMI-THP算法
使用THP(Tomlinson-Harashima Precoding)代替S-GMI算法中的奇异值分解
极大降低了复杂度.分析与仿真结果表明
所提出的S-GMI-THP算法相较于THP与MMSE算法可以实现明显的BER性能增益.文章还给出了S-GMI-THP算法整体框图以及8×8规模矩阵求逆模块的硬件实现架构
该结构在virtex-7平台以较低的资源实现了23.8 M Matrix/s的吞吐.
Block Diagonalization precoding technology is widely used in Multiple-Input Multiple-Output system. The computational complexity of the algorithm is mainly derived from two singular value decomposition operations. The Simplified Generalized MMSE Channel Inversion algorithm proposes to replace the singular value decomposition in the BD algorithm with a QR decomposition. This paper proposes the S-GMI-THP algorithm
which uses Tomlinson-Harashima Precoding instead of the singular value decomposition in the S-GMI algorithm
which greatly reduces the complexity. The analysis and simulation results show that the proposed S-GMI-THP algorithm can achieve significant BER performance gain compared to THP and MMSE algorithms. The article also gives the overall block diagram of the S-GMI-THP algorithm and the hardware implementation architecture of the 8×8 scale matrix inversion module
which achieves 23.8M Matrix/s throughput with low resources on the virtex-7 platform.
CHOI L U, MURCH R D. A transmit preprocessing technique for multiuser MIMO systems using a decomposition approach[J]. IEEE Trans Wireless Commun, 2004, 3(1):20-24. DOI: 20
LAROCHE I, ROY S. An efficient regular matrix inversion circuit architecture for MIMO processing[C]// IEEE International Symposium on Circuits and Systems, 2006. ISCAS 2006. Island of Kos, Greece. IEEE, 2006.
CHEN D, SIMA M. Fixed-point CORDIC-based QR decomposition by givens rotations on FPGA[C]// International Conference on Reconfigurable Computing and Fpgas. Cancun, Mexico, IEEE Computer Society, 2011: 327-332.
LUDWIG F, BUDWEG A, PAUL S. FPGA Implementation of ZF-THP for MU-MISO-OFDM systems[C]// OFDM 2012, International OFDM Workshop. Essen, Germany, VDE, 2012: 1-5.
KING C. Fundamentals of wireless communications[C]// Rural Electric Power Conference. Calgary, Alberta, Canada, IEEE, 2014: B6-1-5.
张勋勇.多用户MIMO预编码及小区间干扰协调技术的研究[D].上海: 上海交通大学, 2014.
SHINGO YOSHIZAWA, DAISUKE NAKAGAWA, NOZOMI MIYAZAKI, et al. LSI development of 8×8 single-user MIMO-OFDM for IEEE 802.11ac WLANs[C]// International Symposium on Communications and Information Technologies. Hangzhou, China, IEEE, 2011: 585-588.
ZU K, LAMARE R C D, HAARDT M. Generalized design of low-complexity block diagonalization type precoding algorithms for multiuser MIMO systems[J]. IEEE Transactions on Communications, 2013, 61(10):4232-4242. DOI: 4232
SPENCER Q H, SWINDLEHURST A L, HAARDT M. Zero-forcing methods for downlink spatial multiplexing in multiuser MIMO channels[J]. IEEE Transactions on Signal Processing, 2004, 52(2):461-471. DOI: 461
ZU K, LAMARE R C D. Low-complexity lattice reduction-aided regularized block diagonalization for MU-MIMO systems[J]. IEEE Communications Letters, 2012, 16(6):925-928. DOI: 925
GOLUB G H, VAN LOAN C F. Matrix computations[J]. Mathematical Gazette, 1996, 47(5 Series Ⅱ):392-396. DOI: 392
SUNG H, LEE S R, LEE I. Generalized channel inversion methods for multiuser MIMO systems[J]. IEEE Transactions on Communications, 2009, 57(11):3489-3499. DOI: 3489
New York RAJAN D. Introduction to wireless communications[M]. New York, John Wiley and Sons, 2003, 16(5):453-457. DOI: 453
0
浏览量
12
下载量
0
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010602201714号