CONSTRUCTION OF TRELLIS CODES WITH A GOOD DISTANCE PROFILE

被引：3
|
作者：
MALLADI, SS
WANG, FQ
COSTELLO, DJ
FERREIRA, HC
机构：
[1] UNIV NOTRE DAME, DEPT ELECT ENGN, NOTRE DAME, IN 46556 USA
[2] RAND AFRIKAANS UNIV, CYBERNET LAB, JOHANNESBURG 2000, SOUTH AFRICA
来源：
IEEE TRANSACTIONS ON COMMUNICATIONS | 1994年 / 42卷 / 2-4期
基金：
美国国家科学基金会; 美国国家航空航天局;
关键词：
D O I：
10.1109/TCOMM.1994.577033
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
Systematic feedforward trellis codes for s-PSK and 16-QAM modulation are constructed using a nested step by step algorithm which guarantees a good distance profile. This makes the codes suitable for use with sequential decoding, where a rapidly growing distance profile is needed to reduce the average number of computations. In addition to having a good distance profile, the new codes achieve asymptotic coding gains up to 6.53 dB. A procedure based upon the Fano algorithm (FA) is used to calculate the free distance of the new codes. This procedure is very effective for finding the free distances of long trellis codes because of the computational and storage efficiency of the FA. From a comparison of the new systematic feedforward codes with Ungerboeck's systematic feedback codes, we conjecture that a systematic feedforward code of constraint length 2nu can achieve the same free distance as a systematic feedback code of constraint length nu.
引用
收藏
页码：290 / 298
页数：9
相关论文
共 50 条
  • [1] Construction of Trellis codes with a good distance profile
    Malladi, Sanker S.
    Wang, Fu-Quan
    Costello Jr., Daniel J.
    Ferreira, Hendrik C.
    IEEE Transactions on Communications, 1994, 42 (2 -4 pt 1) : 290 - 298
  • [2] Good space-time trellis codes in terms of distance spectrum
    Kang, GX
    Zhang, P
    Haas, H
    Schulz, E
    IEEE 56TH VEHICULAR TECHNOLOGY CONFERENCE, VTC FALL 2002, VOLS 1-4, PROCEEDINGS, 2002, : 252 - 255
  • [3] THE SYNTHESIS OF MAGNETIC RECORDING TRELLIS CODES WITH GOOD HAMMING DISTANCE PROPERTIES
    FERREIRA, HC
    IEEE TRANSACTIONS ON MAGNETICS, 1985, 21 (05) : 1356 - 1358
  • [4] Robustly good trellis codes
    Wang, FQ
    Costello, DJ
    IEEE TRANSACTIONS ON COMMUNICATIONS, 1996, 44 (07) : 791 - 798
  • [5] ALGORITHMIC CONSTRUCTION OF TRELLIS CODES
    PORATH, JE
    AULIN, T
    IEEE TRANSACTIONS ON COMMUNICATIONS, 1993, 41 (05) : 649 - 654
  • [6] BOUNDS ON THE MINIMUM DISTANCE OF TRELLIS CODES
    BURNASHEV, M
    BIGLIERI, EM
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1989, 35 (03) : 659 - 662
  • [7] Average distance structures of trellis codes
    Chao, CC
    Chiu, MC
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1996, E79A (04): : 585 - 591
  • [8] On the existence and construction of maximum distance profile convolutional codes
    Castaneda, Angel Luis Munoz
    Plaza-Martin, Francisco J.
    FINITE FIELDS AND THEIR APPLICATIONS, 2021, 75
  • [9] Good trellis source codes at fractional rates
    Eriksson, T
    Anderson, JB
    Novak, M
    2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2004, : 496 - 496
  • [10] Distance spectra of codes constructed from trellis
    Trofimov, A.N.
    Problemy Peredachi Informatsii, 1993, (02): : 28 - 40
12345