By Topic

An Efficient Tree Search for Reduced Complexity Sphere Decoding

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

2 Author(s)
Azzam, L. ; Dept. of Electr. Eng. & Comput. Sci., Univ. of California, Irvine, CA ; Ayanoglu, E.

The complexity of sphere decoding (SD) has been widely studied due to the importance of this algorithm in obtaining the optimal maximum likelihood (ML) performance with lower complexity. In this paper, we propose a proper tree search traversal technique that reduces the overall SD computational complexity without sacrificing the performance. We exploit the similarity among the complex symbols in a square QAM lattice representation and rewrite the squared norm ML metric in a simpler form allowing significant reduction of the number of operations required to decode the transmitted symbols. We also show that this approach achieves > 45% complexity gain for systems employing 4-QAM, and that this gain becomes bigger as the constellation size is larger.

Published in:

Global Telecommunications Conference, 2008. IEEE GLOBECOM 2008. IEEE

Date of Conference:

Nov. 30 2008-Dec. 4 2008