Loading [a11y]/accessibility-menu.js
A tree-search algorithm for ML decoding in underdetermined MIMO systems | IEEE Conference Publication | IEEE Xplore
Scheduled Maintenance: On Monday, 27 January, the IEEE Xplore Author Profile management portal will undergo scheduled maintenance from 9:00-11:00 AM ET (1400-1600 UTC). During this time, access to the portal will be unavailable. We apologize for any inconvenience.

A tree-search algorithm for ML decoding in underdetermined MIMO systems


Abstract:

It is well known that Maximum Likelihood (ML) detection for multiantenna and/or multiuser systems has complexity that grows exponentially with the number of antennas and/...Show More

Abstract:

It is well known that Maximum Likelihood (ML) detection for multiantenna and/or multiuser systems has complexity that grows exponentially with the number of antennas and/or users. A number of suboptimal algorithms has been developed in the past that present an acceptable computational complexity and good approximations of the optimal solution. 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 search of minimum distance. Also a two-stage tree-search algorithm is presented based on the idea that the ML solution is in the set of equilibrium points of a Hopfield Neural Networks (HNN). The two algorithms work without any modification both in underloaded and overloaded (underdetermined) systems. Numerical simulations show that improvements, in terms of computational complexity measured as the average number of required sum and/or products, are encouraging.
Date of Conference: 07-10 September 2009
Date Added to IEEE Xplore: 13 October 2009
CD:978-1-4244-3584-5

ISSN Information:

Conference Location: Siena, Italy

References

References is not available for this document.