Show simple item record

dc.contributor.authorHuth, G. K.*
dc.date.accessioned2016-05-14T01:52:03Zen
dc.date.available2016-05-14T01:52:03Zen
dc.date.issued1976-09en
dc.identifier.issn0884-5123en
dc.identifier.issn0074-9079en
dc.identifier.urihttp://hdl.handle.net/10150/609361en
dc.descriptionInternational Telemetering Conference Proceedings / September 28-30, 1976 / Hyatt House Hotel, Los Angeles, Californiaen_US
dc.description.abstractThe probability of error for a convolutional coded communication system can be predicted using three approaches. The first approach is using Gallager's [1] exponential bound for random codes. The second technique is the use of transfer function union bounds developed by Viterbi [2]. Finally, an approximation to the transfer function developed by Huth and Weber [3] can be used. This paper compares the three approaches for predicting performance and presents results for Viterbi decoding bit error probability, burst error probability, and decoder memory length.
dc.description.sponsorshipInternational Foundation for Telemeteringen
dc.language.isoen_USen
dc.publisherInternational Foundation for Telemeteringen
dc.relation.urlhttp://www.telemetry.org/en
dc.rightsCopyright © International Foundation for Telemeteringen
dc.titlePredicting Performance of Convolutional Coded Communication Systemsen_US
dc.typetexten
dc.typeProceedingsen
dc.contributor.departmentAxiomatixen
dc.identifier.journalInternational Telemetering Conference Proceedingsen
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
refterms.dateFOA2018-08-19T07:22:00Z
html.description.abstractThe probability of error for a convolutional coded communication system can be predicted using three approaches. The first approach is using Gallager's [1] exponential bound for random codes. The second technique is the use of transfer function union bounds developed by Viterbi [2]. Finally, an approximation to the transfer function developed by Huth and Weber [3] can be used. This paper compares the three approaches for predicting performance and presents results for Viterbi decoding bit error probability, burst error probability, and decoder memory length.


Files in this item

Thumbnail
Name:
ITC_1976_76-02-5.pdf
Size:
218.7Kb
Format:
PDF

This item appears in the following Collection(s)

Show simple item record