Iterative decoding of low-complexity space-time codes

被引：0

作者：

Sezgin, A ^{[1
]}

Boche, H ^{[1
]}

机构：

[1] Fraunhofer Inst Telecommun, Heinrich Hertz Inst, Broadband Mobile Commun Networks, D-10587 Berlin, Germany

来源：

PIMRC 2003: 14TH IEEE 2003 INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS PROCEEDINGS, VOLS 1-3 2003 | 2003年

关键词：

D O I：

暂无

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

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].

引用

页码：1683 / 1687

页数：5