By Topic

A Fixed-Complexity Smart Candidate Adding Algorithm for Soft-Output MIMO Detection

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
$33 $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)
David L. Milliner ; School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA, USA ; Ernesto Zimmermann ; John R. Barry ; Gerhard Fettweis

We present a soft-output multiple-input multiple-output (MIMO) detection algorithm that achieves near max-log optimal error rate performance with low- and fixed-computational complexity. The proposed smart ordering and candidate adding (SOCA) algorithm combines a smart-ordered QR decomposition with smart candidate adding and a parallel layer-by-layer search of the detection tree. In contrast to prior algorithms that use smart candidate adding, the proposed algorithm has fixed computational complexity, and it never visits a node more than once. Results indicate that the SOCA algorithm has an attractive performance-complexity profile for both fast and slow fading 4 ¿¿ 4 and 8 ¿¿ 8 MIMO channels with quadrature amplitude modulation (QAM) inputs.

Published in:

IEEE Journal of Selected Topics in Signal Processing  (Volume:3 ,  Issue: 6 )