DECODING PROCEDURES FOR CONVOLUTIONAL CODES,
Abstract
A definition of a convolutional code is given in terms of the encoding implementation equipment. A mathematical model consisting of two finite dimensional matrices is then formulated for a convolutional code of redundancy m/b from the encoding procedure. A general decoding procedure for decoding a convolutional code is discussed as an introduction to two specific decoding procedures, algebraic decoding and probabilistic decoding. The necessary and sufficient conditions for algebraic decoding of both independent and burst errors is given and an implementation procedure for algebraic decoding is established. A bound on the complexity of the decoding equipment is also derived for algebraic decoding. Probabilistic decoding and the concept of tree codes is introduced. The implementation procedure for probabilistic decoding is discussed and a bound on the complexity of the necessary decoding procedure is derived. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Nov 01, 1966
- Accession Number
- AD0644726
Entities
People
- James Ernest Heller
Organizations
- University of Illinois Urbana–Champaign