By Topic

Reducing sphere decoder complexity by elliptical tree pruning

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

1 Author(s)
Artes, Harold ; Inf. Syst. Lab., Stanford Univ., CA, USA

We propose a computationally efficient detection algorithm with near ML performance for space-time communications systems. Our algorithm is based on pruning (excluding) branches from the search tree arising in the sphere decoding (SD) algorithm. The choice of the branches to be pruned relies on intuitive geometrical reasoning which is in turn based on a simplified channel model designed to capture the effect of badly conditioned channel realizations. The remaining search tree after pruning can be processed by the conventional SD algorithm with strongly reduced complexity as against scanning the complete tree. Simulation results show that despite the pruning near ML results can be obtained.

Published in:

Signal Processing Advances in Wireless Communications, 2004 IEEE 5th Workshop on

Date of Conference:

11-14 July 2004