High-rate punctured convolutional codes for Viterbi and sequential decoding

Author

Haccoun, David ; Bégin, Guy

Author_Institution

Dept. of Electr. Eng., Ecole Polytech. de Montreal, Que., Canada

Volume

37

Issue

11

fYear

1989

fDate

11/1/1989 12:00:00 AM

Firstpage

1113

Lastpage

1125

Abstract

An investigation is conducted of the high-rate punctured convolutional codes suitable for Viterbi and sequential decoding. Results on known short-memory codes M⩽8 discovered by others are extended. Weight spectra and upper bounds on the bit error probability of the best known punctured codes having memory 2⩽M ⩽8, and coding rates 2/3⩽R⩽7/8 are provided. Newly discovered rate-2/3 and -3/4 long-memory punctured convolutional codes with 9⩽M⩽23 are provided together with the leading terms of their weight spectra and their bit error performance bounds. Some results of simulation with sequential decoding are given

Keywords

decoding; error correction codes; Viterbi decoding; bit error performance; error correction codes; punctured convolutional codes; sequential decoding; short-memory codes; simulation; upper bounds; weight spectra; Artificial satellites; Convolutional codes; Data communication; Decoding; Error correction; Error probability; Memoryless systems; Reliability theory; Upper bound; Viterbi algorithm;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/26.46505

Filename

46505