By Topic

Implementation of an SDFG based parallel depth-first complex sphere decoding algorithm

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

3 Author(s)
Wenyao Xue ; Institute for Theoretical Electrical Engineering and Microelectronics (ITEM), University of Bremen, Otto-Hahn-Allee, NW1, 28359, Bremen, Germany ; Till Wiegand ; Steffen Paul

Iterative tree search algorithms like K-Best or sphere decoder algorithms are promising candidates for the upcoming wireless communications systems. In this paper a square root and division free Givens rotation (SDFG) algorithm is merged into a common sphere decoder algorithm to decrease the entire complexity. Furthermore, the algorithm is speeded up due to parallelizing the computation by taking the orthogonality of the real and imaginary parts of the complex transmit symbols into account.

Published in:

Smart Antennas (WSA), 2010 International ITG Workshop on

Date of Conference:

23-24 Feb. 2010