Iterative viterbi algorithm for concatenated multidimensional TCM

被引：9

作者：

Wang, Q

Wei, L

机构：

[1] Univ S Australia, Inst Telecommun Res, Adelaide, SA 5001, Australia

[2] Univ Wollongong, Sch Elect Comp & Telecommun, Wollongong, NSW 2500, Australia

来源：

IEEE TRANSACTIONS ON COMMUNICATIONS | 2002年 / 50卷 / 01期

关键词：

iterative Viterbi algorithm; multidimensional TCM; parity-concatenated trellis code;

D O I：

10.1109/26.975736

中图分类号：

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

学科分类号：

0808 ; 0809 ;

摘要：

A novel compound code is designed for the popular multidimensional (M-D) Wei trellis code [1] combined with a simple parity-check code. Using the iterative Viterbi decoding algorithm, we can achieve a remarkable performance improvement with low computational complexity. Simulation results show that at a bit error rate (BER) of 3.7 x 10(-6) about 2.2-dB additional net gain has been obtained over the conventional scheme of the 4-D 16-state NVei code at a spectral efficiency of 6.7871 bit/T.

引用

页码：12 / 15

页数：4

共 14 条

[1]

Benedetto S., 1997, Proceeding. 1997 IEEE International Symposium on Information Theory (Cat. No.97CH36074), DOI 10.1109/ISIT.1997.612923

[2]

GOFF SL, 1994, ICC 94, P645

[3] Bandwidth-efficient turbo trellis-coded modulation using punctured component codes [J].