Low-Complexity Design of Generalized Block Diagonalization Precoding Algorithms for Multiuser MIMO Systems

Abstract

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.

7 figures, 10 pages. IEEE Transactions on Communications, 2013. arXiv admin note: text overlap with arXiv:1304.6470

Cited by in corpus (30)

• Design of Robust Adaptive Beamforming Algorithms Based on Low-Rank and Cross-Correlation Techniques
• Multi-Branch Tomlinson-Harashima Precoding for MU-MIMO Systems: Theory and Algorithms
• Planning 5G Networks for Rural Fixed Wireless Access
• Massive MIMO and Waveform Design for 5th Generation Wireless Communication Systems
• On hybrid precoder/combiner for downlink mmWave massive MU-MIMO systems
• Decoupled Signal Detection for the Uplink of Large-Scale MIMO Systems in Heterogeneous Networks
• Block Diagonalization Type Precoding Algorithms for IEEE 802.11ac Systems
• Study of Coarse Quantization-Aware Block Diagonalization Algorithms for MIMO Systems with Low Resolution
• Study of Cloud-Aided Multi-Way Multiple-Antenna Relaying with Best-User Link Selection and Joint ML Detection
• Study of Switched Max-Link Relay Selection for Cooperative Multiple-Antenna Systems
• Sparsity-Aware SSAF Algorithm with Individual Weighting Factors for Acoustic Echo Cancellation
• Robust Multi-Branch Tomlinson-Harashima Precoding in Cooperative MIMO Relay Systems
• Cluster-Head-Driven UAV Relaying with Recursive Maximum Minimum Distance using CRANs
• Study of Diffusion Normalized Least Mean M-estimate Algorithms
• Tomlinson-Harashima Precoding with Stream Combiners for MU-MIMO with Rate-Splitting
• Joint AGC and Receiver Design for Large-Scale MU-MIMO Systems Using Low-Resolution Signal Processing in C-RANs
• Study of Opportunistic Relaying and Jamming Based on Secrecy-Rate Maximization for Buffer-Aided Relay Systems
• Study of Block Diagonalization Precoding and Power Allocation for Multiple-Antenna Systems with Coarsely Quantized Signals
• Study of Multi-Branch Tomlinson-Harashima Precoding with Multiple-Antenna Systems and Rate Splitting
• Compressed Randomized UTV Decompositions for Low-Rank Approximations and Big Data Applications
• Tomlinson-Harashima Precoded Rate-Splitting for Multiuser MIMO Systems
• A Novel Compressive Sensing based Enhanced Multiplexing Scheme for MIMO System
• Iterative List Detection and Decoding for mMTC
• Coordinate Tomlinson-Harashima Precoding Design for Overloaded Multi-user MIMO Systems
• Multi-User Flexible Coordinated Beamforming using Lattice Reduction for Massive MIMO Systems
• Multi-Branch Lattice-Reduction SIC for Multiuser MIMO Systems
• Widely-Linear Precoding for Large-Scale MIMO with IQI: Algorithms and Performance Analysis
• Distributed Space-Time Coding Techniques with Dynamic Buffers for Cooperative DS-CDMA Systems
• Study of Rate-Splitting Techniques with Block Diagonalization for Multiuser MIMO Systems
• Study of Compressed Randomized UTV Decompositions for Low-Rank Matrix Approximations in Data Science