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 complexity of decoding from nearly 80% to more than 95%, comparing with the original decoding algorithm, and without any performance loss.