Abstract
The (J,J')-lossless factorization problem for discrete-time systems is considered using a bilinear transformation approach. Necessary and sufficient conditions for the existence of the (J,J')-lossless factorization are given in terms of two discretetime algebraic Riccati equations whose solvability can readily be checked. A statespace characterization for the (J,J')-lossless factorization is provided. Compared with the derivation given in Kongprawechnon and Kimura (1996), our solution is more concise and our result takes a simpler form which does not require the system matrix to be non-singular.
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.
