NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
Convolutional codes. II - Maximum-likelihood decoding. III - Sequential decodingMaximum-likelihood decoding is characterized as the determination of the shortest path through a topological structure called a trellis. Aspects of code structure are discussed along with questions regarding maximum-likelihood decoding on memoryless channels. A general bounding technique is introduced. The technique is used to obtain asymptotic bounds on the probability of error for maximum-likelihood decoding and list-of-2 decoding. The basic features of sequential algorithms are discussed along with a stack algorithm, questions of computational distribution, and the martingale approach to computational bounds.
Document ID
19740054149
Acquisition Source
Legacy CDMS
Document Type
Reprint (Version printed in journal)
Authors
Forney, G. D., Jr.
(Codex Corp. Newton, Mass., United States)
Date Acquired
August 7, 2013
Publication Date
July 1, 1974
Publication Information
Publication: Information and Control
Volume: 25
Subject Category
Computers
Accession Number
74A36899
Funding Number(s)
CONTRACT_GRANT: NSF GK-31627
Distribution Limits
Public
Copyright
Other

Available Downloads

There are no available downloads for this record.
No Preview Available