Inverse problems in coding, automata, and continuous systems
- 1 January 1967
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The investigation presents explicit interconnections between inverse problems in the theories of convolutional codes, automata, and continuous time linear dynamical systems. In a code-generating, or transfer function, matrix framework, necessary and sufficient conditions are given for a feedforward linear sequential circuit to have a feedforward inverse, either instantaneous or with delay. In the corresponding state-oriented realization, techniques which have been applied to construct inverses for continuous time linear dynamical systems are used to outline the construction of inverse automata. Finally, the feedforward inverse results are applied to continuous time systems. Relationships between the results are discussed.Keywords
This publication has 3 references indexed in Scilit:
- Codes, automata, and continuous systems: Explicit interconnectionsIEEE Transactions on Automatic Control, 1967
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithmIEEE Transactions on Information Theory, 1967
- The reproducibility of multivariable systemsJournal of Mathematical Analysis and Applications, 1965