Table Of Contents

Wavelet Transform Daubechies4 (G Dataflow)

Version:
    Last Modified: January 9, 2017

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

    connector_pane_image
    datatype_icon

    x

    The input sequence.

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

    datatype_icon

    error in

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

    Default: No error

    datatype_icon

    wavelet daubechies4{x}

    The wavelet Daubechies4 transform of the input sequence.

    datatype_icon

    error out

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

    Algorithm Definition

    The Wavelet Transform Daubechies4 transform can be defined using the following transformation matrix:

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

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

    Wavelet Daubechies 4 { X } = C * X

    Where This Node Can Run:

    Desktop OS: Windows

    FPGA: Not supported


    Recently Viewed Topics