Persistent Link:
http://hdl.handle.net/10150/609369
Title:
A Bound on Viterbi Decoder Error Burst Length
Author:
Curry, S. J.; Harmon, W. D.
Affiliation:
Aerospace Corp.
Issue Date:
1976-09
Rights:
Copyright © International Foundation for Telemetering
Collection Information:
Proceedings from the International Telemetering Conference are made available by the International Foundation for Telemetering and the University of Arizona Libraries. Visit http://www.telemetry.org/index.php/contact-us if you have questions about items in this collection.
Publisher:
International Foundation for Telemetering
Journal:
International Telemetering Conference Proceedings
Abstract:
A maximum likelihood (Viterbi) decoder used with a convolutional code on a Gaussian channel produces decoding errors which tend to occur in clusters or bursts. A method is described for deriving an upper bound on the probability of occurrence of error bursts of a given length. The method applies to the optimum convolutional codes found by Odenwalder, for which the codeword weight distribution is partially known. Laboratory measurements of error burst length at signal-to-noise ratios greater than 4 dB indicate that the upper bound is useful for approximating the length of high-probability bursts, but is not precise enough to predict the probability of very long, low-probability bursts.
Sponsors:
International Foundation for Telemetering
ISSN:
0884-5123; 0074-9079
Additional Links:
http://www.telemetry.org/

Full metadata record

DC FieldValue Language
dc.language.isoen_USen
dc.titleA Bound on Viterbi Decoder Error Burst Lengthen_US
dc.contributor.authorCurry, S. J.en
dc.contributor.authorHarmon, W. D.en
dc.contributor.departmentAerospace Corp.en
dc.date.issued1976-09en
dc.rightsCopyright © International Foundation for Telemeteringen
dc.description.collectioninformationProceedings from the International Telemetering Conference are made available by the International Foundation for Telemetering and the University of Arizona Libraries. Visit http://www.telemetry.org/index.php/contact-us if you have questions about items in this collection.en
dc.publisherInternational Foundation for Telemeteringen
dc.description.abstractA maximum likelihood (Viterbi) decoder used with a convolutional code on a Gaussian channel produces decoding errors which tend to occur in clusters or bursts. A method is described for deriving an upper bound on the probability of occurrence of error bursts of a given length. The method applies to the optimum convolutional codes found by Odenwalder, for which the codeword weight distribution is partially known. Laboratory measurements of error burst length at signal-to-noise ratios greater than 4 dB indicate that the upper bound is useful for approximating the length of high-probability bursts, but is not precise enough to predict the probability of very long, low-probability bursts.en
dc.description.sponsorshipInternational Foundation for Telemeteringen
dc.identifier.issn0884-5123en
dc.identifier.issn0074-9079en
dc.identifier.urihttp://hdl.handle.net/10150/609369en
dc.identifier.journalInternational Telemetering Conference Proceedingsen
dc.typetexten
dc.typeProceedingsen
dc.relation.urlhttp://www.telemetry.org/en
All Items in UA Campus Repository are protected by copyright, with all rights reserved, unless otherwise indicated.