A fast decoding for space time block codes

Author

Beygi, Lotfollah ; Ghaderipoor, A.R. ; Dolatyar, K. ; Jamali, S.H.

Author_Institution

Dept. of Electr. & Comput. Eng., Tehran Univ., Iran

fYear

2002

fDate

4-6 Aug. 2002

Firstpage

427

Lastpage

431

Abstract

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.

Keywords

antenna arrays; block codes; computational complexity; decoding; radio links; search problems; space-time codes; 16-QAM; QPSK; STBC; closest point search algorithm; fast decoding; lattice decoding; low complexity method; maximum-likelihood ratio decoding; modified CPS algorithm; multi-antenna system; multiple-antenna wireless communication links; orthogonal STBC; polynomial complexity; space time block codes; sphere decoding methods; Block codes; Design optimization; Fading; Lattices; Maximum likelihood decoding; Maximum likelihood detection; Maximum likelihood estimation; Polynomials; Receiving antennas; Transmitting antennas;

fLanguage

English

Publisher

ieee

Conference_Titel

Sensor Array and Multichannel Signal Processing Workshop Proceedings, 2002

Print_ISBN

0-7803-7551-3

Type

conf

DOI

10.1109/SAM.2002.1191075

Filename

1191075