Elimination of zero‐input limit cycles by bounding the state transition matrix | Zendy

Turner L. E. | Zendy; Bruton L. T. | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

Elimination of zero‐input limit cycles by bounding the state transition matrix

Author(s) -

Turner L. E.,

Bruton L. T.

Publication year - 1979

Publication title -

international journal of circuit theory and applications

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.364

H-Index - 52

eISSN - 1097-007X

pISSN - 0098-9886

DOI - 10.1002/cta.4490070111

Subject(s) - limit (mathematics) , zero (linguistics) , bounding overwatch , matrix (chemical analysis) , mathematics , stochastic matrix , state (computer science) , granularity , state transition matrix , digital filter , control theory (sociology) , class (philosophy) , transition (genetics) , topology (electrical circuits) , mathematical analysis , algorithm , computer science , filter (signal processing) , symmetric matrix , physics , combinatorics , quantum mechanics , statistics , eigenvalues and eigenvectors , philosophy , materials science , artificial intelligence , markov chain , linguistics , composite material , operating system , control (management) , computer vision , chemistry , biochemistry , gene

A method of eliminating zero‐input granularity limit cycles in digital filters using the state transition matrix is presented. Further, for a particular class of digital filters, it is shown that bounding the transition matrix is sufficient to eliminate limit cycles of length n > 1.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research