A constructive algorithm for spectral factorization of parahermitian polynomial matrices

S Basu

doi:10.1109/iscas.1992.230155

A constructive algorithm for spectral factorization of parahermitian polynomial matrices

S Basu

https://doi.org/10.1109/iscas.1992.230155

Copy DOI

Publication Date: May 10, 1992

Citations: 1

Affiliation: Stevens Institute of Technology

#Factorization Of Polynomial Matrices #Factorization Of Matrices + Show 8 more

Abstract
Full-Text
Similar Papers

Abstract

Presents a constructive algorithm for spectral factorization of 2D parahermitian positive definite polynomial matrices. Such an algorithm is expected to be useful in many problems in multidimensional signal and system theory. While earlier solutions to the problem in the mathematical literature deal with existence type results, the present algorithm is also believed to provide an elementary proof of the most nontrivial fact that a factorization of a specific type can always be carried out. An example illustrating the main aspects of the algorithm is included. >

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 call

Similar Papers

Paper Title

Journal

Date

Author

View more papers

Disclaimer: 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.