High-rate punctured convolutional codes for Viterbi and sequential decoding

An investigation is conducted of the high-rate punctured convolutional codes suitable for Viterbi and sequential decoding. Results on known short-memory codes M >

[1]  Irwin M. Jacobs,et al.  Practical applications of coding , 1974, IEEE Trans. Inf. Theory.

[2]  F. Jelinek.  Fast sequential decoding algorithm using a stack , 1969 .

[3]  R. Orndorff,et al.  Viterbi decoder VLSI integrated circuit for bit error correction , 1981 .

[4]  J. Bibb Cain,et al.  Punctured convolutional codes of rate (n-1)/n and simplified maximum likelihood decoding (Corresp.) , 1979, IEEE Trans. Inf. Theory.

[5]  David Haccoun,et al.  High-rate punctured convolutional codes: structure properties and construction technique , 1989, IEEE Trans. Commun..

[6]  David Haccoun,et al.  Coding for Satellite Communication , 1987, IEEE J. Sel. Areas Commun..

[7]  Allen H. Levesque,et al.  Error-control techniques for digital communication , 1985 .

[8]  Joachim Hagenauer.  High rate convolutional codes with good distance profiles (Corresp.) , 1977, IEEE Trans. Inf. Theory.

[9]  William W. Wu.  Elements of Digital Satellite Communication , 1984 .

[10]  Robert Mario Fano,et al.  A heuristic discussion of probabilistic decoding , 1963, IEEE Trans. Inf. Theory.

[11]  Rolf Johannesson.  Some long rate one-half binary convolutional codes with an optimum distance profile (Corresp.) , 1976, IEEE Trans. Inf. Theory.

[12]  Rolf Johannesson,et al.  Further results on binary convolutional codes with an optimum distance profile (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[13]  K. Larsen,et al.  Short convolutional codes with maximal free distance for rates 1/2, 1/3, and 1/4 (Corresp.) , 1973, IEEE Trans. Inf. Theory.

[14]  David Haccoun,et al.  Variants of the stack algorithm for the decoding of high rate codes by sequential decoding , 1984 .

[15]  E.R. Berlekamp,et al.  The technology of error-correcting codes , 1980, Proceedings of the IEEE.

[16]  Elwyn R. Berlekamp,et al.  A lower bound to the distribution of computation for sequential decoding , 1967, IEEE Trans. Inf. Theory.

[17]  Michael J. Ferguson,et al.  Generalized stack algorithms for decoding convolutional codes , 1975, IEEE Trans. Inf. Theory.

[18]  A. Acampora,et al.  Analog Viterbi Decoding for High Speed Digital Satellite Channels , 1978, IEEE Trans. Commun..

[19]  Andrew J. Viterbi,et al.  Convolutional Codes and Their Performance in Communication Systems , 1971 .

[20]  R. T. Clark,et al.  Development of an LSI maximum-likelihood convolutional decoder for advanced forward error correction capability on the NASA 30/20 GHz program , 1982 .

[21]  Joachim Hagenauer,et al.  Rate-compatible punctured convolutional codes (RCPC codes) and their applications , 1988, IEEE Trans. Commun..

[22]  K. X. M. Tzeng,et al.  Convolutional Codes and 'Their Performance in Communication Systems , 1971 .

[23]  Erik Paaske,et al.  Short binary convolutional codes with maximal free distance for rates 2/3 and 3/4 (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[24]  Yasuo Hirata,et al.  High-Rate Punctured Convolutional Codes for Soft Decision Viterbi Decoding , 1984, IEEE Trans. Commun..