One-dimensional discrete wavelet transforms (DWT) or maximum overlap wavelet transforms (MODWT) are characterised by the mother wavelet, the end extension method and whether multiresolution analysis is to be performed. For the selected combination of choices for these three characteristics, and for a given length,
, of the input data array,
,
c09aaf returns the dimension details for the transform determined by this combination. The dimension details are:
, the maximum number of levels of resolution that that could be computed were a multi-level DWT/MODWT applied;
, the filter length;
the number of approximation (or detail) coefficients for a single-level DWT/MODWT or the total number of coefficients generated by a multi-level DWT/MODWT over
levels. These values are also stored in the communication array
icomm, as are the input choices, so that they may be conveniently communicated to the one-dimensional transform routines in this chapter.
None.
- 1: – Character(*)Input
-
On entry: the name of the mother wavelet. See the
C09 Chapter Introduction for details.
- Haar wavelet.
- , where
- Daubechies wavelet with vanishing moments ( coefficients). For example, is the name for the Daubechies wavelet with vanishing moments ( coefficients).
- ., where . can be one of 1.1, 1.3, 1.5, 2.2, 2.4, 2.6, 2.8, 3.1, 3.3, 3.5 or 3.7
- Biorthogonal wavelet of order .. For example is the name for the biorthogonal wavelet of order .
Constraint:
, , , , , , , , , , , , , , , , , , , or .
- 2: – Character(1)Input
-
On entry: the type of discrete wavelet transform that is to be applied.
- Single-level decomposition or reconstruction by discrete wavelet transform.
- Multiresolution, by a multi-level DWT or its inverse.
- Single-level decomposition or reconstruction by maximal overlap discrete wavelet transform.
- Multi-level resolution by a maximal overlap discrete wavelet transform or its inverse.
Constraint:
, , or .
- 3: – Character(1)Input
-
On entry: the end extension method. Note that only periodic end extension is currently available for the MODWT.
- Periodic end extension.
- Half-point symmetric end extension.
- Whole-point symmetric end extension.
- Zero end extension.
Constraints:
- , , or for DWT;
- for MODWT.
- 4: – IntegerInput
-
On entry: the number of elements, , in the input data array, .
Constraint:
.
- 5: – IntegerOutput
-
On exit: the maximum number of levels of resolution, , that can be computed when a multi-level discrete wavelet transform is applied. It is such that , for an integer.
- 6: – IntegerOutput
-
On exit: the filter length, , for the supplied mother wavelet. This is used to determine the number of coefficients to be generated by the chosen transform.
- 7: – IntegerOutput
-
On exit: for a single-level transform ( or ), the number of approximation coefficients that would be generated for the given problem size, mother wavelet, extension method and type of transform; this is also the corresponding number of detail coefficients. For a multi-level transform ( or ) the total number of coefficients that would be generated over levels and with for MODWT.
- 8: – Integer arrayCommunication Array
-
On exit: contains details of the wavelet transform and the problem dimension which is to be communicated to the one-dimensional discrete transform routines in this chapter.
- 9: – IntegerInput/Output
-
On entry:
ifail must be set to
,
. If you are unfamiliar with this argument you should refer to
Section 3.4 in How to Use the NAG Library and its Documentation for details.
For environments where it might be inappropriate to halt program execution when an error is detected, the value
is recommended. If the output of error messages is undesirable, then the value
is recommended. Otherwise, if you are not familiar with this argument, the recommended value is
.
When the value is used it is essential to test the value of ifail on exit.
On exit:
unless the routine detects an error or a warning has been flagged (see
Section 6).
If on entry
or
, explanatory error messages are output on the current error message unit (as defined by
x04aaf).
Not applicable.
None.