An algorithm for identifying rate (n-1)/n catastrophic punctured convolutional encoders

It is known that both Viterbi and sequential decoding of convolutional codes can be greatly simplified by employing punctured convolutional codes, which are obtained by periodically deleting a part of the bits of a low-rate convolutional code. Even if the original low-rate convolutional code is nonc...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 1996-05, Vol.42 (3), p.1010-1013
Main Authors: Feng-Wen Sun, Vinck, A.J.
Format: Article
Language:English
Subjects:
Algorithms
Computer errors
Computer science
Convolutional codes
Decoding
Equations
Information theory
Mathematics
Polynomials
Sun
Viterbi algorithm
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:It is known that both Viterbi and sequential decoding of convolutional codes can be greatly simplified by employing punctured convolutional codes, which are obtained by periodically deleting a part of the bits of a low-rate convolutional code. Even if the original low-rate convolutional code is noncatastrophic, some deleting maps may result in rate (n-1)/n catastrophic punctured encoders. An algorithm is presented to identify such encoders when the original rate 1/b encoder is antipodal. The major part of the algorithm solves a linear equation of /spl nu/+1 variables, where /spl nu/ is the constraint length of the original rate 1/b code.
ISSN:0018-9448
1557-9654
DOI:10.1109/18.490567