International Telemetering Conference Proceedings / October 30-November 02, 1995 / Riviera Hotel, Las Vegas, Nevada / 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.
| Identifer | oai:union.ndltd.org:arizona.edu/oai:arizona.openrepository.com:10150/608427 |
| Date | 11 1900 |
| Creators | Jones, Charles H. |
| Contributors | Edwards Air Force Base |
| Publisher | International Foundation for Telemetering |
| Source Sets | University of Arizona |
| Language | en_US |
| Detected Language | English |
| Type | text, Proceedings |
| Rights | Copyright © International Foundation for Telemetering |
| Relation | http://www.telemetry.org/ |
Page generated in 0.0123 seconds