By Topic

On fast ML decoding for high-rate STBCs by dimensionality reduction

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)
Kahraman, S. ; BILGEM, UEKAE, TUBITAK, Gebze, Turkey ; Celebi, M.E.

In this work, a new fast decoding technique that is based on dimensionality reduction for the search tree is presented for the high-rate space-time block coding. By the use of the proposed technique, the high-rate Golden codes and various WiMAX codes can be efficiently decoded with the optimal ML detection. In the sphere decoding algorithm, 8 dimensional search tree for 2 × 2 Golden code can be separated into 2 semi dependent, 6 dimensional sub trees. For the recommended X4 code in the WiMAX systems, 4 semi dependent, 5 dimensional sub trees can be obtained. By the proposed method, the computational complexity of the sphere decoding can be reduced by about %80 and the speed of the decoding can be increased about 5 times.

Published in:

Signal Processing and Communications Applications (SIU), 2011 IEEE 19th Conference on

Date of Conference:

20-22 April 2011