DocumentCode
3182500
Title
Simplified lattice decoding for orthogonal space-time codes
Author
Beygi, L.H. ; Ghaderipoor, A.R. ; Dolatyar, K. ; Olfat, A. ; Jamali, Sh.
Author_Institution
Dept. of Electr. & Comput. Eng., Tehran Univ., Iran
Volume
2
fYear
2002
fDate
26-30 Aug. 2002
Firstpage
1661
Abstract
We present a lattice-decoding algorithm for a multiple antenna system. While the complexity of the maximum-likelihood (ML) algorithm is exponential both in the number of antennas and the rate, the complexity of our algorithm is polynomial in the number of antennas and the rate and has lower complexity than the method used in Tarokh et al. (1999). We also show that the performance of our lattice decoding is the same as the ML algorithm performance.
Keywords
computational complexity; decoding; mobile radio; space-time codes; antenna number; lattice decoding; multiple antenna system; orthogonal space-time codes; performance; polynomial complexity; rate; Additive noise; Block codes; Equations; Fading; Lattices; Matrix decomposition; Maximum likelihood decoding; Maximum likelihood detection; Receiving antennas; Space time codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Signal Processing, 2002 6th International Conference on
Print_ISBN
0-7803-7488-6
Type
conf
DOI
10.1109/ICOSP.2002.1180119
Filename
1180119
Link To Document