Filter banks allowing perfect reconstruction
Signal Processing
On the complexity of computing syzygies
Journal of Symbolic Computation
Algorithmic algebra
Multirate systems and filter banks
Multirate systems and filter banks
Wavelets and subband coding
On the Complexity of the Groebner-Bases Algorithm over K[x, y, z]
EUROSAM '84 Proceedings of the International Symposium on Symbolic and Algebraic Computation
A computational theory of laurent polynomial rings and multidimensional fir systems
A computational theory of laurent polynomial rings and multidimensional fir systems
IEEE Transactions on Signal Processing
Role of anticausal inverses in multirate filter-banks .I.System-theoretic fundamentals
IEEE Transactions on Signal Processing
Notes on \sl n-D Polynomial Matrix Factorizations
Multidimensional Systems and Signal Processing
Gröbner Bases and Systems Theory
Multidimensional Systems and Signal Processing
Computer algebra handbook
Multidimensional perfect reconstruction filter banks: an approach of algebraic geometry
Multidimensional Systems and Signal Processing
Optimization of synthesis oversampled complex filter banks
IEEE Transactions on Signal Processing
Generic invertibility of multidimensional FIR filter banks and MIMO systems
IEEE Transactions on Signal Processing
Locally invertible multivariate polynomial matrices
WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
Hi-index | 0.01 |
The polyphase representation with respect to sampling lattices inmultidimensional (M-D) multirate signal processing allows usto identify perfect reconstruction (PR) filter banks with unimodularLaurent polynomial matrices, and various problems in the designand analysis of invertible MD multirate systems can be algebraicallyformulated with the aid of this representation. While the resultingalgebraic problems can be solved in one dimension (1-D) by theEuclidean Division Algorithm, we show that Gröbner basesoffers an effective solution to them in the M-D case.