Formation of the block Toeplitz matrix for two-dimensional PLSI polynomials (Q1092865)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Formation of the block Toeplitz matrix for two-dimensional PLSI polynomials |
scientific article; zbMATH DE number 4020977
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Formation of the block Toeplitz matrix for two-dimensional PLSI polynomials |
scientific article; zbMATH DE number 4020977 |
Statements
Formation of the block Toeplitz matrix for two-dimensional PLSI polynomials (English)
0 references
1987
0 references
The planar least-squares inverse (PLSI) polynomials are used to stabilize two-dimensional unstable recursive filters. In order to obtain the PLSI polynomials, the main work involved consists in forming a set of linear equations and then solving them. In this paper we present an efficient and simple method to form the necessary set of linear equations (i.e., the required coefficient matrix) for a chosen pattern and order of the desired PLSI polynomial, starting from the denominator polynomial of a two-dimensional unstable recursive filter.
0 references
planar least-squares inverse (PLSI) polynomials
0 references
stabilize two- dimensional unstable recursive filters
0 references
0 references
0.87080604
0 references
0.86592394
0 references
0.86380905
0 references
0.8629184
0 references
0.86234796
0 references
0.8604614
0 references
0.85860157
0 references
0.85431826
0 references