Accession Number : AD0654673

Title :   ON SEQUENTIAL DECODING,

Corporate Author : HAWAII UNIV HONOLULU DEPT OF ELECTRICAL ENGINEERING

Personal Author(s) : Lin,S.

Report Date : 07 FEB 1967

Pagination or Media Count : 66

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)

Descriptors :   (*DECODING, INFORMATION THEORY), CODING, ERRORS, ALGORITHMS, SEARCH THEORY, MATHEMATICAL ANALYSIS

Subject Categories : Theoretical Mathematics
      Cybernetics

Distribution Statement : APPROVED FOR PUBLIC RELEASE