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

Yanni Chen, Keshab K. Parhi

Research output: Contribution to journalConference articlepeer-review

2 Scopus citations


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 languageEnglish (US)
Pages (from-to)III/2693-III/2696
JournalICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
StatePublished - 2002
Event2002 IEEE International Conference on Acoustic, Speech, and Signal Processing - Orlando, FL, United States
Duration: May 13 2002May 17 2002


Dive into the research topics of 'A very low complexity soft decoding of space-time block codes'. Together they form a unique fingerprint.

Cite this