ABSTRACT:

Two low-complexity effective detection schemes for multiple-input–multiple-output (MIMO) systems based on post-equalization subspace search are proposed in this paper. With the initial solution given by the linear detector, calibrated constellation search is conducted in symbol subspace and eigenspace associated with the largest estimation errors in linear detection to identify improved solutions. Complexity analysis is performed to understand the cost of the proposed add-on procedures. Simulation results demonstrate that the proposed schemes yield noticeable performance gains over linear detectors at moderate additional computational cost.


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