A very low complexity soft decoding of space-time block codes

This paper presents a computationally efficient algorithm for the soft decoding of space-time block codes. Compared to the original maximum likelihood algorithm, the proposed algorithm saves up to 80% hardware operations. The simulation results using space-time block turbo coded modulation scheme show that the proposed algorithm achieves the same decoding performance as the maximum likelihood decoding with much lower complexity.