Table Of Contents

Walsh Hadamard (G Dataflow)

Last Modified: January 9, 2017

Computes the real Walsh Hadamard transform 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

Walsh-Hadamard{x}

The Walsh Hadamard transform of the input sequence.

datatype_icon

error out

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

Algorithm Definition

The Walsh Hadamard transform is based on an orthogonal system consisting of functions of only two elements -1 and 1. For the special case of n = 4, the Walsh Hadamard transform of the signal X = { x 0 , x 1 , x 2 , x 3 } can be noted in the following matrix form:

W H { X } = [ 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ] [ x 0 x 1 x 2 x 3 ]

If WHn and WHn+1 denote the Walsh Hadamard matrices of dimension 2n and 2n + 1 respectively, the rule is

W H n + 1 = [ W H n W H n W H n W H n ]

where -WHn is meant in the element wise sense.

spd-note-note
Note  

The Walsh Hadamard transform fulfills the Convolution Theorem: WH{X*Y} = WH{X}WH{Y}.

Comparing the Walsh Hadamard Transform with the Fourier transform

The Walsh Hadamard transform has similar properties to the Fourier transform, but the computational effort is considerably smaller.

The following diagram shows the Walsh Hadamard transform of a pulse pattern signal of length 256, delay 32, and width 64.

Where This Node Can Run:

Desktop OS: Windows

FPGA: Not supported


Recently Viewed Topics