A new lattice decoding for space time block codes with low complexity

Author

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

Author_Institution

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

Volume

1

fYear

2002

fDate

15-18 Sept. 2002

Firstpage

428

Abstract

We present an algorithm based on the closest point search (CPS) in lattices for decoding of space-time block codes (STBC). The modified CPS algorithm based on the 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. We show that our proposed method gives the same decoding performance as the maximum-likelihood (ML) ratio decoding while it shows much lower complexity.

Keywords

block codes; computational complexity; decoding; space-time codes; QPSK; closest point search algorithm; lattice decoding; low complexity codes; maximum-likelihood ratio decoding; multi-antenna system; orthogonal STBC; space time block codes; sphere decoding methods; Block codes; Decoding; Design optimization; Fading; Lattices; Matrices; Matrix decomposition; Receiving antennas; Transmitting antennas; Wireless communication;

fLanguage

English

Publisher

ieee

Conference_Titel

Personal, Indoor and Mobile Radio Communications, 2002. The 13th IEEE International Symposium on

Print_ISBN

0-7803-7589-0

Type

conf

DOI

10.1109/PIMRC.2002.1046736

Filename

1046736