By Topic

Reduced tree-search, heuristic and linear decoupler low-complexity MIMO detectors

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Suzuki, I. ; Electr. Eng. Dept., State Univ. of Londrina DEEL-UEL, Londrina ; Ciriaco, F. ; Abrao, T. ; de Oliveira, L.D.

Since the optimal detector for coded and even uncoded multiple-input-multiple-output (MIMO) antenna systems results too complex when the number of antennas and/or the modulation order index increases, strictly low-complexity detection schemes are considered, aiming to achieve promising performance times complexity trade-off. Under the same throughput basis, this work analyzes some capacity-approaching heuristic and reduced tree-search MIMO detection algorithms, combining simple linear decouplers, local search detectors, particle swarm intelligence (PSO) concepts and parallel short low density parity check codes (LDPC), suitable to uncoded as well to MIMO channel coding. For uncoded MIMO systems, low-complexity PSO approach showed to reach efficiently MIMO near-capacity for any number of transmit and receive antennas configuration, while simple linear decoupler detectors for QPSK modulation with short LDPC coding achieve reasonable performance only for nR ges nT condition.

Published in:

Wireless Communication and Sensor Networks, 2008. WCSN 2008. Fourth International Conference on

Date of Conference:

27-29 Dec. 2008