New Syndrome Decoding Techniques for Convolutional Codes over GF(q)

Abstract

This is a final report on a one-year study of techniques for improving the encoding and decoding of error-correcting codes. For the previous three quarters emphasis was given to methods for making the encoding and decoding of Reed-Solomon codes more efficient. These methods included the possibility of using Winograd's fast transforms for transform encoding and decoding of Reed-Solomon codes, and studies for simplifying the arithmetic of the Galois fields used in error-correcting codes. The latter topic led to an investigation of the architecture needed to realize Berlekamp's new bit-serial multiplier. During the last quarter a new syndrome decoding algorithm for convolutional codes (CC) was conceived by the author. In this report this idea is extended to a greater generality.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1983
Accession Number
ADA127955

Entities

People

  • I. S. Reed

Tags

Communities of Interest

  • C4I
  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Circuits
  • Coders
  • Coding
  • Coefficients
  • Computer Programming
  • Decoders
  • Decoding
  • Dynamic Programming
  • Equations
  • Feedback
  • Identities
  • Polynomials
  • Sequences
  • Shift Registers
  • Symbols
  • Vector Spaces

Readers

  • Computer Programming and Software Development.
  • Technical Research and Report Writing.