Show simple item record

dc.contributor.authorLevitt, Barry K.en
dc.date.accessioned2016-05-10T23:03:17Zen
dc.date.available2016-05-10T23:03:17Zen
dc.date.issued1974-10en
dc.identifier.issn0884-5123en
dc.identifier.issn0074-9079en
dc.identifier.urihttp://hdl.handle.net/10150/608963en
dc.descriptionInternational Telemetering Conference Proceedings / October 15-17, 1974 / International Hotel, Los Angeles, Californiaen_US
dc.description.abstractThe optimum procedure for locating a sync word periodically inserted in uncoded binary data received over a binary symmetric channel is based on the Hamming or bit distance metric. This paper addresses the corresponding frame sync problem for biorthogonally coded data transmitted over the additive white Gaussian noise channel. For conceptual convenience, the k-bit words from the decoder output are treated as "super symbols" from an alphabet of dimension 2ᵏ. It is argued that the optimum sync word search over the decoded data stream is based on a super symbol distance rule matched to the properties of the biorthogonally coded transmissions over the noisy channel. An optimum frame sync acquisition algorithm based on this distance rule is formulated, and its performance is investigated. As an example, the performance of this optimum frame sync algorithm is contrasted analytically with that of a Hamming distance algorithm operating on decoded (32, 6) biorthogonal data, a case of interest to some recent unmanned American space missions.
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.titleFrame Sync Acquisition for Biorthogonally Coded Dataen_US
dc.typetexten
dc.typeProceedingsen
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-09-11T10:13:48Z
html.description.abstractThe optimum procedure for locating a sync word periodically inserted in uncoded binary data received over a binary symmetric channel is based on the Hamming or bit distance metric. This paper addresses the corresponding frame sync problem for biorthogonally coded data transmitted over the additive white Gaussian noise channel. For conceptual convenience, the k-bit words from the decoder output are treated as "super symbols" from an alphabet of dimension 2ᵏ. It is argued that the optimum sync word search over the decoded data stream is based on a super symbol distance rule matched to the properties of the biorthogonally coded transmissions over the noisy channel. An optimum frame sync acquisition algorithm based on this distance rule is formulated, and its performance is investigated. As an example, the performance of this optimum frame sync algorithm is contrasted analytically with that of a Hamming distance algorithm operating on decoded (32, 6) biorthogonal data, a case of interest to some recent unmanned American space missions.


Files in this item

Thumbnail
Name:
ITC_1974_74-08-4.pdf
Size:
1.480Mb
Format:
PDF

This item appears in the following Collection(s)

Show simple item record