DocumentCode
1558388
Title
On minimal realization of 2-D systems
Author
Gu, Guoxiang ; Aravena, Jorge L. ; Zhou, Kemin
Author_Institution
Dept. of Electr. & Comput. Eng., Louisiana State Univ., Baton Rouge, LA, USA
Volume
38
Issue
10
fYear
1991
fDate
10/1/1991 12:00:00 AM
Firstpage
1228
Lastpage
1233
Abstract
An algorithm to obtain possibly absolutely minimal realizations of a given 2-D transfer function is developed. It is algebraic in nature and requires only 1-D realization theory and basic knowledge of linear algebra. Hence, the algorithm is simple and easy to program. The algorithm is guaranteed to yield absolutely minimal realizations for 2-D transfer functions having separable numerators and may also be applicable to general 2-D systems satisfying a certain consistency condition. An example is used to illustrate the effectiveness of the algorithm
Keywords
linear algebra; network synthesis; transfer functions; 2D systems; consistency condition; linear algebra; minimal realization; separable numerators; transfer functions; Circuits and systems; Delay systems; Digital filters; Equations; Linear algebra; Matrix decomposition; Polynomials; Singular value decomposition; Transfer functions;
fLanguage
English
Journal_Title
Circuits and Systems, IEEE Transactions on
Publisher
ieee
ISSN
0098-4094
Type
jour
DOI
10.1109/31.97545
Filename
97545
Link To Document