Abstract
In this paper a method for obtaining n state-space realization of active electronic circuits is presented. The method Starts from the standard nodal equation of a linearized circuit model. It uses the concept of generalized matrix inverse. The elements of the state vector are given by linear combination of nodal voltages. Also, a corresponding computational algorithm is described. In order to reduce the required core memory, all matrix calculations are carried out using partitioned matrices. The algorithm permits calculation of both the minimal state-space realization and the poles and zeros of the considered electrical circuit. A computer program implementing the described algorithm exhibits satisfactory performance. Compared to some existing computer programs, such as NASAP, it is advantageous in both CPU time and core memory requirements.
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.
