The Algebraic Structure of Convolutional Codes.
Abstract
A new error-trellis syndrome decoding scheme for convolutional codes is developed. It is demonstrated that the real advantage of error-trellis decoding over both Viterbi and sequential decoding of convolutional codes is the reduction of the number of states and transition between any two frames. An algebraic syndrome decoder is developed to find the best estimated message sequence for dual-K convolutional codes without finding minimum-error paths in an error-trellis diagram. A LSI chip is developed to realize this algorithm. Another new VLSI architecture is also developed for the Reed-Solomon decoder. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Nov 10, 1986
- Accession Number
- ADA176889
Entities
People
- Irving S. Reed
Organizations
- University of Southern California