DocumentCode :
2605532
Title :
On primitive factorizations for n-D polynomial matrices
Author :
Lin, Zhiping
Author_Institution :
Dept. of Comput. Sci. & Inf. Eng., Shantou Univ., Guangdong, China
fYear :
1993
fDate :
3-6 May 1993
Firstpage :
595
Abstract :
In the study of the analysis, synthesis and realization of multivariate networks, n-dimensional (n-D) systems stability theory and feedback control, and n-D signal processing, it is often necessary to consider the feasibility of a factorization for a given n-D polynomial matrix A(z) in the form A1(z) A2(z), where A1(z ) and AA2(z) are n-D polynomial matrices. The author reports on one such factorizations, i.e., the primitive factorization. A criterion for the existence of primitive factorizations for a class of n-D polynomial matrices is presented. The criterion can be used to construct a primitive factorization, when it exists, for an n-D polynomial matrix in this class
Keywords :
multidimensional systems; polynomial matrices; stability; feedback control; multivariate networks; polynomial matrices; primitive factorizations; signal processing; stability theory; Computer science; Control system synthesis; Feedback control; Network synthesis; Polynomials; Signal analysis; Signal processing; Signal processing algorithms; Signal synthesis; Stability analysis;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Circuits and Systems, 1993., ISCAS '93, 1993 IEEE International Symposium on
Conference_Location :
Chicago, IL
Print_ISBN :
0-7803-1281-3
Type :
conf
DOI :
10.1109/ISCAS.1993.393791
Filename :
393791
Link To Document :
بازگشت