Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
