WAVELET\
Wavelet Computations. {#wavelet-wavelet-computations. align=”center”}
=====================
WAVELET is a C++ library which contains some utilities for
computations involving wavelets.
Licensing: {#licensing align=”center”}
The computer code and data files described and made available on this
web page are distributed under the GNU LGPL
license.
Languages: {#languages align=”center”}
WAVELET is available in a C
version and a C++
version and a FORTRAN77
version and a FORTRAN90
version and a MATLAB
version.
HAAR, a C++ library which computes the
Haar transform of data.
SFTPACK, a C++ library which
implements the “slow” Fourier transform, intended as a teaching tool and
comparison with the fast Fourier transform.
SINE_TRANSFORM, a
C++ library which demonstrates some simple properties of the discrete
sine transform.
WALSH, a C++ library which implements
versions of the Walsh and Haar transforms.
Reference: {#reference align=”center”}
- Gilbert Strang, Truong Nguyen,\
Wavelets and Filter Banks,\
Wellesley-Cambridge Press, 1997,\
ISBN: 0-9614088-7-1,\
LC: TK7872.F5S79 / QA403.3.S87
Source Code: {#source-code align=”center”}
Examples and Tests: {#examples-and-tests align=”center”}
List of Routines: {#list-of-routines align=”center”}
- CASCADE carries out the cascade algorithm.
- DAUB_COEFFICIENTS returns a set of Daubechies coefficients.
- DAUB2_MATRIX returns the DAUB2 matrix.
- DAUB2_SCALE recursively evaluates the DAUB2 scaling function.
- DAUB2_TRANSFORM computes the DAUB2 transform of a vector.
- DAUB2_TRANSFORM_INVERSE inverts the DAUB2 transform of a
vector.
- DAUB4_MATRIX returns the DAUB4 matrix.
- DAUB4_SCALE recursively evaluates the DAUB4 scaling function.
- DAUB4_TRANSFORM computes the DAUB4 transform of a vector.
- DAUB4_TRANSFORM_INVERSE inverts the DAUB4 transform of a
vector.
- DAUB6_MATRIX returns the DAUB6 matrix.
- DAUB6_SCALE recursively evaluates the DAUB6 scaling function.
- DAUB6_TRANSFORM computes the DAUB6 transform of a vector.
- DAUB6_TRANSFORM_INVERSE inverts the DAUB6 transform of a
vector.
- DAUB8_MATRIX returns the DAUB8 matrix.
- DAUB8_SCALE recursively evaluates the DAUB8 scaling function.
- DAUB8_TRANSFORM computes the DAUB8 transform of a vector.
- DAUB8_TRANSFORM_INVERSE inverts the DAUB8 transform of a
vector.
- DAUB10_MATRIX returns the DAUB10 matrix.
- DAUB10_SCALE recursively evaluates the DAUB10 scaling function.
- DAUB10_TRANSFORM computes the DAUB10 transform of a vector.
- DAUB10_TRANSFORM_INVERSE inverts the DAUB10 transform of a
vector.
- DAUB12_MATRIX returns the DAUB12 matrix.
- DAUB12_TRANSFORM computes the DAUB12 transform of a vector.
- DAUB12_TRANSFORM_INVERSE inverts the DAUB12 transform of a
vector.
- DAUB14_TRANSFORM computes the DAUB14 transform of a vector.
- DAUB14_TRANSFORM_INVERSE inverts the DAUB14 transform of a
vector.
- DAUB16_TRANSFORM computes the DAUB16 transform of a vector.
- DAUB16_TRANSFORM_INVERSE inverts the DAUB16 transform of a
vector.
- DAUB18_TRANSFORM computes the DAUB18 transform of a vector.
- DAUB18_TRANSFORM_INVERSE inverts the DAUB18 transform of a
vector.
- DAUB20_TRANSFORM computes the DAUB20 transform of a vector.
- DAUB20_TRANSFORM_INVERSE inverts the DAUB20 transform of a
vector.
- I4_IS_POWER_OF_2 reports whether an I4 is a power of 2.
- I4_MAX returns the maximum of two I4’s.
- I4_MIN returns the minimum of two I4’s.
- I4_MODP returns the nonnegative remainder of I4 division.
- I4_WRAP forces an I4 to lie between given limits by wrapping.
- R8_UNIFORM_01 returns a unit pseudorandom R8.
- R8MAT_IS_IDENTITY determines if an R8MAT is the identity.
- R8MAT_ZERO_NEW returns a new zeroed R8MAT.
- R8VEC_CONJUGATE reverses a vector and negates even-indexed
entries.
- R8VEC_CONVOLUTION returns the convolution of two R8VEC’s.
- R8VEC_COPY_NEW copies an R8VEC to a new R8VEC.
- R8VEC_LINSPACE_NEW creates a vector of linearly spaced values.
- R8VEC_PRINT prints an R8VEC.
- R8VEC_UNIFORM_01_NEW returns a new unit pseudorandom R8VEC.
- TIMESTAMP prints the current YMDHMS date as a time stamp.
You can go up one level to the C++ source codes.
Last revised on 13 May 2012.