Lecture # 11:

Walsh Transform:-
Walsh Transform:-
When N=2n, the discrete Walsh transform of a function f (x)
, denoted W(u), is obtained by substituting the kernel
n 1
1
g ( x, u ) 
N
 ( 
i 0
1) bi ( x ) bn 1 i ( u )
            Eq (1)

into Eq.
N 1
T (u )  
x 0
f ( x )g ( x, u )           Eq ( 2)

In other words, it can be obtained as:

n 1
1 N 1
W (u )   f ( x) (1) bi ( x )bn 1i (u )           Eq(3)
N x 0 i 0
2
Walsh Transform:-

 where bk(z) is the kth bit in the binary representation of z. for

example, if n=3 and z=6 (110 in binary), b0(z)=0, b1(z)=1,
and b2(z)=1.

 The values of g(x,u), excluding the 1/N constant, are listed in

following table for N=8.

3
Walsh Transform:-

u x 0 1 2 3 4 5 6 7
0 + + + + + + + +
1 + + + + - - - -

2 + + - - + + - -

3 + + - - - - + +

4 + - + - + - + -

5 + - + - - + - +

6 + - - + + - - +

7 + - - + - + + -

4
Walsh Transform:-

The inverse kernel is identical to the forward kernel except for a

constant multiplicative factor of 1/N; that is,

n 1
h( x, u )   (1)bi ( x )bn1i (u )               Eq (4)
i 0
Thus the inverse Walsh transform is

N 1 n 1
f ( x)  W (u ) (1) bi ( x ) bn1i ( u )
            Eq(5)
u 0 i 0

5
Walsh Transform:-

•Unlike the Fourier transform, which is based on trigonometric

terms, the Walsh transform consists of a series expansion of basis
functions whose values are +1 or –1.

•The 2-D forward and inverse Walsh transforms are given by,

n 1
1 N 1 N 1
W (u, v)    f (x, y) (1) [bi ( x ) bn 1 i ( u ) bi ( y ) bn 1 i ( v )]
      Eq(6)
N x 0 y 0 i 0

6
Example: If N=4, use of above Eq. Results in the following
sequence of steps:
1
1 3
W (0)   [ f ( x ) ( 1) bi ( x ) b1 i ( 0 ) ]
4 x 0 i 0
1
 [ f (0)  f (1)  f (2)  f (3)]
4
1
1 3
W (1)  
4 x 0
[ f ( x ) ( 1) bi ( x ) b1 i ( 0 ) ]
i 0
1
1 3
W (2)   [ f ( x ) ( 1) bi ( x ) b1 i ( 0 ) ]
4 x 0 i 0

1
 [ f (0)  f (1)  f (2)  f (3)]
4
1
1 3
W (3)   [ f ( x ) ( 1) bi ( x ) b1 i ( 0 ) ]
4 x 0 i 0

1
 [ f (0)  f (1)  f (2)  f (3)]
4
7