A fast decoding algorithm for space-time block codes

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 comple...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:ISCIT 2005 : International Symposium on Communications and Information Technologies 2005 : proceedings : October 12-14, 2005, Beijing, China Ročník 1; s. 354 - 357
Hlavní autoři: Ke Li, Bin Tang, Jina-yu Yang, Zheng-cong Du
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 2005
Témata:
Antennas and propagation
Block codes
Computational modeling
Fading
Maximum likelihood decoding
Partitioning algorithms
Performance loss
Space technology
Transmitting antennas
Wireless communication
ISBN:9780780395381, 0780395387
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISBN:9780780395381
0780395387
DOI:10.1109/ISCIT.2005.1566867