Table Of Contents

Signal Correlation (Auto-Correlation) (G Dataflow)

Version:
    Last Modified: January 9, 2017

    Computes the auto-correlation of a signal.

    connector_pane_image
    datatype_icon

    x

    The input signal.

    This input supports the following data types.

    • Waveform
    • 1D array of waveforms
    • 1D array of double-precision, floating-point numbers
    • 1D array of complex double-precision, floating-point numbers
    • 2D array of double-precision, floating-point numbers
    datatype_icon

    normalization

    The normalization method to use to compute the auto correlation of the input signal.

    Name Description
    none

    Does not apply normalization.

    unbiased

    Applies unbiased normalization.

    biased

    Applies biased normalization.

    Default: none

    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

    Rxx

    Autocorrelation of the input signal.

    datatype_icon

    error out

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

    Algorithm for Calculating the Auto-Correlation

    The auto-correlation Rxx(t) of a function x(t) is defined as

    R x x ( t ) = x ( t ) x ( t ) = x * ( τ ) x ( t + τ ) d τ

    where the symbol denotes correlation.

    For the discrete implementation of this node, let Y represent a sequence whose indexing can be negative, let N be the number of elements in the input sequence x, and assume that the indexed elements of x that lie outside its range are equal to zero, as shown in the following relationship:

    x j = 0 , j < 0 o r j N

    Then this node obtains the elements of Y using the following formula:

    Y j = k = 0 N 1 x k * x j + k

    for j = ( N 1 ) , ( N 2 ) , ... , 1 , 0 , 1 , ... , ( N 2 ) , ( N 1 )

    The elements of the output sequence Rxx are related to the elements in the sequence Y by

    R x x i = y i ( N 1 )

    for i = 0 , 1 , 2 , ... , 2 N 2

    Notice that the number of elements in the output sequence Rxx is 2 N 1 . Because you cannot use negative numbers to index arrays, the corresponding correlation value at t = 0 is the Nth element of the output sequence Rxx. Therefore, Rxx represents the correlation values that this node shifts N times in indexing.

    How This Node Applies Unbiased Normalization

    This node applies unbiased normalization as follows:

    y j = 1 N | j | k = 0 N 1 x k * x j + k

    for j = -(N-1), -(N-2), ..., -1, 0, 1, ..., (N-2), (N-1), and

    R x x ( u n b i a s e d ) i = y i ( N 1 )

    for i = 0, 1, 2, ..., 2N-2

    How This Node Applies Biased Normalization

    This node applies biased normalization as follows:

    y j = 1 N k = 0 N 1 x k * x j + k

    for j = -(N-1), -(N-2), ..., -1, 0, 1, ..., (N-2), (N-1), and

    R x x ( b i a s e d ) i = y i ( N 1 )

    for i = 0, 1, 2, ..., 2N-2

    Where This Node Can Run:

    Desktop OS: Windows

    FPGA: Not supported


    Recently Viewed Topics