Paper Info
Title
Low-Complexity Lattice Reduction-Aided Regularized Block Diagonalization for MU-MIMO Systems
Abstract
By employing the regularized block diagonalization (RBD) preprocessing technique, the MU-MIMO broadcast channel is decomposed into multiple parallel independent SU-MIMO channels and achieves the maximum diversity order at high data rates. The computational complexity of RBD, however, is relatively high due to two singular value decomposition (SVD) operations. In this letter, a low-complexity lattice reduction-aided RBD is proposed. The first SVD is replaced by a QR decomposition, and the orthogonalization procedure provided by the second SVD is substituted by a lattice-reduction whose complexity is mainly contributed by a QR decomposition. Simulation results show that the proposed algorithm can achieve almost the same sum-rate as RBD, substantial bit error rate (BER) performance gains and a simplified receiver structure, while requiring a lower complexity.
Year
DOI
Venue
2012
10.1109/LCOMM.2012.041112.112185
IEEE Communications Letters
Keywords
Field
DocType
Nickel,Matrix decomposition,Bit error rate,MIMO,Computational complexity,Lattices
Singular value decomposition,Mathematical optimization,Matrix decomposition,MIMO,Algorithm,Real-time computing,Orthogonalization,QR decomposition,Lattice reduction,Mathematics,Computational complexity theory,Bit error rate
Journal
Volume
Issue
ISSN
16
6
1089-7798
Citations 
PageRank 
References 
35
0.98
11
Authors
2
Name
Order
Citations
PageRank
Keke Zu11007.38
Rodrigo C. de Lamare21461179.59