Low-Complexity Lattice Reduction-Aided Regularized Block Diagonalization for MU-MIMO Systems

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 h...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters 2012-06, Vol.16 (6), p.925-928
Main Authors: Zu, K., de Lamare, R. C.
Format: Article
Language:English
Subjects:
Applied sciences
Bit error rate
Blocking
Channels
Complexity
Computational complexity
Decomposition
Exact sciences and technology
Gain
Lattices
low-complexity
Matrix decomposition
MIMO
MU-MIMO
Nickel
Preprocessing
Receivers
regularized block diagonalization (RBD)
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Transmission and modulation (techniques and equipments)
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2012.041112.112185