Abstract
In this paper, we study the invertibility of M-variate Laurent polynomial N × P matrices. Such matrices represent multidimensional systems in various settings such as filter banks, multiple-input multiple-output systems, and multirate systems. Given an N × P Laurent polynomial matrix H(z1,⋯, zm) of degree at most k, we want to find a P × N Laurent polynomial left inverse matrix G(z) of H(z) such that G(z) H(z) = I. We provide computable conditions to test the invertibility and propose algorithms to find a particular inverse. The main result of this paper is to prove that H(z) is generically invertible when N - P ≥ M; whereas when N - P > M, then H(z) is generically noninvertible. As a result, we propose an algorithm to find a particular inverse of a Laurent polynomial matrix that is faster than current algorithms known to us.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 4282-4291 |
| Number of pages | 10 |
| Journal | IEEE Transactions on Signal Processing |
| Volume | 57 |
| Issue number | 11 |
| DOIs | |
| State | Published - 2009 |
Keywords
- Generic property
- Gröbner Bases
- Left invertibility
- Multidimensional multirate systems
- Perfect reconstruction
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Signal Processing
Fingerprint
Dive into the research topics of 'Generic invertibility of multidimensional FIR filter banks and MIMO systems'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS