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.
|Original language||English (US)|
|Journal||ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings|
|State||Published - 2002|
|Event||2002 IEEE International Conference on Acoustic, Speech, and Signal Processing - Orlando, FL, United States|
Duration: May 13 2002 → May 17 2002