ON SEQUENTIAL DECODING,

Abstract

By a proper selection of distance metric, it is possible to show that the average number of computations for the Wozencraft sequential decoding algorithm can be bounded independently of the code constraint length for transmission rates below a computation rate Rcomp. The bound on the probability of decoding error is proved to be similar to the bound for Fano's algorithm. A modification of the Wozencraft algorithm is presented. Use of a multiple-threshold test (MTT) enables the decoder to adjust its operation to the noise conditions. A modified search procedure is also presented. Analytical results show that this modified algorithm is comparable with Fano's algorithm in terms of the average number of computations and the probability of error. (Author)

Document Details

Document Type
Technical Report
Publication Date
Feb 07, 1967
Accession Number
AD0654673

Entities

People

  • Sharon Lin

Organizations

  • University of HawaiĘ»i System

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Coding
  • Computational Complexity
  • Computations
  • Data Processing Equipment
  • Decoders
  • Decoding
  • Mathematical Analysis
  • Mathematics
  • Notation
  • Probability

Readers

  • Computer Programming and Software Development.
  • Mathematical Modeling and Probability Theory.