Answers are grounded in this paper and cite their sources.
A new and computationally efficient algorithm for inversion of linear time-invariant systems is presented. Existence conditions for either left- or right-inverse systems are also presented together with stability criteria. These criteria indicate that the algorithm will find a stable inverse whenever one exists. The results apply to both left and right inversion of a linear system and include the special case of linear finite automata or convolutional encoders.
No takes yet. Share an insight, caveat, or question.
P. Moylan (1977) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: