C09AAF (PDF version)
C09 Chapter Contents
C09 Chapter Introduction
NAG Library Manual

NAG Library Routine Document


Note:  before using this routine, please read the Users' Note for your implementation to check the interpretation of bold italicised terms and other implementation-dependent details.

+ Contents

    1  Purpose
    7  Accuracy

1  Purpose

C09AAF returns the details of the chosen one-dimensional discrete wavelet filter. For a chosen mother wavelet, discrete wavelet transform type (single-level or multi-level DWT) and end extension method, this routine returns the maximum number of levels of resolution (appropriate to a multi-level transform), the filter length, and the number of approximation coefficients (equal to the number of detail coefficients) for a single-level DWT or the total number of coefficients for a multi-level DWT. This routine must be called before any of the one-dimensional discrete transform routines in this chapter.

2  Specification


3  Description

One-dimensional discrete wavelet transforms (DWT) 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, n, of the input data array, x, C09AAF returns the dimension details for the transform determined by this combination. The dimension details are: lmax, the maximum number of levels of resolution that that could be computed were a multi-level DWT applied; nf, the filter length; nc the number of approximation (or detail) coefficients for a single-level DWT or the total number of coefficients generated by a multi-level DWT over lmax 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.

4  References


5  Parameters

1:     WAVNAM – CHARACTER(*)Input
On entry: the name of the mother wavelet. See the C09 Chapter Introduction for details.
Haar wavelet.
WAVNAM='DBn', where n=2,3,,10
Daubechies wavelet with n vanishing moments (2n coefficients). For example, WAVNAM='DB4' is the name for the Daubechies wavelet with 4 vanishing moments (8 coefficients).
WAVNAM='BIORx.y', where x.y 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 x.y. For example WAVNAM='BIOR3.1' is the name for the biorthogonal wavelet of order 3.1.
Constraint: WAVNAM='HAAR', 'DB2', 'DB3', 'DB4', 'DB5', 'DB6', 'DB7', 'DB8', 'DB9', 'DB10', 'BIOR1.1', 'BIOR1.3', 'BIOR1.5', 'BIOR2.2', 'BIOR2.4', 'BIOR2.6', 'BIOR2.8', 'BIOR3.1', 'BIOR3.3', 'BIOR3.5' or 'BIOR3.7'.
2:     WTRANS – 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.
Constraint: WTRANS='S' or 'M'.
3:     MODE – CHARACTER(1)Input
On entry: the end extension method.
Periodic end extension.
Half-point symmetric end extension.
Whole-point symmetric end extension.
Zero end extension.
Constraint: MODE='P', 'H', 'W' or 'Z'.
4:     N – INTEGERInput
On entry: the number of elements, n, in the input data array, x.
Constraint: N2.
5:     NWL – INTEGEROutput
On exit: the maximum number of levels of resolution, lmax, that can be computed when a multi-level discrete wavelet transform is applied. It is such that 2lmaxn<2lmax+1, for lmax an integer.
6:     NF – INTEGEROutput
On exit: the filter length, nf, for the supplied mother wavelet. This is used to determine the number of coefficients to be generated by the chosen transform.
7:     NWC – INTEGEROutput
On exit: for a single-level transform (WTRANS='S'), 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 (WTRANS='M') the total number of coefficients that would be generated over lmax levels.
8:     ICOMM(100) – 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 discrete transform routines in this chapter.
9:     IFAIL – INTEGERInput/Output
On entry: IFAIL must be set to 0, -1​ or ​1. If you are unfamiliar with this parameter you should refer to Section 3.3 in the Essential Introduction for details.
For environments where it might be inappropriate to halt program execution when an error is detected, the value -1​ or ​1 is recommended. If the output of error messages is undesirable, then the value 1 is recommended. Otherwise, if you are not familiar with this parameter, the recommended value is 0. When the value -1​ or ​1 is used it is essential to test the value of IFAIL on exit.
On exit: IFAIL=0 unless the routine detects an error or a warning has been flagged (see Section 6).

6  Error Indicators and Warnings

If on entry IFAIL=0 or -1, explanatory error messages are output on the current error message unit (as defined by X04AAF).
Errors or warnings detected by the routine:
On entry,WAVNAM'HAAR', 'DB2', 'DB3', 'DB4', 'DB5', 'DB6', 'DB7', 'DB8', 'DB9', 'DB10', 'BIOR1.1', 'BIOR1.3', 'BIOR1.5', 'BIOR2.2', 'BIOR2.4', 'BIOR2.6', 'BIOR2.8', 'BIOR3.1', 'BIOR3.3', 'BIOR3.5' or 'BIOR3.7'.
On entry,WTRANS'S' or 'M'.
On entry,MODE'P', 'H', 'W' or 'Z'.
On entry,N<2.

7  Accuracy

Not applicable.

8  Further Comments


9  Example

This example computes the one-dimensional multi-level resolution for 8 values by a discrete wavelet transform using the Haar wavelet with zero end extensions. The length of the wavelet filter, the number of levels of resolution, the number of approximation coefficients at each level and the total number of wavelet coefficients are printed.

9.1  Program Text

Program Text (c09aafe.f90)

9.2  Program Data

Program Data (c09aafe.d)

9.3  Program Results

Program Results (c09aafe.r)

C09AAF (PDF version)
C09 Chapter Contents
C09 Chapter Introduction
NAG Library Manual

© The Numerical Algorithms Group Ltd, Oxford, UK. 2012