DocumentCode
447140
Title
A fast decoding algorithm for space-time block codes
Author
Li, Ke ; Bin Tang ; Yang, Jian-yu ; Du, Zheng-Cong
Author_Institution
Sch. of Electron. Eng., Univ. of Electron. Sci. & Technol. of China, Chengdu, China
Volume
1
fYear
2005
fDate
12-14 Oct. 2005
Firstpage
354
Lastpage
357
Abstract
This paper presents a low complexity algorithm for the decoding of space-time block codes. The new decoding algorithm arrives at the same decision with much less complexity, using constellation space partitioning. Simulation shows that the proposed decoding algorithm cuts down the computation complexity of decoding from nearly 80% to more than 95%, comparing with the original decoding algorithm, and without any performance loss.
Keywords
block codes; computational complexity; decoding; space-time codes; computation complexity; constellation space partitioning; fast decoding algorithm; space-time block codes; Antennas and propagation; Block codes; Computational modeling; Fading; Maximum likelihood decoding; Partitioning algorithms; Performance loss; Space technology; Transmitting antennas; Wireless communication;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications and Information Technology, 2005. ISCIT 2005. IEEE International Symposium on
Print_ISBN
0-7803-9538-7
Type
conf
DOI
10.1109/ISCIT.2005.1566867
Filename
1566867
Link To Document