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 knowledge rates. The computational complexity of RBD, but, is relatively high thanks to two singular value decomposition (SVD) operations. In this letter, an occasional-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 principally contributed by a QR decomposition. Simulation results show that the proposed algorithm can achieve nearly the identical add-rate as RBD, substantial bit error rate (BER) performance gains and a simplified receiver structure, while requiring a lower complexity.

Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here

PROJECT TITLE :Improved Low-Complexity Sphere Decoding for Generalized Spatial Modulation - 2018ABSTRACT:During this letter, two types of improved sphere decoding (SD) algorithms for generalized spatial modulation (GSM), termed
PROJECT TITLE :Algorithm and Architecture of a Low-Complexity and High-Parallelism Preprocessing-Based K -Best Detector for Large-Scale MIMO Systems - 2018ABSTRACT:As a branch of sphere decoding, the K-best method has played an
PROJECT TITLE :Compressive Channel Estimation and Multi-User Detection in C-RAN With Low-Complexity Methods - 2018ABSTRACT:This Project considers the channel estimation (CE) and multi-user detection (MUD) problems in cloud radio
PROJECT TITLE :A Learning Approach for Low-Complexity Optimization of Energy Efficiency in Multicarrier Wireless Networks - 2018ABSTRACT:This Project proposes computationally efficient algorithms to maximise the energy efficiency
PROJECT TITLE :Low-Complexity VLSI Design of Large Integer Multipliers for Fully Homomorphic Encryption - 2018ABSTRACT:Giant integer multiplication has been widely employed in fully homomorphic encryption (FHE). Implementing possible

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry