On (n, n-1) Punctured Convolutional Codes and Their Trellis Modules

被引：3

作者：

Katsiotis, Alexandros ^{[1
]}

Kalouptsidis, Nicholas ^{[1
]}

机构：

[1] Natl & Kapodistrian Univ Athens, Dept Informat & Telecommun, Div Commun & Signal Proc, Athens 15784, Greece

来源：

IEEE TRANSACTIONS ON COMMUNICATIONS | 2011年 / 59卷 / 05期

关键词：

Punctured convolutional codes; trellis complexity; minimal trellis; maximum likelihood decoding;

D O I：

10.1109/TCOMM.2011.020811.100088

中图分类号：

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

学科分类号：

0808 ; 0809 ;

摘要：

It is known that an (n, n - 1) non catastrophic antipodal punctured convolutional encoder of memory.. is minimal. That is, the corresponding code cannot be produced by an encoder of smaller memory size. In this letter it is shown that the trellis module of a code produced by an (n, n - 1) non catastrophic punctured convolutional encoder is optimum, if and only if the encoder is antipodal.

引用

页码：1213 / 1217

页数：5

共 50 条

[21] Constructions of rate (n - 1)/n punctured convolutional codes with minimum required SNR criterion.
Lee, Pil J.
[J]. IEEE Transactions on Communications, 1988, 36 (10): : 1171 - 1174
[22] Method to recover Internet packet losses using (n, n-1, m) convolutional codes
Arai, M
Yamaguchi, A
Iwasaki, K
[J]. DSN 2000: INTERNATIONAL CONFERENCE ON DEPENDABLE SYSTEMS AND NETWORKS, PROCEEDINGS, 2000, : 382 - 389
[23] A TFSK Transceiver Combining (n, n(n-1), n-1) Permutation Group Codes with MFSK
Peng, Li
Li, Gaofeng
Liang, Kun
Zhou, Bo
[J]. 2017 IEEE 9TH INTERNATIONAL CONFERENCE ON COMMUNICATION SOFTWARE AND NETWORKS (ICCSN), 2017, : 61 - 65
[24] Dual Trellis Construction for High-Rate Punctured Convolutional Codes
Vinh Hoang Son Le
Nour, Charbel Abdel
Boutillon, Emmanuel
Douillard, Catherine
[J]. 2019 IEEE 30TH INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS (IEEE PIMRC WORKSHOPS), 2019,
[25] A Computational Complexity Measure for Trellis Modules of Convolutional Codes
Benchimol, Isaac B.
Pimentel, Cecilio
Souza, Richard Demo
Uchoa-Filho, Bartolomeu F.
[J]. 2013 36TH INTERNATIONAL CONFERENCE ON TELECOMMUNICATIONS AND SIGNAL PROCESSING (TSP), 2013, : 144 - 148
[26] A LOW COMPLEXITY STACK DECODER FOR A CLASS OF BINARY RATE (N-1)/N CONVOLUTIONAL-CODES
VINCK, AJ
[J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 1984, 32 (04) : 476 - 479
[27] Tight bounds on the minimum average weight per branch for rate (N-1)/N convolutional codes
Hole, MF
Hole, KJ
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1997, 43 (04) : 1301 - 1305
[28] dc-free codes of rate (n-1)/n, n odd
Immink, KAS
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (02) : 633 - 634
[29] Construction of Rate (n-1)/n Non-Binary LDPC Convolutional Codes via Difference Triangle Sets
Alfarano, Gianira Nicoletta
Lieb, Julia
Rosenthal, Joachim
[J]. 2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2020, : 138 - 143
[30] On the structure of an SST Viterbi decoder for general rate (n-1)/n convolutional codes viewed in the light of syndrome decoding
Tajima, M
[J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1996, E79A (09) : 1447 - 1449

← 1 2 3 4 5 →