Author
Jones, Charles H.Affiliation
Edwards Air Force BaseIssue Date
1995-11
Metadata
Show full item recordRights
Copyright © International Foundation for TelemeteringCollection 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.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.Sponsors
International Foundation for TelemeteringISSN
0884-51230074-9079