Soft Syndrome Decoding of Binary Convolutional Codes

IEEE Transactions on Communications

Volumn 43, Issue 234, 1995, Pages 288-297

  Ariel, Meir ^a   Snyders, Jakov ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BINARY CODES; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY; ERRORS; POLYNOMIALS; PROBABILITY; RECURSIVE FUNCTIONS; RELIABILITY THEORY; VECTORS;

ERROR TRELLIS; HAMMING WEIGHT; LOG LIKELIHOOD RATIO; MAXIMUM LIKELIHOOD SOFT SYNDROME DECODING; VITERBI ALGORITHM;

DECODING;

EID: 0029251668     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/26.380047     Document Type: Article

References (8)

1. G.D. Forney, Jr., “Convolutional codes II. Maximum likelihood decoding,” Inform. Contr., vol. 25, pp. 222–266, July 1974.
2. J.P.M. Shalkwijk, A.J. Vinck, and K.A. Post, “Syndrome decoding of binary rate k/n convolutional codes,” IEEE Trans. Inform. Theory, vol. IT–24, pp. 553–562, Sept. 1978.
3. D. Chase, “A class of algorithms for decoding block codes with channel measurement information,” IEEE Trans. Inform. Theory, vol. IT–18, pp. 170–182, Jan. 1972.
4. H. Miyakawa and T. Kaneko, “Decoding algorithms of error-correcting codes by use of analog weights,” Electronics and Communications in Japan, vol. 58–A, pp. 18–27, Jan. 1975.
5. J. Snyders and Y. Be'ery, “Maximum likelihood soft decoding of binary block codes and decoders for the Golay codes,” IEEE Trans. Inform. Theory, vol. IT–35, pp. 963–975, Sept. 1989.
6. J. Snyders, “Reduced lists of error patterns for maximum likelihood soft decoding,” IEEE Trans. Inform. Theory, vol. IT–37, pp. 1194–1200, July 1991.
7. J.K. Omura, “On the Viterbi decoding algorithm,” IEEE Trans. Inform. Theory, vol. IT–15, pp. 177–179, Jan. 1969.
8. A.J. Viterbi, “Convolutional codes and their performance in communication systems,” IEEE Trans. Commun. Technol., vol. COM–19, pp. 751–772, Oct. 1971.