Table Of Contents

Inverse DCT (G Dataflow)

Version:
    Last Modified: March 15, 2017

    Computes the inverse Discrete Cosine Transform (DCT) of a sequence.

    connector_pane_image
    datatype_icon

    DCT{x}

    The real input sequence.

    This input can be a 1D or 2D array of double-precision, floating-point numbers.

    datatype_icon

    error in

    Error conditions that occur before this node runs.

    The node responds to this input according to standard error behavior.

    Standard Error Behavior

    Many nodes provide an error in input and an error out output so that the node can respond to and communicate errors that occur while code is running. The value of error in specifies whether an error occurred before the node runs. Most nodes respond to values of error in in a standard, predictable way.

    error in does not contain an error error in contains an error
    If no error occurred before the node runs, the node begins execution normally.

    If no error occurs while the node runs, it returns no error. If an error does occur while the node runs, it returns that error information as error out.

    If an error occurred before the node runs, the node does not execute. Instead, it returns the error in value as error out.

    Default: No error

    datatype_icon

    x

    The inverse DCT of the real input sequence.

    datatype_icon

    error out

    Error information.

    The node produces this output according to standard error behavior.

    Standard Error Behavior

    Many nodes provide an error in input and an error out output so that the node can respond to and communicate errors that occur while code is running. The value of error in specifies whether an error occurred before the node runs. Most nodes respond to values of error in in a standard, predictable way.

    error in does not contain an error error in contains an error
    If no error occurred before the node runs, the node begins execution normally.

    If no error occurs while the node runs, it returns no error. If an error does occur while the node runs, it returns that error information as error out.

    If an error occurred before the node runs, the node does not execute. Instead, it returns the error in value as error out.

    Algorithm Definition for 1D Inverse DCT

    If y represents a 1D array as the input sequence DCT{x}, the one-dimensional inverse Discrete Cosine Transform of y is defined as:

    x n = 2 N k = 0 N 1 α k y k cos ( 2 n + 1 ) k π 2 N

    and

    α k = { 1 2 k = 0 1 k = 1 , 2 , ... , N 1

    where

    • N is the length of DCT{x}
    • yk is the kth element of DCT{x}
    • xn is the nth element of x

    This node applies a fast inverse DCT algorithm instead of calculating the inverse Discrete Cosine Transform directly. This node implements the fast inverse DCT algorithm using an FFT-based technique.

    Algorithm Definition for 2D Inverse DCT

    If y represents a 2D array as the input sequence DCT{x}, the two-dimensional inverse Discrete Cosine Transform of y is defined as:

    x ( m , n ) = 2 M 2 N u = 0 M 1 v = 0 N 1 α u α v y ( u , v ) cos ( 2 m + 1 ) u π 2 M cos ( 2 n + 1 ) v π 2 N

    where

    • M is the number of rows of DCT{x}
    • N is the number of columns of DCT{x}
    • x(m, n) is the element of x with row number m and column number n
    • y(u, v) is the element of DCT{x} with row number u and column number v

    This node performs a two-dimensional inverse DCT using the following two steps:

    1. Perform a one-dimensional inverse DCT row-by-row on DCT{x}. The output is Y'.
    2. Perform a one-dimensional inverse DCT column-by-column on Y'. The output is x.

    Where This Node Can Run:

    Desktop OS: Windows

    FPGA: This product does not support FPGA devices


    Recently Viewed Topics