On (n, n-1) convolutional codes with low trellis complexity

被引：24

作者：

Tang, HH ^{[1
]}

Lin, MC ^{[1
]}

机构：

[1] Natl Taiwan Univ, Dept Elect Engn, Taipei 106, Taiwan

来源：

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

关键词：

convolutional codes; decoding; trellis codes;

D O I：

10.1109/26.975742

中图分类号：

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

学科分类号：

0808 ; 0809 ;

摘要：

We show that the state complexity profile of a convolutional code C is the same as that of the reciprocal of the dual code of C in case that minimal encoders for both codes are used. Then, we propose an optimum permutation for any given (n, n - 1) binary convolutional code that will yield an equivalent code with the lowest state complexity. With this permutation, we are able to find many (n, n - 1) binary convolutional codes which are better than punctured convolutional codes of the same code rate and memory size by either lower decoding complexity or better weight spectra.

引用

页码：37 / 47

页数：11

共 50 条

[41] Time-Frequency Division Multiple Access and the TFDMA Ad Hoc Network Based on the (n, n(n-1), n-1) Permutation Group Codes
Peng, Li
[J]. 2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2020, : 286 - 291
[42] Equivalences Induced by (n,1), (n,n-1) and (n,k) - Equivalences (1 < k < n-1)
Chalamani, Sonja B.
Seweryn-Kuzmanovska, Marzanna J.
Kotevska, Elena T.
[J]. 2023 58TH INTERNATIONAL SCIENTIFIC CONFERENCE ON INFORMATION, COMMUNICATION AND ENERGY SYSTEMS AND TECHNOLOGIES, ICEST, 2023, : 345 - 348
[43] On trellis modules for convolutional codes
Souza, RD
Uchôa, BF
[J]. ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2002, : 427 - 427
[44] NEW SHORT CONSTRAINT LENGTH RATE (N-1)/N PUNCTURED CONVOLUTIONAL-CODES FOR SOFT-DECISION VITERBI DECODING
HOLE, KJ
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1988, 34 (05) : 1079 - 1081
[45] On codes of bounded trellis complexity
Kashyap, Navin
[J]. 2007 IEEE INFORMATION THEORY WORKSHOP, VOLS 1 AND 2, 2007, : 168 - 173
[46] N VS N-1
KNAPP, TR
[J]. AMERICAN EDUCATIONAL RESEARCH JOURNAL, 1970, 7 (04) : 625 - 626
[47] On the behavior of the distance spectrum of convolutional codes under a minimal trellis complexity measure
Uchoa-Filho, Bartolomeu F.
Demo Souza, Richard
Pimentel, Cecilio
[J]. 2006 IEEE INFORMATION THEORY WORKSHOP, 2006, : 283 - +
[48] Impacts of the "zero" homologous series, 01(n-1)n and 02(n-1)n
Yamauchi, H
Karppinen, M
[J]. PHYSICA C, 2000, 335 (1-4): : 273 - 278
[49] FAST AND LOW-COST TSC CHECKERS FOR 1-OUT-OF-N AND (N-1)-OUT-OF-N CODES IN MOS-TRANSISTOR IMPLEMENTATION
HANIOTAKIS, T
PASCHALIS, A
NIKOLOS, D
[J]. INTERNATIONAL JOURNAL OF ELECTRONICS, 1991, 71 (05) : 781 - 791
[50] NEW DESIGN METHOD FOR LOW-COST TSC CHECKERS FOR 1-OUT-OF-N AND (N-1)-OUT-OF-N CODES IN MOS IMPLEMENTATION
LASKARIS, G
HANIOTAKIS, T
PASCHALIS, A
NIKOLOS, D
[J]. INTERNATIONAL JOURNAL OF ELECTRONICS, 1990, 69 (06) : 805 - 817

← 1 2 3 4 5 →