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. |
Year | DOI | Venue |
---|---|---|
1967 | 10.1109/FOCS.1967.17 | Austin, TX, USA |
Keywords | DocType | Citations |
continuous time system,feedforward inverse result,convolutional code,feedforward inverse,corresponding state-oriented realization,inverse problem,continuous system,feedforward linear sequential circuit,linear dynamical system,continuous time,inverse automaton,code generation,convolutional codes,transfer function,inverse problems,decoding,sequential circuits,automata,transfer functions,polynomials | Conference | 3 |
PageRank | References | Authors |
20.46 | 0 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
James L. Massey | 1 | 1096 | 272.94 |
Michael K. Sain | 2 | 14 | 25.39 |