Automation of the lifting factorisation of wavelet transforms (Q1573073)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Automation of the lifting factorisation of wavelet transforms |
scientific article |
Statements
Automation of the lifting factorisation of wavelet transforms (English)
0 references
26 June 2001
0 references
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.
0 references
discrete wavelet transform
0 references
lifting scheme
0 references
polyphase matrices
0 references
Laurent polynomials
0 references
Mathematica program
0 references
factorizations
0 references
Euclidean algorithm
0 references
Gröbner bases
0 references
