A Bound on Viterbi Decoder Error Burst Length
| dc.contributor.author | Curry, S. J. | |
| dc.contributor.author | Harmon, W. D. | |
| dc.date.accessioned | 2016-05-14T02:12:09Z | en |
| dc.date.available | 2016-05-14T02:12:09Z | en |
| dc.date.issued | 1976-09 | en |
| dc.identifier.issn | 0884-5123 | en |
| dc.identifier.issn | 0074-9079 | en |
| dc.identifier.uri | http://hdl.handle.net/10150/609369 | en |
| dc.description | International Telemetering Conference Proceedings / September 28-30, 1976 / Hyatt House Hotel, Los Angeles, California | en_US |
| dc.description.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. | |
| dc.description.sponsorship | International Foundation for Telemetering | en |
| dc.language.iso | en_US | en |
| dc.publisher | International Foundation for Telemetering | en |
| dc.relation.url | http://www.telemetry.org/ | en |
| dc.rights | Copyright © International Foundation for Telemetering | en |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | |
| dc.title | A Bound on Viterbi Decoder Error Burst Length | en_US |
| dc.type | text | en |
| dc.type | Proceedings | en |
| dc.contributor.department | Aerospace Corp. | en |
| dc.identifier.journal | International Telemetering Conference Proceedings | en |
| dc.description.collectioninformation | 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. | en |
| refterms.dateFOA | 2018-06-06T08:25:09Z | |
| html.description.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. |
