Persistent Link:
http://hdl.handle.net/10150/608963
Title:
Frame Sync Acquisition for Biorthogonally Coded Data
Author:
Levitt, Barry K.
Issue Date:
1974-10
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:
The 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.
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.titleFrame Sync Acquisition for Biorthogonally Coded Dataen_US
dc.contributor.authorLevitt, Barry K.en
dc.date.issued1974-10en
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.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.en
dc.description.sponsorshipInternational Foundation for Telemeteringen
dc.identifier.issn0884-5123en
dc.identifier.issn0074-9079en
dc.identifier.urihttp://hdl.handle.net/10150/608963en
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.