A new decoding algorithm for geometrically uniform trellis codes

被引：1

作者：

Benedetto, S

Montorsi, G

机构：

[1] Dipartimento di Elettronica, Politecnico di Torino, Torino

来源：

IEEE TRANSACTIONS ON COMMUNICATIONS | 1996年 / 44卷 / 05期

关键词：

geometrically uniform codes; group codes; suboptimal decoding algorithms;

D O I：

10.1109/26.494302

中图分类号：

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

学科分类号：

0808 ; 0809 ;

摘要：

A new decoding algorithm for geometrically uniform trellis codes is presented, The group structure of the codes is exploited in order to improve the decoding process, Analytical bounds to the algorithm performance and to its computational complexity are derived. The algorithm complexity does not depend on the number of states of the trellis describing the code. Extensive simulations yield results on the algorithm performance and complexity, and permit a comparison with the Viterbi algorithm and the sequential Fano algorithm.

引用

页码：581 / 590

页数：10

共 5 条

[1] GEOMETRICALLY UNIFORM TCM CODES OVER GROUPS BASED ON LXMPSK CONSTELLATIONS [J].