Estimations of the transfer functions of noncatastrophic convolutional encoders

IEEE Transactions on Information Theory

Volumn 42, Issue 3, 1996, Pages 1014-1021

  Balakirsky, Vladimir B ^a,b  

^a BIELEFELD UNIVERSITY   (Germany)

^b Data Security Association 'Confident'   (Russian Federation)

Author keywords

Convolutional codes; Recurrent equations; Viterbi decoding

Indexed keywords

ALGORITHMS; BINARY SEQUENCES; CODING ERRORS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; DECODING; ENCODING (SYMBOLS); INFORMATION THEORY; ITERATIVE METHODS; POLYNOMIALS; PROBABILITY; TRANSFER FUNCTIONS;

LINEAR RECURRENT EQUATIONS; NONCATASTROPHIC CONVOLUTIONAL ENCODERS; UPPER BOUND; VITERBI DECODING;

CONVOLUTIONAL CODES;

EID: 0030151206     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.490568     Document Type: Article

References (13)

1. A.J. Viterbi, "Convolutional codes and their performance in communication systems." IEEE Trans. Commun. Technol., vol. COM-19, pt. 2, no. 5, pp. 751-772, 1971.
2. L. van de Meeberg, "A tightened upper bound on the error probability of binary convolutional codes with Viterbi decoding." IEEE Trans. Inform. Theory, vol. IT-20, no. 3, pp. 389-391, 1974.
3. M. Cedervall, R Johannesson, and K. Sh. Zigangirov, "A new upper bound on the first-event error probability' for maximum-likelihood decoding of fixed binary convolutional codes," IEEE Trans. Inform. Theory, vol. IT-30, no 5, pp. 762-766, 1984.
4. J.L. Massey and M. K. Sain, "Inverses of linear sequential circuits," IEEE Trans. Comput., vol. C-17, no. 4, pp. 330-337, 1968.
5. P. Fitspatnck and G. H. Norton, "Linear lecuniug sequences and the weight cnumeiator of a convolulional code," Electron. Let!., vol. 27, no. 1. pp. 98-99, Jan. 3, 1991.
6. V.B. Balakirsky, "Algorithms for estimations of the error probabilities at the output of the Viterbi decoder," Tekhnika Srcdstv Svyazj (ser.'Tekhnika Radiosvyazi"), M.: no. 5, pp. 12-23, 1981.
7. M. Cedervall and R Johannesson, "A fast algorithm for computing distance spectrum of convulutional codes," IEEE Trans. Inform. Theory, vol. 35, no. 5, pp. 1146-11.59, 1989.
8. J. Connan, ''The weight spectra of some short low-rate convolutional codes," IEEE Trans. Commun.Technol, vol. COM-33, no. 9, pp. 1050-1053, 1984.
9. M. Cedervall, private communication, Nov.. 1993.
10. V. B. Balakirsky. "A neccessary and sufficient condition for timevariant convolutional encoders to be noncatastrophic," Lecture Notes in Computer Science, no. 781. New York: Springer-Verlag, 1993, pp. 1 10.
11. J.B. Andersen and K. Balachandran, "Decision depths of convolutional codes," IEEE Trans. Inform. Theory, vol 35, no. 2, pp. 455-459, 1989.
12. A.J. Viterbi and J. K. Omura. Principles of Digital Communication and Codini;. New York: McGraw-Hill, 1979.
13. K. Sh. Zigangirov, Procedures of Sequential Decoding (in Russian). Moscow: "Svyaz," 1974.