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 条
  • [31] ALGEBRAIC CONSTRUCTION OF CYCLIC CODES OVER Z(8) WITH A GOOD EUCLIDEAN MINIMUM DISTANCE
    PIRET, PM
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1995, 41 (03) : 815 - 818
  • [32] Minimal Trellis Construction for Finite Support Convolutional Ring Codes
    Kuijper, Margreta
    Pinto, Raquel
    CODING THEORY AND APPLICATIONS, PROCEEDINGS, 2008, 5228 : 95 - 106
  • [33] Searching good space-time trellis codes of high complexity
    Kang, GX
    Elena, C
    Qi, BH
    Jin, XG
    Zhang, P
    WCNC 2002: IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE RECORD, VOLS 1 & 2, 2002, : 109 - 113
  • [34] A Lower Bound on the Field Size of Convolutional Codes With a Maximum Distance Profile and an Improved Construction
    Chen, Zitan
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2024, 70 (06) : 4064 - 4073
  • [35] HAMMING DISTANCE PRESERVING MAPPINGS AND TRELLIS CODES WITH CONSTRAINED BINARY SYMBOLS
    FERREIRA, HC
    WRIGHT, DA
    NEL, AL
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1989, 35 (05) : 1098 - 1103
  • [36] FURTHER ASYMPTOTIC UPPER-BOUNDS ON THE MINIMUM DISTANCE OF TRELLIS CODES
    POTTIE, GJ
    CALDERBANK, AR
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (04) : 1428 - 1431
  • [37] Upper bounds on the free distance for trellis codes combined with CPFSK signals
    Ertas, T
    Ali, FH
    ELECTRONICS LETTERS, 1997, 33 (17) : 1438 - 1440
  • [38] Upper bounds on the free distance for trellis codes combined with CPFSK signals
    Dokuz Eylül niversitesi, Mühendislik Fakültesi, Elektrik-Elektron. Muh. Bol., 35100 Bornova-Izmir, Turkey
    不详
    Electron Lett, 17 (1438-1440):
  • [39] Convolutional codes with maximum distance profile
    Hutchinson, R
    Rosenthal, J
    Smarandache, R
    SYSTEMS & CONTROL LETTERS, 2005, 54 (01) : 53 - 63
  • [40] On Construction of Good Quaternary Additive Codes
    Guo, Luo-Bin
    Liu, Yang
    Lu, Liang-Dong
    Li, Rui-Hu
    4TH ANNUAL INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY AND APPLICATIONS (ITA 2017), 2017, 12
12345