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

Full description

Saved in:
Bibliographic Details
Published in:ISCIT 2005 : International Symposium on Communications and Information Technologies 2005 : proceedings : October 12-14, 2005, Beijing, China Vol. 1; pp. 354 - 357
Main Authors: Ke Li, Bin Tang, Jina-yu Yang, Zheng-cong Du
Format: Conference Proceeding
Language:English
Published: IEEE 2005
Subjects:
Antennas and propagation
Block codes
Computational modeling
Fading
Maximum likelihood decoding
Partitioning algorithms
Performance loss
Space technology
Transmitting antennas
Wireless communication
ISBN:9780780395381, 0780395387
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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