Iterative decoding of low-complexity space-time codes

Aydin Sezgin, Holger Boche

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this work, we study the iterative decoding of a low-complexity space-time architecture proposed by [1, 2] employing per-survivor-processing at the receiver with the soft-output viterbi-algorithm (SOVA, [3]). At the transmitter, the space-time architecture is serially concatenated with an outer code. With the availability of extrinsic information at the receiver delivered by the SOVA, it is now possible to use a novel receiver scheme performing iterative (turbo) decoding in order to improve the performance of the architecture. According to the ZF or to the MMSE criterion, linear feedforward and -backward filters of the decision-feedback space-time (ST) decoder are derived. Furthermore, the decision metric of the SOVA employing per-survivor-processing is developed and the performance of the scheme is analyzed and compared with the scheme in [2].

Original languageEnglish
Title of host publicationPIMRC2003 - 14th IEEE 2003 International Symposium on Personal, Indoor and Mobile Radio Communications, Proceedings
Pages1683-1687
Number of pages5
DOIs
StatePublished - 2003
Externally publishedYes
Event14th IEEE 2003 International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC2003 - Beijing, China
Duration: 7 Sep 200310 Sep 2003

Publication series

NameIEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC
Volume2

Conference

Conference14th IEEE 2003 International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC2003
Country/TerritoryChina
CityBeijing
Period7/09/0310/09/03

Fingerprint

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

Cite this