By Topic

Tree-search ML detection for underdetermined MIMO systems with M-PSK constellations

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)
Gianmarco Romano ; Dipartimento di Ingegneria dell'Informazione, Seconda Università di Napoli via Roma 29, 81031 Aversa, Italy ; Domenico Ciuonzo ; Pierluigi Salvo Rossi ; Francesco Palmieri

In this paper we propose a tree-search algorithm that provides the exact ML solution with lower computational complexity than that required by an exhaustive minimum distance search. The new algorithm, that we call King Decoder, is based on conditional dominance conditions, a set of sufficient conditions for making optimal decisions regardless of multi-antenna interference. The King Decoder does not require any matrix inversion and/or factorization and can be employed in both underdertermined and overdetermined systems. Complexity performances of the proposed algorithm, obtained through numerical simulations, are compared with those of the generalized sphere decoder, showing a lower search complexity for a wide range of SNR's.

Published in:

Wireless Communication Systems (ISWCS), 2010 7th International Symposium on

Date of Conference:

19-22 Sept. 2010