Table Of Contents

Wavelet Transform Daubechies4 Inverse (G Dataflow)

    Last Modified: January 9, 2017

    Computes the inverse of the wavelet transform based on the Daubechies4 function of a sequence.


    wavelet daubechies4{x}

    The input sequence.

    The length of the sequence has to be a power of 2, otherwise this node returns an error.


    error in

    Error conditions that occur before this node runs. The node responds to this input according to standard error behavior.

    Default: No error



    The inverse wavelet Daubechies4 transform of the input sequence.


    error out

    Error information. The node produces this output according to standard error behavior.

    Algorithm Definition

    The Wavelet Transform Daubechies4 Inverse transform can be defined with the help of the following transformation matrix:

    C = [ c 0 c 3 c 2 c 1 c 1 c 2 c 3 c 0 c 2 c 1 c 0 c 3 c 3 c 0 c 1 c 2 . . c 2 c 1 c 0 c 3 c 1 c 0 c 1 c 2 c 2 c 1 c 0 c 3 c 3 c 0 c 1 c 2 ]

    The inverse Wavelet Daubechies4 transform of an array X is defined by the following equation:

    Wavelet Daubechies 4 Inv { X } = C 1 * X

    where C C 1 = C 1 C = I

    The following diagram shows the Wavelet Transform Daubechies4 Inverse of a function with two spikes at the points 13 and 69. The signal length is 1024.

    Where This Node Can Run:

    Desktop OS: Windows

    FPGA: Not supported

    Recently Viewed Topics