Automation of the lifting factorisation of wavelet transforms
From MaRDI portal
The lifting scheme for finding the discrete wavelet transform depends on the factorization of polyphase matrices, whose entries are Laurent polynomials. Such factorization is not unique. In this paper, the authors outline a Mathematica program that finds all factorizations of such matrices by automating the Euclidean algorithm for Laurent polynomials. Gröbner bases are used to the reduce polynomial degree and the number of wavelet coefficients.
Recommendations
- scientific article; zbMATH DE number 1552584
- The Lifting Scheme: A Construction of Second Generation Wavelets
- Factoring wavelet transforms into lifting steps
- SYMMETRIC LIFTING FACTORIZATION AND MATRIX REPRESENTATION OF BIORTHOGONAL WAVELET TRANSFORMS
- The lifting factorization of 2D 4-channel nonseparable wavelet transforms
Cited in
(4)- Implementing Daubechies wavelet transform with weighted finite automata
- Analytic matrix elements for the two-electron atomic basis with logarithmic terms
- SYMMETRIC LIFTING FACTORIZATION AND MATRIX REPRESENTATION OF BIORTHOGONAL WAVELET TRANSFORMS
- Factoring perfect reconstruction filter banks into causal lifting matrices: a Diophantine approach
This page was built for publication: Automation of the lifting factorisation of wavelet transforms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1573073)