By Topic

Geometry based efficient decoding algorithms for underdetermined MIMO systems

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

3 Author(s)
Chung-Jung Huang ; Dept. of Electr. Eng., Nat. Chiao Tung Univ., Hsinchu, Taiwan ; Chih-Yung Wu ; Ta-Sung Lee

In this paper, a novel decoder for underdetermined MIMO systems with low decoding complexity is proposed. The development of the proposed decoder consists of two stages. First, an improved slab decoding algorithm efficiently obtains all valid candidate points within a given slab. Next, a multi-slab based decoding algorithm finds the optimal solution by conducting intersections on the obtained candidate set with dynamic radius adaptation. The proposed decoder offers the advantages of low computational complexity and near-ML decoding performance for underdetermined MIMO systems. Simulation results indicate that it effectively reduces the complexity as compared to existing decoders, especially for large antenna numbers and/or constellations.

Published in:

Signal Processing Advances in Wireless Communications (SPAWC), 2011 IEEE 12th International Workshop on

Date of Conference:

26-29 June 2011