The Algebraic Structure of Convolutional Codes
Abstract
A new code search technique for high-rate convolutional code is developed using the pruned-trellis algorithm. The search time and memory size is significantly reduced from standard techniques. Some new high-rate systematic and nonsystematic optimum convolutional codes have been found by this new search technique. The real advantage of the pruned error-trellis, syndrome decoding technique is the reduction of the memory size required with little performance
Document Details
- Document Type
- Technical Report
- Publication Date
- Oct 31, 1988
- Accession Number
- ADA204192
Entities
People
- Irving S. Reed
Organizations
- University of Southern California