By Topic

A fast decoding for space time block codes

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

4 Author(s)
L. Beygi ; Dept. of Electr. & Comput. Eng., Tehran Univ., Iran ; A. R. Ghaderipoor ; K. Dolatyar ; S. H. Jamali

We present an algorithm based on closest point search (CPS) in lattices for decoding of space-time block codes (STBC). The modified CPS algorithm based on Schnorr-Euchner variation of the Pohst (1981) method is used to perform the decoding of STBC. This method is shown to be substantially faster than other known sphere decoding methods. Also we exploit a fast method for decoding of orthogonal STBC with low complexity, that its complexity is polynomial in the number of antennas and the rate. We show that our method gives the same decoding performance as the maximum-likelihood (ML) ratio decoding while it shows much lower complexity.

Published in:

Sensor Array and Multichannel Signal Processing Workshop Proceedings, 2002

Date of Conference:

4-6 Aug. 2002