Persistent Link:
http://hdl.handle.net/10150/608427
Title:
TELEMETRY AS AUTOMATA
Author:
Jones, Charles H.
Affiliation:
Edwards Air Force Base
Issue Date:
1995-11
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:
In its simplest form an automaton can be considered a set of inputs, a process, and a set of outputs. Certainly telemetry can be thought of in this way as well. Automata theory is a cross between mathematics and computer science which considers how to precisely define the inputs, the outputs, and the process of translating the one into the other. The input to an automaton can be described using a formal grammar. Two standard bit stream encodings, PCM matrices and MIL-STD-1553, are described using grammars. An example of how a grammar can be used to decode a bit stream is given. Further, ambiguity and complexity of bit stream encodings are discussed in the context of grammars. It is thus illustrated how grammars can be used to cleanly define and decode telemetry bit streams.
Keywords:
Automata; Telemetry; Grammars; Formal Languages; PCM; Complexity
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.titleTELEMETRY AS AUTOMATAen_US
dc.contributor.authorJones, Charles H.en
dc.contributor.departmentEdwards Air Force Baseen
dc.date.issued1995-11en
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.abstractIn its simplest form an automaton can be considered a set of inputs, a process, and a set of outputs. Certainly telemetry can be thought of in this way as well. Automata theory is a cross between mathematics and computer science which considers how to precisely define the inputs, the outputs, and the process of translating the one into the other. The input to an automaton can be described using a formal grammar. Two standard bit stream encodings, PCM matrices and MIL-STD-1553, are described using grammars. An example of how a grammar can be used to decode a bit stream is given. Further, ambiguity and complexity of bit stream encodings are discussed in the context of grammars. It is thus illustrated how grammars can be used to cleanly define and decode telemetry bit streams.en
dc.subjectAutomataen
dc.subjectTelemetryen
dc.subjectGrammarsen
dc.subjectFormal Languagesen
dc.subjectPCMen
dc.subjectComplexityen
dc.description.sponsorshipInternational Foundation for Telemeteringen
dc.identifier.issn0884-5123en
dc.identifier.issn0074-9079en
dc.identifier.urihttp://hdl.handle.net/10150/608427en
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.