Paraunitary filter banks are multi-rate filter realizations of orthogonal wavelet transforms. They are an important subclass of perfect reconstruction filter banks that provide a new framework for error control coding and decoding. This paper undertakes the problem of classifying all paraunitary matrices with entries from a polynomial ring, where the coefficients of the polynomials are taken from finite fields. It constructs Householder transformations that are used as elementary operations for the realization of all unitary matrices. Then, it introduces elementary paraunitary building blocks and a factorization technique that are specialized to obtain a complete realization for all paraunitary filter banks over fields of characteristic two (this is proved for the 2-band case, and a conjecture is applied for the proof of the M-band case, where M/spl ges/3). Using these elementary building blocks, we can construct all paraunitary filter banks over fields of characteristic two.
[1]
P. P. Vaidyanathan,et al.
Paraunitary filter banks over finite fields
,
1997,
IEEE Trans. Signal Process..
[2]
J. O’Sullivan,et al.
Theory of Paraunitary Filter Banks Over Fields of Characteristic Two
,
2002
.
[3]
G. David Forney,et al.
Convolutional codes I: Algebraic structure
,
1970,
IEEE Trans. Inf. Theory.
[4]
Steven W. McLaughlin,et al.
Double Circulant Self-Dual Codes Using Finite-Field Wavelet Transforms
,
1999,
AAECC.
[5]
Ronald W. Schafer,et al.
Theory of wavelet transform over finite fields
,
1999,
1999 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings. ICASSP99 (Cat. No.99CH36258).