Ec8553 - Dtsp - Unit i

z
TM
TECHNICAL PUBLICATIONS - An up thrust for knowledge

TM

nput Output
digital digital
nput Analog to signal signal Digital to Output
Digital signal
analog digital analog analog
processor
signal converter converter signal
TM

TM

Fmax
Analog Antialiasing Digital

signal Sampling Quantization Encoding signal
filter
x(t) x(n)
2v log 2 q
Fs  2 Fmax Fmax
Fmax
2 Fmax
2 Fmax
1 1
2 Fmax 2B
TM

Fs
2 Fmax
Sampled
x(t) signal
Reconstructed
signal
2 Fmax
2 Fmax
x ( n Ts ) – x q ( n Ts )
x 1 (t)  cos 2 (10) t
x 2 (t)  cos 2 (50) t
x 3 (t)  cos 2 ( 90) t
x 4 (t)  cos 2 (130) t
TM

F1  10 Hz , F2  50 Hz , F3  90 Hz F4  130 Hz
x 1 (t )
1 1
x 1 ( n) x 1 (t) t  nT 
n T 
40 Fs 40
n
cos 2 10 
40
1
cos 2   n
4
x ( n)  cos 2 fn
1
f1
4
1
f
2
x 2 (t )
n
x 2 ( n) x 2 (t) t 
n cos 2 50 
40 40
5
cos 2 n
4
1
cos 2  1   n
 4
1
cos  2 n  2  n 
 4 
1
cos 2  n cos( 2  ) cos
4
x 1 ( n)
x 3 (t )
x 3 ( n) x 3 (t) t 
n
40
n
cos 2 90 
40
9
cos 2 n
4
1 1 1
cos 2  2   n cos  2  2n  2 n  cos  4 n  2 n 
 4  4   4 
TM

1
cos 2 n cos( 4n  )  cos 
4
x 1 ( n)
x 4 (t )
n
x 4 ( n) x 4 (t) t 
n cos 2 130
40 40
13
cos 2 n
4
1
cos 2  3   n
 4
1 1
cos  2  3n  2  n  cos  6n  2. n 
 4   4 
1
cos 2 n cos  2 kn     cos  k  0, 1, 2, 3,
4
x 1 ( n)
x 1 ( n)  x 2 ( n)  x 3 ( n)  x 4 ( n) f 2 , f 3 and f 4
1
2
f 2 , f 3 and f 4 f1
x a (t) A cos( t  )
A cos( 2  F t  )  2f
A cos( n  )
A cos( 2  f n  )  2f
TM

x a (t) t  nT A cos(2  F t   t  nT
A cos( 2  F n T  )
 1  1
A cos  2  F n    Fs
 Fs  T
 F 
A cos  2  n   
 Fs 
F
 FT or 
Fs 

 
 T
Fs
Fs  2 Fmax
Fmax 1 1
  f max 
Fs 2 2
1 1
–  f max  
2 2 

–    max   since   2  f 
TM

x(t)
CT signal
x(n)
DT signal
0 1 2 3 4 5 n
x (n  N)
A cos( 2  f 0 n)
x (n  N) A cos[ 2  f 0 ( n  N )]
A cos( 2  f 0 n  2 f 0 N )
x (n  N) 2  f0 N 2
2  f0 N 2 k
k
 f0
N
 k 
0 2  
N 

0 
2 f0 

TM

N1
N2
N1
N2
x ( n)

2
E  x (n)
n – 
x ( n)
N
1 2
2 N  1 n 
P lim x ( n)
N  –N
x ( n) x (– n)
x (– n) – x ( n)
x ( n)  x (– n)
x e ( n)
2
x ( n) – x (– n)
x o ( n)
2
x ( n) n
x ( n) an n 0
TM

x ( n) {10, 2, 15, 20}  0th

x ( n)  n
x ( n) an –   n 
x ( n) {5, 7 , 20, 3, 5}  0th


n  n 
cos ( 0.01  n) cos ( 3  n) sin ( 3n) cos   cos  
8  8 
' f'
k
f
N
cos ( 0.01  n)
 0.01 

  2 f f
2
0.01  1
 f
2 200
k  1 and N  200 'f'

N  200
cos 3  n
 3
f   3
2 2
k 3
f 
N 2
TM

sin ( 3 n)
 3
f  3
2 2
k 3  Integer
 f 
N 2   Not an integer
'f'
n  n
cos   cos  
8
   8 
1 
1 2 
8 8
1 1/8 1  Integer
 f1 
2 2  16   Not an integer
n
cos  
8
2 / 8 1
f2
2 2 16
n 
cos  
 8 
n  n 
cos   cos  
8  8 
 1 n
  n 0
 4 
 ( 2) n n 0

  n 
1
|x(n)|2   4    (2)n
n   n 0 n  1
 n   n  n
1 1 1
  4    (2)  n   4     
2
n 0 n 1 n 0 n 1
TM

 1 1
2
1
3  1  1  2 1
3 
1                  
 4   4
4   2  2  2 
 1  1 2  1  3  1  1  1 2 
1           1      
 4  4   4   2  2  2  
1
1A
1 1 1 7
 
1 2 1 3
1 1
4 2
 1 for n  0
 ( n) 
 0 for n  0
(n)
 ( n) {... 0, 0, 0, 1 , 0, 0, 0 ...} 1

 ( n) –2 –1 0 1 2 n
(n )

 x (n)  n – n 0 ) x (n 0 )
n – 
x ( n)  ( n – k) x ( k)  ( n – k)
x ( n)  ( n) x ( 0)  ( n)
 ( an)  ( n)
x( n)  ( n) x ( n)
TM

 1 for n  0
u ( n)  u(n)
 0 for n 0 1
{ 0, 0, 1 , 1, 1, 1 ...} 0 1 2 3 4 n

{1 , 1, 1, 1 ...} u (n )

u ( n) – u ( n – 1)  ( n)

u ( n)   ( k)
k–
r(n)
3
 n for n  0 2
r ( n)  1
 0 for n  0
0 1 2 3 n
n u ( n) { 0 , 1, 2, 3 ...}

r (n )
r ( n) – r ( n – 1) u ( n)
x ( n) an
an
0a1
x ( n) an r e j -2 -1 0 1 2 3 4 n
[ r e j ]n an
r n e j n
TM

e j cos   j sin 
x ( n) r n [cos n  j sin  n ]
r n cos n  j r n sin n
real part imaginary part
x ( n) A cos( 0 n  )
j(  0 n   )
e  e – j ( 0 n  )
A
2
A j 0 n j A – j  0 n – j 
e e  e e
2 2
x(n) x(n  1) x(n  1)
2 3 1
n n n
0 1 3 0 1 2 4 1 0 2
(a) Original sequence (b) Delay by (c) Advance by

one sample one sample
x ( n – 1)
x ( n  1)
x ( n) x (– n)
TM

x(n)
x( 0) x( 0)
2
x(1) x(– 1) n
0 1 3
x(n)
x( 2) x(– 2)
2
n
3 1 0
x ( n) y ( n) x ( 2 n)
y ( 0) x( 0) y (1) x( 2) y ( 2) x( 4)
y ( n) x ( 2 n)
y ( 0) x( 0) y ( 2) x(1) x( 4) x( 2)
x(n)
1 2 3
n
0 4 5 y(n) = x(n/2)
y(n) = x(2n) 2 4 6
0 1 3 5 7 8 9 10 n
1
n
0 2 3 4 5
x ( n) y ( n) 2 x ( n)
x ( n)
y ( n) x 1 ( n)  x 2 ( n) x 1 ( n) x 2 ( n)
y ( n) x 1 ( n) – x 2 ( n) x 1 ( n) x 2 ( n)
TM



15 x 2 ( n)  6 x ( n) 

1
x( n)  
x ( n  1)
T {a 1 x 1 ( n)  a 2 x 2 ( n)} a 1 T { x 1 ( n)}  a 2 T { x 2 ( n)}

Linear combination Linear combination of outputs
of inputs
TM


a n u ( n)

1

x ( n)
y ( n)  x ( n)  x ( n  1)
y ( n)  n x ( n)
y ( n)  x (  n) y ( n)  x ( n) cos  0 n
TM

y ( n)  x ( n)  x ( n  1)
y ( n) T x  n   x ( n)  x ( n  1)
y ( n , k) T x  n  k 
x  n  k   x  n  k  1
y ( n) k
y ( n – k ) = x ( n – k ) – x ( n – k – 1)
Replace 'n' by
n–k
y ( n , k) y ( n  k)
y ( n)  n x ( n)
y ( n) T x  n   n x ( n)
x ( n) k
y ( n , k) T x  n  k  n x ( n  k)
x ( n)
n  k  y ( n)
k
y(n–k )= ( n–k )x(n–k )
Replace 'n' by
n–k
y ( n , k)  y ( n  k)
y ( n)  x (  n)
y ( n) T x n  x (  n)
TM

x ( n) k y ( n)
x (  n) x (  n) k
y ( n , k) T x  n  k 
x   n  k 
x (  n  k)
nk
x ( n) ; x (  n)
y ( n) k
y ( n  k) x   n  k 
x (  n  k)
y ( n) n nk
y ( n)
y ( n , k)  y ( n  k)
y ( n)  x ( n) cos  0 n
y ( n) T x n  x ( n) cos  0 n
x ( n  k)
y ( n , k) x ( n  k) cos  0 n
' n' cos  0 n ( n  k) ' cos  0 n'

y ( n) ' k'
y ( n  k) x ( n  k) cos  0 ( n  k)
' n' ( n  k) x ( n) and cos  0 n

y ( n)
y ( n , k)  y ( n  k)
TM

y ( n)  x ( n 2 )
y ( n)  x 2 ( n) y ( n)  x( n) 2
1 N 1
N m
x( n – m)
0
y ( n)  x ( n 2 )
x 1 ( n) and x 2 ( n)
y 1 ( n) 2
x 1 (n )
y 2 ( n) x 2 (n 2 )
x 1 ( n) and x 2 ( n)
y 3 ( n) T a 1 x 1 ( n)  a 2 x 2 ( n) 
y( n)  x( n 2 ) y 3 ( n)
a 1 x 1 (n 2 )  a 2 x 2 (n 2 )
y 3 ( n) a 1 y 1 ( n)  a 2 y 2 ( n)
y 3 ( n) a 1 x 1 (n 2 )  a 2 x 2 (n 2 )
y 3 ( n) y 3 ( n)
y ( n) x 2 ( n)
x 1 ( n) and x 2 ( n)
y 1 ( n) x 12 ( n)
y 2 ( n) x 22 ( n)
TM

x 1 ( n) and x 2 ( n)
y 3 ( n) T a 1 x 1 ( n)  a 2 x 2 ( n)
a 1 x 1 ( n)  a 2 x 2 ( n) 2 y ( n)  x 2 ( n)
a 12 x 12 ( n)  2a 1 a 2 x 1 ( n) x 2 ( n)  a 22 x 22 ( n)
y 3 ( n) a 1 x 12 ( n)  a 2 x 22 ( n)
y 3 ( n)  y 3 ( n)
y (n )  n x (n )
y 1 ( n) n x 1 ( n)
y 2 ( n) n x 2 ( n)
T  a 1 x 1 ( n)  a 2 x 2 ( n) 
n  a 1 x 1 ( n)  a 2 x 2 ( n) 
n a 1 x 1 ( n)  n a 2 x 2 ( n)
y 3 ( n) a 1 y 1 ( n)  a 2 y 2 ( n)
a 1 n x 1 ( n) a 2 n x 2 ( n)
y 3 ( n)  y 3 ( n)
N 1
1
N  x (n – m )
m 0
1 N 1
N m
y 1 ( n) T { x 1 ( n)} x 1 ( n – m)
0
1 N 1
N m
y 2 ( n) T { x 2 ( n)} x 2 ( n – m)
0
N 1
1
T  a 1 x 1 ( n)  a 2 x 2 ( n)  N  a 1x 1 (n – m)  a 2 x 2 (n – m)
m 0
TM

N 1
1 1 N 1
y 3 ( n) a 1 y 1 ( n)  a 2 y 2 ( n)
N  x 1 ( n – m)  a 2 
N m
x 2 ( n – m)
m 0 0
y 3 ( n)  y 3 ( n)
y ( n) x ( n)  x ( n  1)
y ( n) x ( n) and x ( n  1) x ( n) x ( n  1)
y ( n) x ( n)  x ( n  1)
y ( n) x ( n) and x ( n  1) x ( n) x ( n  1)
y ( n) x ( 2n)
n  1  y (1)  x ( 2)
n  2 y ( 2)  x ( 4)
y ( n)
y ( n) log 10  x ( n) 
y 3 ( n) T a 1 x 1 ( n)  a 2 x 2 ( n)
y 3 ( n) log 10  a 1 x 1 ( n)  a 2 x 2 ( n) 
y 1 ( n) log 10  x 1 ( n) 
y 2 ( n) log 10  x 2 ( n) 
TM

y 3 ( n) a 1 log 10  x 1 ( n)   a 2 log 10  x 2 ( n) 
y 3 ( n)  y 3 ( n)

y ( n) x ( n)  h ( n)  x ( k) h ( n – k)
k–
x ( n) h ( n)
h ( k) k h (– k)
h (– k) n h ( n – k)
x ( k) h ( n – k)
x ( k)  h ( n – k) k
y ( n)
x ( n)  h ( n) h ( n)  x ( n)

y ( n)  x ( k) h ( n – k) x ( n)  h ( n)
k–
m n– k k n– m

y ( n)  x (n – m) h (n)
m – 
m k

y ( n)  x ( n – k) h ( k) h ( n)  x ( n)
k–
[ x ( n)  h 1 ( n)]  h 2 ( n) x ( n)  [ h 1 ( n)  h 2 ( n)]
TM

y1(n)
y ( n) y 1 ( n)  h 2 ( n) x(n) h1(n) h2(n) y(n)

 y 1 ( k) h 2 ( n – k)
k–

y 1 ( n) x( n)  h 1 ( n)  x ( p) h 1 ( n – p)
p – 

y 1 ( k) x( k)  h 1 ( k)  x ( p) h 1 ( k – p)
p – 
y 1 ( k)
 
y( n)   x ( p ) h 1 ( k – p )  h 2 ( n – k)
k  –  p– 
k–p l
 
y ( n)   x (p) h 1 (l)  h 2 (n – p – l)
l –  p – 
    
 x(p)   h 1 (l) h 2 [(n – p) – l]  x(p)  h(n – p) x( n)  h( n)
p –  l  –   p – 
Linear Convolution of
h 1(n) and h 2 (n) at n – p

h( n – p)  h 1 (l)  h 2 [(n – p) – l]
l–

h( n)  h 1 (n)  h 2 (n – l) h 1 ( n)  h 2 ( n)
l–
y 1 ( n) x( n)  h 1 ( n) y( n) y 1 ( n)  h 2 ( n)
 y( n) [ x( n)  h 1 ( n)]  h 2 ( n)
y( n) x( n)  h( n) x( n)  [ h 1 ( n)  h 2 ( n)]
x( n)  h 1 ( n)  x( n)  h 2 ( n) x( n)  {h 1 ( n)  h 2 ( n)}
TM

y1(n)
h1(n)
y( n) y 1 ( n)  y 2 ( n)
x(n) + y(n)
x( n)  h 1 ( n)  x( n)  h 2 ( n)
  h2(n)
 x(k) h 1 (n – k)   x(k) h 2 (n – k)
y2(n)
k– k–
 
 x(k) [h 1 (n – k)  h 2 (n – k)]  x(k) h (n – k) x( n)  h( n)
k– Sum of h1( n) and h2 ( n) k–
h ( n – k) h 1 ( n – k)  h 2 ( n – k)
h( n) h 1 ( n)  h 2 ( n)
y( n) x( n)  [ h 1 ( n)  h 2 ( n)]
x(t – t 0 )  h(t) x(t)  h(t – t 0 )

y  n  x k  h n – k 
k– 
x(k)
1

y  0  x ( k) h  – k  (0×2)
0 1 2 3 k
k –  h(–k) (1×2)
2 2 Folded
sequence
–1 0 1 2 3 k
x k  h  –k 
y  0  x  k  h  – k   0  2  1  2  1  0  1  0  1  0
over all k
02000 2

y1  x  k  h 1–k 
k– 
TM

x(k)
1
h1– k   h – k–1 h – k 
1 – k  (1×2) 0 1 2
h(1–k)
3
(1×2)
k
h1  k 
2
 y 1  xk h1 – k  1  2  1  2  1  0  1  0 0 1 k

over all k
2200  4 xk h 1 – k

y  2  x k  h 2 – k 
k – 
h  2 – k   h– k – 2
x(k)
h – k  1
(1×2) 0 1 2 3 k
y  2  x  k  h  2 – k   1  0  1  2  1  2  1  0 h(2–k) (1×2)
over all k 2
0220  4
 0 1 2 3 k
y 3  x k  h 3 – k 
k– 
x k and h  2 – k
x(k)
1
0 1 2 3 k
h(3–k)
2
 y  3  x  k  h  3–k 
over all k
k
1  0  (1  0)  1  2  1  2  2  2  4 0 1 2 3
x k and h  3 – k
 x(k)
y  4  x k h 4 – k 1
k  –
0 1 2 3 k
h(4–k) (0×2)
x  k  and h  4 – k  2
 y 4  x k  h 4 – k  0 1 2 3 4 k
over all k
1  0  1  0  1  0  1  2  0  2
xk and h 4 – k
TM

000 20 
y n 2, 4, 4, 4, 2

x ( n) h ( n)
y ( n) M  N 1
M4 N2 y ( n) 4  2 1  5
y ( n)
x ( n) and h ( n)
x ( n)  1, 1, 0, 1, 1

h ( n)  1,  2,  3, 4 

y ( n) x ( n) * h ( n)
x ( n) 
 h ( n)
2 35  y ( n)
y ( n) 1,  1,  5, 2, 3,  5, 1, 4

TM


x(n)  1 1 0 1 1
h(n)   1 –2 –3 4 0
 4×1=4
Multiplication
of x(n) & h(n) 4 4 0 4 4 ‘4’ multiplies samples in x(n)
–3 –3 0 –3 –3 x This digit is marked zero or

left as usual in multiplication.
‘–3’ multiplies samples in x(n)
–2 –2 0 –2 –2 x x
These two digits are considered
zero as usual in multiplication.
1 1 0 1 1 x x x ‘–2’ multiplies samples in x(n)

These three digits are considered
zero as usual in multiplication.
‘1’ multiplies samples in x(n)
x(n) * h(n) 1 –1 –5 2 3 –5 1 4 These values are obtained by
 adding all digits in their respective
Total digits before  are columns. ‘x’ are considered as zeros.
equal to sum of digits in
x(n) & h(n) before  . i.e.
2 + 3 = 5 digits.
Linear shift
x(n) y(n)
invariant system
y ( n) x ( n) * h ( n)
h ( n) x ( n)  ( n)
y ( n)  ( n) * h ( n)
h ( n)
(n) h (n)
h (n )
h ( n) n 0
TM


y ( n)  h ( k) x ( n  k)
k
1 
 h ( k) x ( n  k )   h ( k) x ( n  k)
k k0
... h ( 2) x ( n  2)  h ( 1) x ( n  1)  h ( 0) x ( n)  h (1) x ( n  1)  ...

Depends upon future Present input Depends upon
values of input past inputs
... h ( 2) h ( 1)
h ( n) h 0
h (n )

y ( n)  x ( k) h ( n  k)
k

y ( n)  x ( k) h ( n  k)
k

y ( n)   h ( k) x ( n  k)
k
Mx

y ( n)  Mx  h ( k)
k
TM


 h ( k) 
k
h ( n)
 a n , n  0 and n even
h( n) 
 0 otherwise

 h ( k) 
k
h ( n)
 
 h ( n)  an 1  a 2  a 4  a 6  ...........
n   n 0
n even
2 3
1 |a 2 |  a 2  a2 .......
1
|a 2 | 1
1 |a 2 |
|a 2 | 1
h ( n) a n u ( n) and |a| 1

y n  x k  h  n – k 
k– 

 h  k  x n – k 
k– 
x( n)  u( n) x n – k  u n – k 

y  n  h k  u n – k 
k– 
u n – k  n k n – k   0 –  k  n
TM

n n
y  n  x k   a k u k 
k–  k– 
k 0
n
y  n ak
k0
N aN 1 – 1
Ak 
a –1
k0
a n 1 – 1
y  n
a –1
z
z x (n)

X ( z)  x (n) z n
n  
z
z z
z X 1 ( z)
x 1 ( n)  z X 2 ( z)
x 2 ( n) 
z a 1X 1 ( z)  a 2 X 2 ( z)
a 1 x ( n)  a 2 x 2 ( n) 
z X( z)
x( n) 
z z  k X( z)
x ( n  k) 

Z {x ( n  k)}  x ( n  k) z  n
n  
nk m n km
 
z {x ( n  k)}  x (m) z ( k  m)  x (m) z  k z m
m   m  
TM


z k  x (m) z m z  k X ( z)
m  
z z X ( z)
x ( n) 
z
z X  
a n x ( n) 
a
 
Z {a n x( n)}  [a n x (n)] z n  x (n) (a 1z) n
n   n  
z
X ( a 1 z) X  
a
z X ( z)
x ( n)  z X ( z 1 )
x (  n) 
z z X ( z)
x ( n) 
d
z  z
n x ( n)  X ( z)
dz
z X 1 ( z)
x 1 ( n)  z X 2 ( z)
x 2 ( n) 
z X 1 ( z)  X 2 ( z)
x 1 ( n) * x 2 ( n) 

x 1 ( n) * x 2 ( n)  x 1 ( k) x 2 ( n  k)
k
   
Z {x 1 ( n) * x 2 ( n)}    x 1 ( k) x 2 ( n  k)  z  n
n    k    
   
n 
Z {x 1 ( n) * x 2 ( n)}  1   2
x ( k ) x ( n  k ) z 
k n    

 x 2 ( n  k) z  n z  k X 2 ( z)
n  

Z {x 1 ( n) * x 2 ( n)}  x 1 ( k) z  k  X 2 ( z)
k
TM

  
k 
  x 1 ( k) z  X 2 ( z)
 k    
This is z transform
of x1( k )
X 1 ( k)  X 2 ( k)
z X 1 ( z)
x 1 ( n)  z X 2 ( z)
x 2 ( n) 

 x 1 (n) x 2 (n  l) z X 1 (z) X 2 (z 1 )
n  
z z X 1 ( z)
x 1 ( n) 
z X 2 ( z)
x 2 ( n) 
1 z
z X () X 2    1 d
2j c 1
x 1 ( n)  x 2 ( n) 

 
z X ( z)
x ( n) 
z X * ( z *)
x * ( n) 
z X 1 ( z)
x 1 ( n)  z X 2 ( z)
x 2 ( n) 
 1  1  1
 x 1 (n) x 2 * (n) 
2j c
X 1 () X 2*    d
 * 
n  
z X ( z)
x ( n) 
x( 0) lim X( z)
z
z X ( z)
x ( n) 
x( ) lim (1  z 1 ) X( z)
z1
z
x 1 ( n)
x 2 ( n) { 1, 2, 3, 4 , 5, 0, 7 }

 ( n)
u ( n)
x 1 ( n)
 6
X 1 ( z)  x (n) z n  x 1 (n) z n
n   n 0
TM

x( 0) x(1) x( 2) x( 3) x( 4) x(5) x( 6)
 X 1 ( z) 1  2z 1  3z 2  4 z 3  5z  4  0z 5  7 z  6
2 3 4 5 7
1    
z z2 z 3 z4 z6
X 1 ( z) z z z
x 2 ( n) {1 , 2, 3, 4 , 5, 0, 7 }

x 2 (  3) x 2 (  2) x 2 (  1) x 2 ( 0) x 2 (1) x 2 ( 2) x 2 ( 3)
 3
 X 2 ( z)  x (n) z n  x 2 (n) z n
n   n  3
1  z 3  2z 2  3z  4 z 0  5z 1  0z 2  7 z 3
5 7
z 3  2z 2  3z  4  
z z3
X 2 ( z) z z 
z z 
 ( n)
 
X ( z)  x (n) z n   (n) z n
n   n 0
 ( n)
X ( z) 1 z 0
z z
u ( n)
 
X ( z)  x (n) z n  u (n) z n
n   n  
u ( n) n 
 
X ( z)  1  z n  (z 1 )n
n 0 n 0
1  ( z 1 ) 1  ( z 1 ) 2  ( z 1 ) 3  ( z 1 ) 4 ....
1
1  A  A 2  A 3  ... A 1
1A
TM

1
X ( z) z 1  1
1z 1
z 1  1 z 1 z 1
z 1 z
z a nu ( n)  a nu (  n  1)
x ( n) a n u ( n)
 
X ( z)  x (n) z n  a n u (n) z n
n   n  
u ( n) 0 n 
 
X ( z)  a n z n  (a z 1 )n
n 0 n 0
1  ( a z 1 ) 1  ( a z 1 ) 2  ( a z 1 ) 3  ( a z 1 ) 4  ....
1
1  A  A 2  A 3  A 4  ... A 1
1A
1
X ( z) a z 1  1
1  a z 1
a z 1  z  a
1
 X ( z) z  a
1  a z 1
a
x ( n)  a n u (  n  1)
 
X ( z)  x (n) z n   a nu ( n  1) z n
n   n  
 a nu (  n  1)  an    n  1
1
 X ( z)   a n z n
n  
TM

1 
 l X ( z)   a l z l   ( a  l z) l
l l1
 {( a 1 z)  ( a 1 z) 2  ( a 1 z) 3  ( a 1 z) 4  ...}
 ( a 1 z) {1  ( a 1 z)  ( a 1 z) 2  ( a 1 z) 3  ...}
1
1  A  A 2  A 3  ... A 1
1A
1
X ( z)  ( a 1 z)  a 1 z  1
1a 1
z
1
a 1 z  1 z  a
1  a 1 z
a 1 z  1 z  a
x ( n) 3  4 n   4 2n  u (n)
1
a n u ( n) z
 | z||a|
1  a z 1
n 1
 4 u ( n) z
 | z| 4
1  4 z 1
1
2n u ( n) z
 | z| 2
1  2 z 1
X ( z) 3Z 4n u (n) 4 Z 2n u (n)

3 4
 | z| 4
14 z 1 1  2 z 1
| z| 4 | z| 2 | z| 4
TM

z
z h (n)

H ( z)  h (n) z n
n  

 H ( z)  h (n) z n
n  

  h ( n) z n
n  
H (z) z n z

 H ( z)   h ( n)
n  

 h (n)  
n  

H ( z)   h ( n)  
n  
z z
H (z)
r z r
z r z 1
r
H ( z)
TM

Y( z) – z –1Y( z) X( z)  z –1X( z)

 Y( z) 1 – z –1  
X ( z ) 1  z –1 
Y( z) 1  z –1 1 1
   z –1
X ( z) 1 – z –1 1– z –1 1– z –1
1
z

1 – z –1
z

 z kX ( z)
x ( n)

X ( )  x (n) e  j  n
n  
1 
X ( ) e j  n d 
2   
x ( n)
x ( n) a n u ( n) for  1  a  1
  
 a e  j 
n
X ( )  x ( n) e  jn  a n e  jn
n   n 0 n 0
a e  j  |a|  1
1
X ( )
1 a ej
TM

x ( n) u ( n) x ( n)  ( n)
x ( n) u ( n)
x ( n) n 0
 
X ( )  x ( n) e  jn  1  e  jn
n   n 0

 e  j 
n
n 0
N2
a N1  a N2  1
 ak
1a
k  N1
X ( )
 e  j     e  j 
0 
X ( )
1  e  j
1
1  e  j
x ( n)  ( n)
 1 for n  0
 ( n) 
 0 for n  0

X ( )  x ( n) e  jn 1 e0 
n  
X ( ) for  c     c
for  c  ||  
TM

 c
1 1
x ( n)  X ( ) e jn d  1  e jn d
2 2
  c
c 
1  e jn  1  e j cn  e  j cn 

2  jn   2  jn 

 c 
1  e j cn  e  j cn 
n  2j 


1
x ( n) sin ( c n) n0
n
n0
c c
1 1 1 c c
x ( 0)  e 0 d  d    c
2 2 2 
 c  c
x ( n)
 c 
  for n0

x ( n)  
sin  c n
 for n0 
 n 

X ( )  x (n) e  j  n
n  
 2 X ( )
2
 2
2  j kn 2
X  k  x (n) e N k 0, 1, .... , N  1  k
N  n  
N
N 2 k
TM

x ( n) X ( )
N
x ( n) N
x ( n) X ( )
N 1 2
2  j kn
X  k  x (n) e N k 0, 1, ... , N  1
N  n 0
2
k X   k  X ( k)
N 
N 1
X ( k)  x (n) e  j 2 kn/ N k 0, 1, ... , N  1
n 0
1 N 1
x ( n)
N  X (k) e j 2 kn/ N n 0, 1, ... , N  1
k0
2
  k
N
2 
X  k x p ( n)
N 
x p ( n) x( n)

x p ( n)  x( n  l N )
l
x( n) x p ( n) x( n)
 2 
X( )   2  k X k X ( k) x( n)
N  N 
x( n)
TM

 N 1
X( )  x(n) e  j  n X( k )  x(n) e  j 2 kn/ N
n   n 0
X( )  X( k )
x(n) x(n)
x ( n)

X ( z)  x ( n) z n
n  
X ( z)
zk e j 2 k / N k  0, 1, ........ N

X ( z) zk  e j 2  k  x ( n) e  j 2  kn/ N
n  
x ( n)
N1
X ( z) zk  e j 2 k / N  x ( n) e  j 2  kn/ N
n 0
TM

X ( k)
X ( k) X ( z) zk  e j 2 k / N
x p ( n)
N1
1
c ( k)
N  x p ( n) e  j 2  kn/ N k  0, 1, ..... N  1
n 0
x ( n) DFT
N
 X ( k)
x p ( n) DFT
N
 X ( k)
x p ( n) x ( n) x ( n) x p ( n)
X ( k)
N1
X ( k)  x ( n) e  j 2  kn/ N k  0, 1, N 1
n 0
x ( n) and x p ( n)
N1
X ( k)  x p ( n) e  j 2  kn/ N , k  0, 1, .... N  1
n 0
1
c ( k)  X ( k), k  0, 1, N 1
N
X ( k) N  c ( k), k  0, 1, N 1
TM

N1
1
x ( n)
N  X ( k) e j 2  kn/ N , n  0, 1, .... N  1
k0
1
c ( k)  X ( k)
N
N1
x ( n)  c ( k) e j 2  kn/ N , n  0, 1, N 1
k0
x ( n)
WN e  j 2/ N
N1
X ( k)  x ( n) W Nkn , k  0, 1, ...... N  1
n 0
N1
1
x ( n)
N  X ( k) W N kn , n  0, 1, ..... N  1
k0
e  j 2/ N  W N
x ( n) xN
n  0  x ( 0) 
n  1  x (1) 
xN  
: :
 
:  : 
n  N  1 x ( N  1)  N  1
X ( k) XN
k  0  X ( 0) 
k  1  X (1) 
 
XN : :
 
:  : 
k  N 1 X ( N  1) 
N 1
TM

W Nkn W N  NN
n0 n1
 W kn 0 kn 0
k0  N k  0, n  0,  W N WN
k  0, n  1,
 WN
 kn 0 kn 1
k  1  WN  WN WN  WN
k  1, n  0, k  1, n  1,
 kn 0 kn 2
WN  k  2  W N k  2, n  0,  W N WN
k  2, n  1,
 WN

 : :
 : :
 kn 0 kn N 1
k  N  1 W N  WN WN  WN
 k  N  1, n  0, k  N  1, n  1,
n2 n  N1
W Nkn  W N0 W Nkn  W N0 
k  0, n  2, k  0 , n  N  1, 
W Nkn  W N2 W Nkn  W N 1 
k  1, n  2 , k  1, n  N  1, N 
2 ( N  1) 
W Nkn  W N4 WN kn  W
N 
k  2, n  2, k  2 , n  N  1,

2 ( N  1) ( N  1) ( N  1) 
W Nkn  WN W Nkn  W
N 
k  N  1, n  2 , k  N  1, n  N  1, N  N
W 0 W N0 W N0 ... W N0 
 N0 
W N W N1 W N2 ... W NN  1 
 Wn  W 0 W N2 W N4 ... WN
2 ( N 1) 
 N 
 : : : ... : 
W 0 W NN  1
2 ( N  1)
WN ...
( N  1) ( N  1) 
WN
 N N N
W Nkn ' k' ' n'
XN W N  x N
xN
1
N
 
W N* X N
W Nkn  W N  W N*   W N kn
TM

WN
WN N8 WN
2
j
WN e 
N8
2 
j j
W8 e 8  e 4
W 80 , W 81 , W 82 , , W 815

j  kn
kn W8kn  e 4
W80  e 0
j

1 j
 
W81  e 4 e 4 
4
j

2 j
 
W82  e 4 e 2 
2
j

3 j
3 3
W83  e 4 e 4 
4
 
j 4
W84  e 4  e j 
j

5 j
5 5
W85  e 4 e 4 
4
j

6 j
3 3
W86  e 4 e 2 
2
j

7 j
7 7
W87  e 4 e 4 
4
 2
j 8
W88  e 4  e j 2
2
 W88  W80
  
 j  2    
j 9 4   2  
W89  e 4 e 
 4


4
 W89  W81
  
 j  2    
j  10 2   2  
W810  e 4 e 
 2


2
 W810  W82
TM

j

 11

 j  2 
3 
 W811  W83
4 
W811 e 4  e 

j  12 W812  W84
W812  e 4  e  j 2  
j

 13

 j  2 
5 
 W813  W85
4 
W813  e 4 e 
WN N 8
W 81
 
j 1 j
W 81 e 4  e 4 ej Angle

 W 8kn
4
WN
Imaginary part of WN
6 14
W8 = W8 .... = j
5 13
W8 = W8 ..... 7 1
+ j 1
15
=– 1 +j 1 W8 = W8 ..... =
2 2
2 2
Unit circle
Real
part of WN
4 12
–
0 8
W8 = W8 .... = –1 W8 = W8 .... = 1
4
3 11 1 9 1 –j 1
W8 = W8 ..... W8 = W8 ..... =
2 2
=– 1 –j 1
2 2
2 10
W8 = W8 .... = –j
W Nkn WN
TM

 
W 81 W 89  ....  cos  j sin
4 4
1 1
j
2 2
[W 4 ]
N4 W 40 , W 41 , W 42 and W 43
WN
Imaginary part of WN
3 7 11
W4 = j = W4 = W4
Real
part of WN
2
W4 = –1 0 4
W4 = 1 = W4
6 10
= W4 = W4 8
= W4
1 5 9
W4 = – j = W4 = W4
W 4kn
W 43
2 3
j 3 j
W 43 e 4  e 2
3

2
3
j 3 3
W 43 e 2  cos  j sin j
2 2
TM

W 4  44
n  0 n 1 n  2 n  3
k0 W 0 W 40 W 40 W 40 
 40 
k 1 W 4 W 41 W 42 W 43 
W 4  
k  2 W 40 W 42 W 44 W 46 
 
k  3 W 0 W 43 W 46 W 49 
 4
W 4kn k0 n0
1 1 1 1 
1  j 1 j
W 4   
1 1 1 1 
1 j 1  j

N–1 – j 2 nk
 x( n) e N
n 0
1 – j 2 nk
 x(n) e 2
n 0
x( 0) e 0  x(1) e – jk
x( n)
e – jk e – jk
 1 1 e0
 1e –j e – j  – 1
TM

x( n)
N–1 – j 2 nk
 x( n) e N
n 0
1 – j 2 nk
 x( n) e 2
n 0
x( 0) e 0 x(1) e – jk
1  2 e – jk
x( 0) 1 2e0
1  2 e – j
N–1 – j 2 nk
 x( n) e N
n 0
3 – j 2 nk
 x( n) e 4
n 0
– j 2 k  j 4 k – j 6 k
x( 0) e 0  x(1) e 4  x ( 2) e 4  x( 3) e 4
x( n)
– jk – j 3 k
12e 2  3 e – jk  4 e 2
 e0 e0 e0
TM

 1  2 e – j / 2  3 e – j  4 e – j 3  / 2
X( 2) 1  2 e – j  3 e – j 2   4 e – j
– j 3 / 2 – j 3 – j 9 / 2
X ( 3) 12e 3e 4e
1  2j – 3 – 4 j
10, –2  2 j , –2, –2 – 2 j
1 1 1 1
1 – j – 1 j 
W 4k  
1 – 1 1 – 1
1 j – 1 – j 
 
x N  W Nk
1 1 1 1
1 – j – 1 j 
1 2 3 4   
1 – 1 1 – 1
1 j – 1 – j 
 
 1234   10 
1 – 2 j – 3  4 j  – 2  2 j 
   
 1– 23– 4   –2 
1  2 j – 3 – 4 j  – 2 – 2 j 
   
10 –2  2 j –2 –2 – 2 j
N–1 – j 2 nk
1
N  X ( k) e N
k0
N–1 – j 2 nk
1
N  X ( k) W N
*k k
WN e N
k0
TM

1 k
x ( n) X W N
N k
1 
x( n) X  W Nk
N k
X k [10, –2  2 j , –2, –2  2 j ]
1 1 1 1 4  1 
1 1 j 1 j  1 8 2 
[10 – 2 – 2 j – 2 – 2  2 j ]      
4 1 1 1 1  4 12 3 
1 j 1  j  16 4 
    
x ( n) 1 , 1 , 1 , 1
X ( k)
x ( n)
x ( n) 1 , 1 , 1 , 1 , 0 , 0 , 0 , 0 
N 1
X ( k)  x ( n) W Nkn , k  0 , 1 , .... N  1
n 0
7
X ( k)  x ( n) W 8kn , k  0 , 1 , .... 7
n 0
XN W N  x N
N  8 X8 W 8  x 8
TM

X ( 0)  x ( 0)  1 
X (1)   x (1)  1 
     
X ( 2)  x ( 2)  1 
X ( 3)  x ( 3)  1 
X8   x8     
X ( 4)  x ( 4)  0
X (5)   x (5)  0
     
X ( 6)  x ( 6)  0
X (7)  x (7)  0
8 8 W 8 
W 0 W 80 W 80 W 80 W 80 W 80 W 80 W 80 
 80 
W 8 W 81 W 82 W 83 W 84 W 85 W 86 W 87 
W 0 W 82 W 84 W 86 W 88 W 810 W 812 W 814 
 80 
W 8 W 83 W 86 W 89 W 812 W 815 W 818 W 821 
W 8  W 0 W 84 W 88 W 812 W 816 W 820 W 824 W 828 
 80 
W 8 W 85 W 810 W 815 W 820 W 825 W 830 W 835 
W 0 W 86 W 812 W 818 W 824 W 830 W 836 W 842 
 8 
W 80 W 87 W 814 W 821 W 828 W 835 W 842 W 849 
W Nkn N8
W 80  W 88  W 816  W 824  W 832  W 840  1
1 1
W 81  W 89  W 817  W 825  W 833  W 841  W 849   j
2 2
W 82  W 810  W 818  W 826  W 834  W 842  ....   j
1 1
W 83  W 811  W 819  W 827  W 835  W 843  ....   j
2 2
W 84  W 812  W 820  W 828  W 836  W 844  ....   1
1 1
W 85  W 813  W 821  W 829  W 837  W 845  ....   j
2 2
W 86  W 814  W 822  W 830  W 838  W 846  ....  j

1 1
W 87  W 815  W 823  W 831  W 839  W 847  ....  j
2 2
TM

X8
X8 W 8  x 8
1 
X ( 0)  1 1 1 1 1 1 1 1   
X (1)   1 1 1 1 1 1 1 1  1 
  1 j j  j 1  j j j
2 2 2 2 2 2 2 2   
X ( 2)  1 j 1 j 1 j 1 j  1 
    
X ( 3)  1  1  j 1 1 1 1 1 1 1 
j j 1 j j  j  1 
   2 2 2 2 2 2 2 2
  
X ( 4)  1 1 1 1 1 1 1 1
0 
X (5)  1  1  j 1 1 1 1 1 1 1 
j j 1 j j  j  0 
   2 2 2 2 2 2 2 2  
X ( 6)  1 j 1 j 1 j 1 j   
   1 1 1 1 1 1 1 1  0 
X (7 )  1 j j  j 1  j j j
   2 2 2 2 2 2 2 2  0 
 
1  1  1  1 0000   4 
 1 1 1 1   
1  j j j  00 00   1  j (1  2) 
2 2 2 2  
1  j  1  j 0000 
   0 
1  1 1 1 1  
j j j 0000   1  j (1  2) 
 2 2 2 2 
1  1  1  1 0000   
 0 
 1 1 1 1 
1  j j j 0000  
2 2 2 2  1  j (1  2) 
 
1  j  1  j 0000   
 0 
1  1 1 1 1
j j j  0  0  0  0  
 2 2 2 2  1  j (1  2)
 
X R ( 0)  4  X I ( 0)   0 
X (1)  1  X (1)   (1  2) 
 R     I   
X R ( 2)  0  X I ( 2)   0 
X ( 3)  1  X ( 3)   (1  2) 
 R    and  I    
X R ( 4)  0  X I ( 4)   0 
X R (5)  1  X I (5)   (1  2) 
       
X R ( 6)  0  X I ( 6)   0 
X R (7)  1  X I (7)   (1  2) 
X ( k)
2 2
X ( k) X R (k)  X I ( k) 
TM

X I ( k)
 X ( k) tan 1
X R ( k)
 X ( 0)   4   X ( 0)   0 
 X (1)  2.613   X (1)   1.178 
       
 X ( 2)   0   X ( 2)  Not calculated
 X ( 3)  1.082   X ( 3)   0.392 
    and     
 X (5)  1.082    X (5)   0.392 
       
 X (7)  2.613  X (7)   1.178 
 
X ( k)
 X ( 2),  X ( 4) and  X ( 6)
x8
XN [W N ] x N
X8 [W 8 ] x 8
[W 8 ] x8
1 1 1 1 1 1 1 1 
   
X( 0)  1 1 1 1 1 1 1 1 1 
  j j  j 1  j j j
 2 2 2 2 2 2 2 2  1 
X(1)     
  1 j 1 j 1 j 1 j  1 
X( 2)    1 
   1 1 1 1 1 1 1 1   
X( 3)  1  j j j 1 j j  j  1 
   2 2 2 2 2 2 2 2  
X( 4)    1 
  1 1 1 1 1 1 1 1  
 
   1 
X(5)  1 1 1 1 1 1 1 1 
1  j j j 1 j j  j   
   2 2 2 2 2 2 2 2 0
X( 6)    0
  1 j 1 j 1 j 1 j   
X(7)   
  1 1 1 1 1 1 1 1 1 
  j j  j 1  j j j
 2 2 2 2 2 2 2 2 
TM

 1 1  1  1  1  1  0  0   6 
   
1  1 1 1 1 1 1  1  1 
j j j 1  j  0  0   j 1 
 2 2 2 2 2 2   2  2 
   
 1  j  1 j  1  j  0  0   1 j 
   
 1 1 1 1 1 1   
1  j j j 1  j  0  0  1  1  
2 2 2 2 2 2  j1 
   2  2 
   0 
1  1  1 1  1  1  0  0  
 
 1 1 1 1 1 1   1  1  
1  j j j 1  j  0  0   j1  
2 2 2 2 2 2  2  2 
 
   
1  j  1 j  1  j  0  0  1 j 
 
   
1  1 1 1 1 1 1  1  1  
j j j 1  j  0  0  j1 
 2 2 2 2 2 2   2  2  
2n
x (n) {2 0 , 2 1 , 2 2 , 2 3 }

X4 [W 4 ] x 4
X ( 0 ) 1 1 1 1  1  1  2  4  8   15 
X (1 ) 1  j 1 j  2  1  j 2  4  j 8    3 +j 6 
          
X ( 2 ) 1 1 1 1 4  1  2  4  8   5 
X ( 3 ) 1 j 1  j  8     3  j 6
      1  j 2  4  j 8  
x(n) 1
X ( 0 ) 1 1 1 1  0  0  1  0 1   0 
X (1 ) 1  j 1 j  1  0 j  0  j   j 2
         
X ( 2 ) 1 1 1 1 0  0  1  0  1  0 
X ( 3 ) 1 j 1  j  1 0  j  0  j   +j 2 
        
TM

x( n)
X4 [W 4 ] x 4
X( 0)  1 1 1 1  1   2 
X(1)  1  j 1 j  1  1  j 
       
X( 2)  1 1 1 1 0  0 
X( 3)  1 j 1  j  0 1  j 
    
xN
1
N
 

WN XN
 x4
1
4
 
W 4 X 4
x( 0)  1 1 1 1  2  4  1 
x(1)  1 1 j 1 j 1  j  1 4  1 
         
x( 2)  4 1 1 1 1   0  4 0  0
x( 3)  1 j 1 j  1  j  0  0
        
x p  n X1 k 
x p  n X 3 k 
x p  n X 1 k  X 3 k 
0  k  N 1
DFT
x p n  X1 k
N
3 N 1
X 3 k   x p  n W 3k nN
n 0
N 1 2 N 1 3 N 1
 x p  n W 3k nN   x p  n W 3k nN   x p  nW 3k nN
n 0 n N n  2N
N 1 2 N 1 3 N 1
 x p  n W Nk n/ 3   x p  n W Nk n/ 3   x p  n W Nk n/ 3
n 0 n N n 2 N
N 1 N 1 N 1
kn+N  / 3 k n+2N/ 3
 x p  n W Nk n/ 3   x p  n+N  W N   x p  n + 2N W N
n 0 n 0 n 0
TM

N 1 N 1 N 1
 x p  n W Nkn/ 3   x p  n W Nkn/ 3 W NkN/ 3   x p  n
n 0 n 0 n 0
N 1 N 1 N 1
 x p  n W Nkn/ 3   x p  n W Nkn/ 3 W 3k   kn/ 3
x p  n W N W 32 k
n 0 n 0 n 0
N 1 k
1   
n
W 3k  W 32 k x p  n W N 3
n 0
1  W 3k  W 32 k  X 1  k3 
1
F
N
x 1  n NF 1 Fx n  Nx  n , F 1 F  1
 n 
 4 
 
 n   1 1 
 4   1, , 0,  
   2 2
TM

 1 
 
1 1 1 1   1   1 
1  j 1 j   2  1  j 2 
X4 [W 4 ] x 4      
1 1 1 1   0   1 
1 j 1  j    1  j 2 
  1   
 2 
 ( n) an  
( n – n 0 )  
 ( n)
 ( n)
 1 for n  0
 ( n) 
 0 for n  0
N1
X ( k)  x ( n) e  j 2 kn/ N
n 0
x ( n)
X ( k) x ( 0) e 0  1  1
x ( n) an for 0  n  N 1
N1 N1
X ( k)  x ( n) e  j 2 kn/ N  a n e  j 2kn/ N x ( n)
n 0 n 0
N1
 a e  j 2k / N 
n
n 0
N2
a N1  a N2  1
 ak
1a
k  N1
a e  j 2k / N   a e  j 2k / N 
0 N
1  a N e  j 2 k
X ( k)
1  a e  j 2 k / N 1  a e  j 2 k / N
TM

e  j 2k cos 2k  j sin 2k 1  j0  1
1  aN
X ( k)
1  a e  j 2 k / N
( n – n 0 )
x(( n – l)) N DFT

N
 X( k) e – j 2kl / N
( n) n0
(( n – n 0 )) N DFT
N
 1  e – j 2 kn0 / N e – j 2 kn0 / N
 
x( n) an  n  N 1
x( n) e  0.5 n  n5
an ( e  0.5 ) n
an  n  N 1
1aN
X ( k)
1  a e  j 2 k / N
e  0.5
1  e 0.5 6
X ( k)
1  e 0.5  e  j 2 k / 6
0.95
 X ( k)
1  0.6  jk / 3
x n  0 . 5, 0, 0 . 5, 0 
 3
X Z  xn z n  xn z n 0 . 5  0z 1  0 . 5 z 2  0z 3
n n 0
TM

X k  X  z
z  e j 2k / N
 
2
X k  0 . 5  0 . 5 e j 2 k / 4 0 . 5  0 . 5 e  jk 0 . 5  0 . 5  1 k
 X 0 0 .5  0 .5  1
X1
X 2 0 .5  0 .5  1
X 3
x( n)  ( 1) n 1 , 0  n  7
     
     
     
     
     
      
     
     
     
     
     
     
{ 4 ,  j 2 , 0 , j 2}
 
 
 
 
 
 
x  n  1, 1, 1, 0, 0
 
  
 
  
 
  
  
TM

1 for 0 n 2
x  n  
0 otherwise
X k 
 3 
 2.414
 
 3  1 
 1  0.414
   
 1  1 
 1  0.414
 
 1 
 2.414
1; 0 n 2

3
0; otherwise
   
DFT
x ( n)  X ( k) x (n  N) x ( n)
N
X (k  N) X ( k) k
N 1
X ( k)  x (n) W Nkn
n 0
N 1 N 1
 X (k  N)  x (n) W N( k  N )n  x (n) W Nkn W NNn
n 0 n 0
2
j Nn
W NNn e N e  j 2n
TM

N 1
X (k  N)  x (n) W Nkn X ( k)
n 0
DFT DFT
x 1 ( n)  X 1 ( k) x 2 ( n)  X 2 ( k)
N N
DFT
a 1 x 1 ( n)  a 2 x 2 ( n)  a 1X 1 ( k)  a 2 X 2 ( k)
N
N 1 N 1 N 1
X ( k)  {a 1x 1 (n)  a 2 x 2 (n)} W Nkn  a 1x 1 (n) W Nkn   a 2 x 2 (n) W Nkn
n 0 n 0 n 0
N 1 N 1
a1  x 1 ( n) W Nkn  a 2  x 2 (n) W Nkn a 1X 1 ( k)  a 2 X 2 ( k)
n 0 n 0
x p ( n) x ( n)
x ( n) x p ( n) 0  n  N 1
x ( n) x p ( n)
DFT
x ( n)   X ( k) 
N 
DFT 
x p ( n)  X ( k) 
N 
x ( n) k x ( n  k , modulo N )
x (( n  k)) N x (( n  1)) 4 x (( n  1)) 4
x(1) = 3 x(0) = 4 x(2) = 2
x(2) = 2 x(0) = 4 x(1) = 3 x(3) = 1 x(3) = 1 x(1) = 3
x(3) = 1 x(2) = 2 x(0) = 4

x((n))4 = x(n) x((n1))4 x((n1))4
DFT
x ( n)  X ( k)
N
DFT
x (( n  l)) N  X ( k) e  j 2kl / N
N
TM

N 1
DFT {x (( n  l)) N }  x ((n  l)) N e  j 2 kn/ N
n 0
l1 N 1
 x ((n  l)) N e  j 2 kn/ N   x ((n  l)) N e  j 2 kn/ N
n 0 n l
DFT of first ' l' samples DFT of remaining N  l samples
x (( n  l)) N x ( N  l  n)
l1 l1
 x ((n  l)) N e  j 2 kn/ N  x (n  l  n) e  j 2 kn/ N
n 0 n 0
m N ln
l1 N 1
 x ((n  l)) N e  j 2 kn/ N  x ( m) e  j 2 k( m  l  N )/ N
n 0 m  N l
N 1
 x ( m) e  j 2 k ( m  l )/ N e j 2 k
m  N l
N 1
 x ( m) e  j 2 k( m  l )/ N e j 2k
m  N l
nl m
N 1 N  1 l
 x (( n  l)) Ne
 j 2 kn/ N
 x ((m)) 4 e  j 2 k (m l )/ N
n l m 0
N l1
 x (m) e  j 2 k (m l )/ N
m 0
N 1 N l1
DFT {x (( n  l)) N }  x ( m) e  j 2 k( m  l )/ N   x (m) e  j 2 k (m l )/ N
m  N l m 0
N 1
 x (m) e  j 2 k(m l )/ N
m 0
TM

N 1
 x (m) e  j 2 km/ N  e  j 2 kl / N
m 0
N 1
e  j 2 kl / N  x ( m ) e  j 2 km / N
m 0
e  j 2kl / N  X( k )
DFT DFT
x 1 ( n)  X 1 ( k) x 2 ( n)  X 2 ( k)
N N
DFT
x 1 ( n) N x 2 ( n)  X 1 ( k)  X 2 ( k)
N
x 1 ( n) N x 2 ( n) x 1 ( n) x 2 ( n)
N 1
X 1 ( k)  x 1 (n)e  j 2 kn/ N k 0, 1, ... , N  1
n 0
N 1
X 2 ( k)  x 2 (l)e  j 2 kl / N k 0, 1, ... , N  1
l0
X 3 ( k) X 1 ( n)  X 2 ( k)
N 1 N 1
 x 1 (n) e  j 2 kn/ N   x 2 (l) e  j 2 kl / N
n 0 l0
1 N 1
 x 3 ( m)
N  X 3 (k) e j 2 km/ N
k0
1 N 1  N 1 N 1 
N    x 1 (n) e  j 2 kn/ N .  x 2 (l) e  j 2 kl / N  e j 2km/ N
k0  n  0 l0 
1 N 1 N 1  N 1 
x 3 ( m)
N  x 1 (n)  x 2 (l)   e j 2 k (mn l )/ N 
n 0 l0  k  0 
N 1 N when (m  n  l) is multiple of N
 e j 2 k (mn l )/ N 
when (m  n  l) is not multiple of N
k0 0
TM

N 1 N 1
1
 x 3 ( m)
N  x 1 (n)  x 2 (l)  N ( m  n  l) N
n 0 l0
mnl pN p
l m  n  pN mn N
N 1
 x 3 ( m)  x 1 (n) x 2 (m  n, modulo N)
n 0
( m  n , modulo N ) (( m  n)) N
N 1
 x 3 ( m)  x 1 (n) x 2 ((m  n)) N
n 0
N 1
 DFT
x 1 ( n) x 2 (( n  m)) N  X 1 ( k)  X 2 ( k)
N
n 0
x 3 ( m) x 1 ( n) x 2 ( n)
DFT DFT
x ( n)  X( k) x ( n) e j 2ln/ N  X (( k  l)) N
N N
N 1
DFT {x ( n) e j 2ln/ N }  x (n) e j 2 ln/ N  e  j 2 k n/ N
n 0
N 1 N 1
 x (n) e  j 2 ( k  l )n/ N  x (n) e  j 2 ( N  k  l )n/ N
n 0 n 0
X ( N  k  l) X (( k  l)) N
DFT DFT
x ( n)  X( k) x * ( n)  X * ( N  k) X * ((  k)) N
N N
N 1
DFT {x * ( n)}  x * (n) e  j 2 k n/ N
n 0
TM

N 1
 [x (n) e j 2 k n/ N ] *
n 0
e  j 2 nN / N e  j 2 n
e j 2 k n/ N  e  j 2  nN / N e j 2k n/ N
N 1
DFT {x * ( n)}  [x (n)  e j 2 k n/ N  e  j 2 nN / N ] *
n 0
N 1
 [x (n) e  j 2  ( N  k )n/ N ] * X * ( n  k)
n 0
DFT DFT
x ( n)  X( k) x((  n)) N X * ( N  n)  X * ( k)
N N
1 N 1
IDFT {X * ( k)}
N  X * (k) e j 2 k n/ N
k 0
1 N 1
N  [X (k) e  j 2 k n/ N ] *
k0
e  j 2k n/ N e j 2k ( N n)/ N e j 2 k N / N  e  j 2 k n/ N

e j 2k N / N
1 N 1
IDFT {X * ( k)}
N  {X(k) e j 2 k( N n)/ N } * x * ( N  n)
k0
DFT DFT
x ( n)  X( k) x ((  n)) N x ( N  n)  X ((  k)) N X ( N  k)
N N
N 1
DFT {x ( N  n)}  x (N  n) e  j 2 kn/ N
n 0
1
m N n DFT {x ( N  n)}  x (m) e  j 2 k( N m)/ N
m N
x ( m) 1 m N
0  m  N 1 N
TM

N 1
 DFT {x ( N  n)}  x (m) e  j 2 k  e j 2 km/ N
m 0
e  j 2k
N 1
DFT {x ( N  n)}  x (m) e j 2 km/ N
m 0
e  j 2mN / N
e  j 2mN / N e  j 2m m
N 1
DFT {x ( N  n)}  x (m) e j 2 km/ N  e  j 2 mN / N
m 0
N 1
 x (m) e  j 2 ( N  k )m/ N X ( N  k)
m 0
DFT DFT
x ( n)  X( k) y ( n)  Y ( k)
N N
~ DFT ~
r xy ( l)  R xy ( k) X ( k )  Y * ( k)
N
~
r xy ( l)
N 1
~
r xy ( l)  x (n)y * ((n  l)) N
n 0
DFT DFT
x 1 ( n)  X 1 ( k) x 2 ( n)  X 2 ( k)
N N
1
DFT
x 1 ( n) x 2 ( n)  X 1 ( k) N X 2 ( k)
N N
DFT DFT
x ( n)  X( k) y ( n)  Y ( k)
N N
N 1 N 1
1
 x (n) y * (n) N  X ( k) Y * ( k)
n 0 k0
N 1 N 1
2 1 2
x ( n) y ( n)  x ( n)
N  X ( k)
n 0 k0
TM

x ( n) y ( n)
N 1
~
r xy ( l)  x (n) y * ((n  l)) N
n 0
N 1
~
l r xy ( 0)  x (n) y * (n)
n 0
DFT {~
r xy ( l)} X ( k )  Y * ( k)
1 N 1
~
 r xy ( l) IDFT {X ( k)  Y * ( k)}
N  X (k) Y * (k) e j 2 kl / N
k0
N 1
~ 1
r xy ( 0)
N  X ( k)  Y * ( k)
k0
N 1 N 1
1
 x (n) y * (n) N  X ( k)  Y * ( k)
n 0 k0
 j 0.3018  j 0.518
X( 0) X(1)  j 0.3018 X( 2) X( 3)
X( 4)
X ( N  k) X * ( k)
 X ( 8  k) X * ( k)
k3 X ( 8  3) X * ( 3)
 X(5) 0125
.  j0.518
k2 X ( 8  2) X * ( 2)
 X ( 6)
k 1 X ( 8  1) X * (1)
 X (7) 0125
.  j 0.3018
TM

x( 0)
N 1
1
x( n)
N  X(k) e j 2 kn N
k0
N 1
1
n  0 x( 0)
N  X ( k) e 0
k0
1 7
8 k
N  8 x( 0) X ( k)
0
1
{ 0.25  0125
.  j 0.3018  0  0125
.  j 0.518  0  0.125  j 0.518  0  0125
.  j 0.3018}
8
0, 0 . 5, 1, 0 . 5, 0

0, 0 . 5, 1, 0 . 5, 0

x p  n  0, 0 . 5, 1, 0 . 5, 0, 0, 0 . 5, 1, 0 . 5, 0, 

DFT
x  n 
N 5
 X k 
DFT
x p  n 
N 5
 X k 
x p  n
x n 1, 0 . 5, 0, 0, 0 . 5

DFT
x n 
N 5
 X k 
DFT
x n 
N 5
 X k 
x n
0, 0 . 5, 1, 0 . 5, 0
TM

N 1
 2kn 
Y k   yn cos   , 0  k  N 1
n 0  N 
4
 2kn 
Y k   yn cos   ,0 k 4
n 0  5 
2  4 
Y k  y 0 cos  0  y1 cos  k   y 2 cos  k
 5   5 
6  8 
 y 3 cos  k   y 4 cos  
 5   5 
2  4  6 
Y k  0  0 . 5 cos  k   cos  k   0 . 5 cos  k  0
 5   5   5 
2  4  6 
0 . 5 cos  k   cos  k   0 . 5 cos  k
 5   5   5 
Y 0 0 . 5 cos  0  cos  0  0 . 5 cos  0  2

2   4    0 . 5 cos  6    1.054
Y1 0 . 5 cos    cos    
 5   5   5 
4   8   0 . 5 cos  12   0.059
Y 2 0 . 5 cos    cos    
 5   5   5 
6   12   0 . 5 cos  18   0.059
Y 3 0 . 5 cos    cos    
 5   5   5 
 8    16    24     054
Y 4 0 . 5 cos   cos   0 . 5 cos   1.
 5   5   5 
2,  1.059, 0.059, 0.059,  1.059

x n
x n y n  25
X k  DFT x n DFT y n  25 
Y k e j 2 k 2 /5 Y k e j 4 k /5
 X 0 Y 0 e j 0  Y 0  2
X1 Y1 e j 4  /5  1.059 e j 4  /5
TM

X 2 Y 2 e j 8  /5  0.059 e j 8  /5
X 3 Y 3 e j 12  /5  0.059 e j 12  /5
X 4 Y 4 e j 16  /5   1.059 e j 16  /5
X k  2, 0.856  j 0.622, 0.018  j 0.056, 0.018  j 0.056, 0.856  j 0.622
~
x
x p ( n) 2, 2
DFT
x p (n)  X ( k)
N
 X4 [W 4 ] x p 4
W 0 W 40 W 40 W 40 
 4 
X ( 0 )  0  x p ( 0 ) 
X (1 ) W 4 W 41 W 42 3
W4  x 
     p ( 1) 
X ( 2 ) W 0 x p ( 2 ) 
  W 42 W 44 W4 
6
 
 4 
X ( 3 )  0  x p ( 3 ) 
W 4 W 43 W 46 W 49 
[W 4 ] x p (n)
X ( 0 ) 1 1 1 1   1  1  1 2  2  2 
X (1 ) 1  j 1 j   1  1  j 2  j2  3  j 3
         
X ( 2 ) 1 1 1 1 2 1 1  2  2   0 
         
X ( 3 ) 1 j 1  j  2 1  j  2  j2  3 + j3 
e  4  k / 5 X ( k)
x( n)
DFT
 X( k) e  j 2 kl / N
x(( n  l)) N 
N
N l
DFT
 X( k) e  j 2  k 2 /5
x(( n  2)) 5 
N
TM

DFT
x(( n  2)) 5  X( k) e  j 4  k /5
5
Y( k)
DFT
x(( n  2)) 5  Y( k)
5
y( n) x (( n  2)) 5
y( n) x( n)
y( n)
x( n)  (1, 0, 1, – 1, 1, – 1, 0, 1).

x( n)  {1, 0, 1, – 1, 1, – 1, 0, 1}

x p ( n)  {1, 0, 1, – 1, 1, – 1, 0, 1, 1, 0, 1, – 1, 1, .....}

Take these 8 samples
 x p ( n)  {1, – 1, 1, – 1, 0, 1, 1, 0}
X ( k) {x( n)} {x p ( n)}
x p ( n)
X8 W8 x8
1 1 1 1 1 1 1 1 
X( 0)  1 1 1 1 1 1 1 1 1  1 
j j j 1  j j j
X(1)   2 2 2 2 2 2 2 2  –1
  1 j 1 j 1 j 1 j   
X( 2)    1 
  1  1  j 1 j
1
j
1
1
1
j
1
j 
1
j
1 
 
X( 3)   2 2 2 2 2 2 2 2 –1
X( 4)  1 1 1 1 1 1 1 1  0
   1 1 1 1 1 1 1 1   
X(5)  1  j j j 1 j j  j  1 
 2 2 2 2 2 2 2 2
X( 6)  1 j 1 j 1 
  1 j 1 j   
X(7)  1 1 1 1 1 1 1 1 1   0 
j j  j 1  j j j
 2 2 2 2 2 2 2 2 
TM

 2 
0.29  j 212 . 
 
 –1 – j 
 
 1 . 7  j 212
. 
 4 
 
 1 . 7 – j 212
. 
 –1  j 
 
0.29 – j 212. 

j n    
e 2  2  n  x( n)
  
X 0
X1 1 j
X 2
X 3 1 j
jn
x 1  n e 2 x n
e j 2  n/ 4 x n
DFT
x n e j 2 ln/ N 
N
 X  k  l
N
DFT
 x 1  n x n e j 2 n/ 4 
4
 X  k  l
4
X 1k  X k  1 1  j , 0, 1  j , 1 

4
  
x 1  n cos    n  x n
2 
jn  j n
e 2  e 2 e j   e  j
x  n , since cos 
2 2
1  j n/ 2  j n/ 2 1  j 2 n/ 4 j 2  1 n/ 4 
 e x  n  e x n   e x  n  e x  n 
2  2 
TM

1 1
X 2 k 
2

X  k  1  X k  1 .
4 4  2
1  j , 0, 1  j , 1 1  j , 1, 1  j , 0
 1, 1 , 1, 1 
 2 2 

x 3 n  x n  1

4
DFT
x  n  l 
N
 X k  e  j 2kl / N
N
DFT
 x  n  1 4 
4
 X k  e  j 2 k / 4
 
 X 3 k  X k  e  jk / 2  X k  cos k  j sin k 
 2 2 
X 3  0 X 0cos 0  j sin 0  0 1  0  0
 
X 3 1 X1 cos  j sin
 2 2 
X 3  2 X 2cos   j sin 
3 3
X 3  3 X 3 cos  j sin 
 2 2
X 3 k 
1, 2, 0, 3, 2, 4 , 7 , 5
7 7 2
 X ( k)  X ( k) X ( 0)
k0 k0
N 1
 x(n) W Nkn
n 0
7
 x(n)
n 0
X ( 0) x ( n) x ( n) X ( 0)
TM

N 1
 x(n) W Nkn
n 0
N 7
2  xnW N4n
n 0
7 2 7 2 7
j 4n j 4n
 xn e N  xn e 8  xn e  jn
n 0 n 0 n 0
7
 xn1n e  jn   1n
n 0
x 0  x1  x 2  x 3  x 4  x5  x 6  x7
7
 X k 
k0
1 N 1
N  X k W N kn
k0
1 7
X k 
8 k
x 0
0
7
  X k  8x 0  8  1  8
k0
7 2
 X k 
k0
N 1 N 1
2 1 2
 xn N  X k 
n 0 k0
7
1 7 2
 x 2 n X k 
n 0
8 k
0
7 2 7
  X k  8  x 2  n
k0 n 0
 
8 x 2  0  x 2 1  x 2  2 ......... x 2 7
8 1  4  0  9  4  16  49  25
TM

 1, 0  n  3  1, n  0, 5  n  7
 x 1 ( n) 
 0, 4  n  7  0, 1  n  4
x 1 ( n)
x(n)
1
0 1 2 3 4 5 6 7 8 9 10 n
x1(n)
1
–3–2–1 0 1 2 3 4 5 6 7 8 n
N–1
 x(n) e – j 2 nk N
n 0
7
 x(n) e – j 2 nk 8
n 0
7
 x(n)
n 0
7
 e – jn 4 1  e – j 4
 e – j 2
 e – j 3 4
n 0
7
 x(n) e – jn 2 1  e – j 2
 e – j  e – j 3  2
n 0
TM

7
 x(n) e – j 3 n 4
n 0
7
 x(n) e – jn
n 0
7
 x(n) e – j5 n 4
n 0
7
 x(n) e – j 3 n 2
n 0
7
 x(n) e – j7 n 4
n 0
x 1 ( n)
x 1 ( n)
x 1 ( n) x (( n  3)) N
X 1 ( k) DFT [ x (( n  3))] N
DFT [ x(( n – m)) N ] X( k) e – j 2km N
 X 1 ( k) X( k) e j 3 k 4
X 1 ( 0)
X 1 (1) X(1) e j 3  4
X 1 ( 2) X( 2) e j 3  2 0 e j 3 2
X 1 ( 3) X( 3) e j 9  4
X 1 ( 4) j 3
X( 4) e
X 1 (5) X(5) e j 15  4
X 1 ( 6) X( 6) e j 9  2
TM

X 1 (7) X(7) e j 21 4
 X 1 ( k)
0 n 8
{1, 2,  3, 0, 1,  1, 4 , 2}
7 7 3 7
j
 X ( k) e 4 X ( k) |X(k)|2
k 0 k 0 k 0
N–1 7 7
X ( k)  x ( n) W Nkn  x( n) W 80  x( n)
n 0 n 0 n 0
N–1
 x ( n) W Nkn
n 0
7 7 2
N –j 4n
2
X( 4)  x ( n) W 84n  x ( n) e 8
n 0 n 0
7 7
 x ( n) e – jn  x ( n) (–1) n , since e –jn (– 1) n
n 0 n 0
7
 X(k)
k 0
N–1
1
x( n)
N  X(k) W N– kn
k0
1 7 1 7
8 k 8 k
x( 0) X( k) W 80 X ( k)
0 0
7
  X ( k) 8  x( 0) 81
k0
TM

7 3
–j
 x ( n) e 4 X (k)
k0
x ((n – l)) N  e – j 2kl / N X( k)
x (( n – 3)) 8  e – j 2 k 3 / 8 X( k)
x (( n – 3)) 8  e – j 3  / 4 X ( k)
1 N–1
x (( n – 3)) 8 e – j 3  / 4 X ( k)
N  – kn
{e – j 3  / 4 X( k)}  W N
k0
1 7
x(( 0 – 3)) 8
8  e – j 3  / 4X(k) W 80
k0
7
 e – j 3  / 4 X ( k) 8x((–3)) 8
k0
x((–3)) 8
7
 e – j 3  / 4 X ( k)
k0
7
|x(k)|2
k 0
N 1 N–1
1
 |x( n)|2
N  |X(k)|2
n 0 k0
7
1 7
 x 2 (n) 8 k
|X( k)|2
n 0 0
7 7
 |X(k)|2 8  x 2 (n)
k0 n 0
TM

 2n 
 
 N 

      
   








 j 0.3018  j 0.0518
   
1 2  n  2

h ( n)   2
 0 otherwise
N8   
 
 
  
 
   
 
 0.207    
 
  
 
 0.207    
 
    
 
 1.207  0 
x( n) { 8, 3, 4 , 1,  5,  4 ,  20, 2,  1, 7 , 4 }
X ( k)
10
{X( k)} |X(k)|2
k0
   

h ( n)  a n u ( n)
H( ) H ( k) h( n)
H( ) H ( k)
      

TM

N
 
 2 
x n
X k   10, .... , ..... , 4 ,  1  j , ..... ,  3  2 j , 2  j 
    
DFT
x( n) 
N
 X ( k) DFT {X( k)} x(  l)
N 1 N 1
1
 |x(n)|2 N  |X( k)|2
n0 k0
TM

x 1 ( n) and x 2 ( n)
x 1 ( n) 2, 1, 2, 1 and x 2 ( n) 1, 2, 3, 4
 
x 3 ( m)
x 3 ( m) x1 ( n) x 2 ( n)
x 1 ( n) and x 2 ( n)
3
x 3 ( m)  x 1 ( n)  x 2 ( m  n) 4 m  0, 1, 2, 3 ....
n 0
x 3 ( 0)
3
x 3 ( 0)  x 1 ( n) x 2 (  n) 4
n 0
x 1 ( n)
x 2 ( n) x 2 (  n) 4
x 2 ( n) x 2 ( n)
x 1 ( n) x 2 (  n) 4
x 1 ( n) x 2 (  n) 4
x 1 ( n) x 2 (  n) 4
TM

(a) Sequence x1(n) x1(1) = 1 (b) Sequence x2(n) x2(1) = 2
plotted across plotted across
the circle. the circle.
x1(2) = 2 x1(n) x1(0) = 2 x2(2) = 3 x2(n) x2(0) = 1
x1(3) = 1 x2(3) = 4
(c) x2((–n))4 means x2(3) = 4

sequence x2(n)
is folded circularly.
This is obtained
by plotting x2(n)
clockwise across
the circle.
x2(2) = 3 x2((–n))4 x2(0) = 1
x2(1) = 2
x 3 ( 0)
x2(3)
4
14 = 4
4
))
–n
2 ((
1
x
x1(1)
)
1 (n
x
x2(2) 3 2 x1(2) x1(0) 2 1 x2(0)

3 = 6 1 = 2
x1(3)
1
12 = 2
2
x2(1)
x1 (n ) and x 2 (( n ))4
TM

x 3 ( 0)
x 3 ( 0)
x 3 (1)
3
x 3 (1)  x 1 (n) x 2 (1  n) 4
n 0
x 2 (1  n) 4 x 2 ( [ n  1]) 4

x 2 (  n) 4
x 2 (  n) 4 x 2 (1  n)
x 2 (  n) 4
x 2 (  n) 4
x2(3) x2(0)
x2(2) x2((–n))4 x2(0) x2(3) x2((1–n))4 x2(1)
x2(1) x2(2)
(a) The sequence of x2 (( – n))4 (b) The sequence x2 (( – n))4 is obtained

by shifting x2 (( – n))4 anticlockwise
by one sample
x 1 ( n) x 2 (1  n) 4
x 1 ( n) and x 2 (1  n) 4
x 3 (1)
x 3 (1)
x 3 (1)
TM

x2(0)
)4
11 = 1
n)
1–
2 ((
1
x
x1(1)
)
1 (n
x
x2(3) 4 2 x1(2) x1(0) 2 2 x2(1)
24 = 8 22 = 4
x1(3)
1
13 = 3
3
x2(2)
x1 (n ) x 2 ((1  n ))4
x 3 ( 2)
3
x 3 ( 2)  x 1 (n) x 2 (2  n) 4
n 0
x 2 (1  n) 4 x 2 (  n) 4

x 2 ( 2  n) 4 x 2 (1  n) 4
x 2 (  n) 4
x 2 ( 2  n) 4
x 2 (1  n) 4 x 2 (1  n) 4
x2(0) x2(1)
x2(3) x2((1–n))4 x2(1) x2(0) x2((2–n))4 x2(2)
x2(2) x2(3)
(a) The sequence of x2 (( 1 – n))4 (b) The sequence x2 ((2 – n))4 is obtained
by shifting x2 ((1 – n))4 anticlockwise
by one sample
TM

x 1 ( n) x 2 ( 2  n) 4
x 1 ( n) and x 2 ( 2  n) 4
x2(1)
)4
12 = 2
n)
2–
2 ((
1
x
x1(1)
)
1 (n
x
x2(0) 1 2 x1(2) x1(0) 2 3 x2(2)

21 = 2 23 = 6
x1(3)
1
14 = 4
4
x2(3)
x (n ) x 2 (( 2  n ))4
x 3 ( 2)
x 3 ( 2)
x 3 ( 2)
x 3 ( 3)
3
x 3 ( 3)  x 1 (n) x 2 (3  n) 4
n 0
x 2 ( 3  n) 4 x 2 ( 2  n) 4
x 2 (  n) 4
x 1 ( n)
x 2 ( 2  n) 4
x 2 ( 3  n) 4
TM

x2(2)
)4
13 = 3
n)
3–
2 ((
1
x
x1(1)
)
1 (n
x
x2(1) 2 2 x1(2) x1(0) 2 4 x2(3)
22 = 4 24 = 8
x1(3)
1
11 = 1
1
x2(0)
x 3 ( 3)
x 1 ( n) x 2 ( 3  n) 4
x 3 ( 3)
x 3 ( 3)
x 3 (3)
x3 ( ) x 3 ( 0), x 3 (1), x 3 ( 2) and x 3 ( 3)

x3 ( )
x 3 ( n)  14 , 16, 14 , 16

x 1 ( n) x 2 ( n)
h ( n) and x ( n)
y ( n) h ( n) x ( n), n  0, 1, ..... N  1
TM

x 1 ( n) { 1, 2, 3, 4 } { 1 , 1 , 2 , 2}
1 4 3 2  1  15 
2 1 4 3  1  17 
x 1  n x 2 ( n)      
3 2 1 4  2 15 
     
4 3 2 1  2 13 
h ( n) 0, 1, 2, 3, 0, 0, 0, 0 
x ( n) 1, 0.5, 1, 0.5, 1, 0.5, 1, 0.5 
y ( 0)  0 0 0 0 0 3 2 1 1 
 y (1)  1 0 0 0 0 0 3 2 0.5
     
y ( 2)  2 1 0 0 0 0 0 3 1 
     
y ( 3)  3 2 1 0 0 0 0 0 0.5
y ( 4)  0 3 2 1 0 0 0 0 1 
     
 y (5)  0 0 3 2 1 0 0 0 0.5
y ( 6)  0 0 0 3 2 1 0 0 1 
     
y (7)  0 0 0 0 3 2 1 0 0.5
(0  1)  (0  0.5)  (0  1)  (0  0.5)  (0  1)  (3  0.5)  (2  1)  (1  0.5) 

(1  1)  (0  0.5)  (0  1)  (0  0.5)  (0  1)  (0  0.5)  (3  1)  (2  0.5) 
 
(2  1)  (1  0.5)  (0  1)  (0  0.5)  (0  1)  (0  0.5)  (0  1)  (3  0.5) 
 
(3  1)  (2  0.5)  (1  1)  (0  0.5)  (0  1)  (0  0.5)  (0  1)  (0  0.5) 
(0  1)  (3  0.5)  (2  1)  (1  0.5)  (0  1)  (0  0.5)  (0  1)  (0  0.5) 
 
(0  1)  (0  0.5)  (3  1)  (2  0.5)  (1  1)  (0  0.5)  (0  1)  (0  0.5) 
(0  1)  (0  0.5)  (0  1)  (3  0.5)  (2  1)  (1  0.5)  (0  1)  (0  0.5) 
 
(0  1)  (0  0.5)  (0  1)  (0  0.5)  (3  1)  (2  0.5)  (1  1)  (0  0.5) 
TM

0  0  0 
 0  1.5  2  0.5
0 4 
1  0  0  0  0  0  3  1  5 
   
2  0.5  0  0  0  0  0  1.5  4 
   
3  1  1  0  0  0  0  0 5 
0  1.5  2  0.5  0  0  0  0  4 
   
0  0  3  1  1  0  0  0 5 
0  0  0  1.5  2  0.5  0  0  4 
   
0  0  0  0  3  1  1  0  5 
y ( n)
y ( n) 4 , 5, 4 , 5, 4 , 5, 4 , 5
x 1 ( n)
n
x 2 ( n) sin  
8
x 1 ( n)
3n 
x 2 ( n) sin   0 n7
 8 
 0  1 0 0 0 0 1 1 1  1.25 
 0.92  1 1 0 0 0 0 1 1  2.55 
     
 0.707  1 1 1 0 0 0 0 1  2.55 
     
x 2 ( n) 8 x 1 ( n) – 0.38 1 1 1 1 0 0 0 0  1.25 
 –1  0 1 1 1 1 0 0 0  0.25 
     
– 0.38 0 0 1 1 1 1 0 0 – 1.06
 0.707  0 0 0 1 1 1 1 0 – 1.06
     
 0.92  0 0 0 0 1 1 1 1   0.25 
x1 (n) and x 2 (n) N1 N2
(N 1 , N 2 )
X 1 ( k) x 1 ( n)
X 2 ( k) x 2 ( n)
TM

X 1 ( k)  X 2 ( k)
y( n) y( n)
x 1 ( n) x 2 ( n)
n 
sin 
 2 
 x( 0) h( 0)
x(1) h(1)
x( 2) h( 2)
x( 3) h( 3)
X ( k)
1 1 1 1   0   0 
1  j 1 j   1   j 2
[W 4 ] [ x 4 ]      
1 1 1 1   0   0 
     
 1 j 1  j  1  j2 
H ( k)
1 1 1 1  1   15 
1  j 1 j  2  3  j 6
H ( k) [W 4 ] [ h 4 ]      
1 1 1 1  4   5 
     
 1 j 1  j  8  3  j 6
TM

Y (k ) X (k ) H (k ) y (n )
X ( k) H ( k)
 0   15   0 
 j 2 3  j 6 12  j 6
Y( k) X ( k )  H ( k)      
 0   5   0 
     
 j2  3  j 6 12  j 6
y( n) Y( k)
1 1 1 1   0  6
    3
1 1 1 j 1  j  12  j 6  
y( n) Y( k) [W 4 ] [Y4 ]
4 4 1 1 1 1  0  6
     
1  j 1 j  12  j 6 3
n 
x( n) cos  
 2 
h( n) (0.5) n
X (k )
X4 [W 4 ] x 4
1 1 1 1  1  0
1  j 1 j  0  2
 X4      
1 1 1 1  1  0
     
1 j 1 j  0  2
TM

1 1 1 1   1   1.875 
1  j 1 j   0.5  0.75  j 0.375
H4 [W 4 ] h 4      
1 1 1 1   0.25   0.625 
     
1 j 1 j  0.125 0.75  j 0.375 
y (n ) Y (k ) X (k )  H (k )
X ( k) H ( k)
0  1.875   0 
2 0.75  j 0.375 1.5  j 0.75
X ( k)      
0  0.625   0 
     
2 0.75  j 0.375 1.5  j 0.75
y( n) Y( k)
1  ]
y( n) [W N YN
N
1 1 1 1   0   0.75 
1 j 1  j  1.5  j 0.75  0.375 
1      
4 1 1 1 1  0    0.75 
     
1  j 1 j  1.5  j 0.75  0.375
Y( k) X ( k )  H ( k)
n
cos 0  n  3.
2
x 1  n 0, 1, 2, 3
n
x 2  n cos for n  0, 1, 2, 3 1, 0,  1, 0
2
x 1  n x 2  n
1 1 1 1  0  6 
1  j 1 j  1  2  j 2
X 1k        
1 1 1 1 2  2 
     
1 j 1  j  3 2  j 2
TM

1 1 1 1   1  0
1  j 1 j   0  2
X 2 k       
1 1 1 1 1 0
     
1 j 1  j   0  2
 6  0  0 
2  j 2 2 4  j 4 
X 1k  X 2 k       
 2  0  0 
     
2  j 2 2 4  j 4 
DFT
x 1  n x 2  n 
N
 X 1  k . X 2  k 
x 1  n x 2  n
X 1k  X 2 k 
x 1  n x 2  n X 1  k .X 2  k 
1
4
 X 1 k .X 2  k 
W 4
1 1 1 1   0  2
     
1 1 j 1  j  4  j 4  2

4 1 1 1 1  0   2 
     
1  j 1 j  4  j 4   2 
x 1  n x 2  n 2,  2, 2, 2
x 4 [W 4 ]
1 1 1 1  1  5 
1 j – 1 – j  1  – 1
     
1 – 1 1 – 1 2 1 
     
1 – j – 1 j  1  – 1
[W 4 ]  h 4
TM

1 1 1 1  1   10 
1 j – 1 – j  2  – 2  j 2
     
1 – 1 1 – 1 3   –2 
     
1 – j – 1 j  4  – 2 – j 2
X ( k )  H ( k)
1
[W 4 ] X 4
4
1 1 1 1   50  13 
1 j – 1 – j  2 – j 2 14 
1     
4 1 – 1 1 – 1  – 2  11 
     
1 – j – 1 j  2  j 2 12 
x 1 ( n) x 2 ( n)
x 1(n ) x 2 (n )
x 1 ( n)
X 1 ( k) [W 8 ] x 8
1 1 1 1 1 1 1 1  1 
1 0.707 – j 0.707 –j – 0.707 – j 0.707 – 1 – 0.707 + j 0.707 j 0.707 + j 0.707  2 
   
1 –j –1 j 1 –j –1 j   3
1 – 0.707 – j 0.707 j 0.707 – j 0.707 – 1 0.707 + j 0.707 – j – 0.707 + j 0.707  1 
   
1 –1 1 –1 1 –1 1 –1  1 
1 – 0.707 + j 0.707 –j 0.707 + j 0.707 – 1 0.707 – j 0.707 j – 0.707 – j 0.707  2 
   
1 j –1 –j 1 j –1 –j   3
1 0.707 + j 0.707 j – 0.707 + j 0.707 – 1 – 0.707 – j 0.707 – j 0.707 – j 0.707  1 
  
X 2 ( k)
X 1 ( k)  X 2 ( k)
TM

x 1 ( n) 8 x 2 ( n)
x ( n) 1, 1, 1, 1,  1,  1,  1,  1 
h ( n) 0, 1, 2, 3, 4 , 3, 2, 1
        
     
x 1  n x 2  n : x 1  n   2,1,1, 2 ; x 2  n  1, 1, 1,1
x 1  n x 2  n
x 1  n * x 2  n
x( n) (1 . 5) n 0 n 2
2n3 0 n 3
n
cos 0  n  3.
2
y ( n)  x ( n) h ( n)
x ( n)  u ( n)  u ( n  4)
h ( n)  u ( n)  u ( n  3)
y ( n)
TM

2n
cos
N
x( n) 0  n  N 1

 
x n   3 2 1 4 
h  n   2 1 1 3 
N –1
x 3 ( k) x1( k) x 2 ( k) x 3 (n)  x1(m) x 2 ((n – m)) N
m 0
h ( n)
h ( 0), h (1), h ( M  1) x ( n)
x ( 0), x (1), .... x ( L  1)
y ( n) y ( n)
x ( n) h ( n)
TM

nput x(n) FIR filter system Output y(n)
of length L h(n) of length ‘M’ of length L + M – 1
x(0), x(1), ....x(L – 1) h(0), h(1), ....h(M – 1) y(0), y(1), ....y(L + M – 2)
y (n )
x (n ) h (n )

y ( n)  h ( k) x ( n  k)
k
h ( n) x ( n) y ( n)
L  M 1
  
Y () F   h ( k) x ( n  k) 
 k    
F x 1 ( n)  x 2 ( n) X 1 () X 2 ()
Y () H () X ()

H () h ( n)
X () x ( n)
y ( n) L  M 1 y ( n) L  M 1
y ( n) Y ( k) N  L  M 1
y ( n) Y ( k) Y ()
Y ( k) Y ()   2 k , k  0, 1, , N 1
N
Y ()
Y ( k) X ()  H ()   2  k,
k  0, 1, ..... , N  1

X ()   2  k
 X ( k) H ()   2  K
 H ( k)
 
Y ( k) X ( k )  H ( k) , k  0, 1, ...... , N  1
x ( n) and h ( n) Y ( k)
y ( n) N  L  M 1 y ( n)
Y ( k)
TM

y ( n) IDFT Y ( k)
IDFT X ( k)  H ( k) , k  0, 1, ..... N  1
y ( n)
x ( n) and h ( n)
N  L  M 1
x ( n) and h ( n)
X ( k) and H ( k) X ( k) and H ( k)
Y ( k) Y ( k) y ( n)
LTI system
x(n) unit sample y(n)
length ‘L’ response length N = L + M – 1
h(n) of length ‘M’
Linear convolution
(a)
M–1 N X(k)
x(n) zeros point
length ‘L’ padding x(n) DFT
of
length
N = L+M–1 Multiply Y(k) N y(n)
two point length
DFTs IDFT N=L+M–1
L–1 N H(k)
h(n) zeros point
length ‘M’ padding h(n) DFT
of
length
N=L+M–1
Linear convolution
(b)
x (n ) and h (n ) y (n )
Y ( k) X ( k )  H ( k) , k  0, 1, .... N  1
TM

x 1 ( n) x 2 ( n) DFT
N
 X 1 ( k) X 2 ( k)
y ( n) x ( n) h ( n) , n  0, 1, ..... , N  1
x ( n) and h ( n) y ( n)
N  L  M 1
M –1
x(n) zeros
padding x(n) of
length ‘L’ length
N = L+M–1
N - point y(n)
circular length
convolution N = L+M–1
L –1
h(n) zeros
length ‘M’ padding h(n) of
length
N = L+M–1
y ( n)
x ( n) h ( n) y ( n)
TM

x ( n) and h ( n)
x ( n)
( M  1)
 
 
x 1 ( n)  0, 0, 0, ...... 0 , x ( 0), x (1), ....... x ( L  1) 
 first x(n) 
 block padded with M1 zeros ' L' samples of data sequence 
TM

 
 
x 2 ( n)  x ( L  M  1), ...... , x ( L  1) , x ( L), x ( L  1), ..... x ( 2L  1) 
(M 1) data samples of sequence x1(n) x( n) 
 Next ' L' data samples of sequence 
 
 
x 3 ( n)  x ( 2L  M  1), ...... , x ( 2L  1) , x ( 2L), x ( 2L  1), x ( 3L  1) 
( M 1) data samples of sequence x2 (n) sequence x ( n) 
 Next ' L' data samples of 
x 1 ( n), x 2 ( n), x 3 ( n), N  L  M 1

h ( n)
L 1
 
 
h ( n)  h ( 0), h (1), .... h ( M  1) , 0, 0, ..... ( L  1 zeros) 
' M' samples of unit sample response ( L 1) zeros are padded to make N  L  M  1 total samples
 
h ( n) N  L  M 1
h ( n) H ( k) mth X m ( k)
Ym ( k)
Ym ( k) H ( k) X m ( k), k  0, 1, .... , N  1
y m ( n) Ym ( k)
y m ( n) y m (0), y m (1), .... y m (M  1), y m (M), y m (M  1), y m ( N  1)
x 1 ( n), x 2 ( n), x 3 ( n), ...

y m ( n) N  L  M 1
x 1 ( n), x 2 ( n), x 3 ( n), ... M 1
( M  1) ( M  1)
y m ( n)
( M  1)
y m ( n) y m ( n)
y m ( n) y m ( n) n  M , M  1, .... , N  1
TM

Long input x(0), x(1), ....x(L – 1) x(L), x(L + 1), ....x(2L – 1) x(2L), x(2L + 1), ....x(3L – 1)
sequence segmented
in blocks of ‘L’
samples
These ‘L’ samples

are taken from
x1(n) 0, 0, ....0 x(0), x(1), ....x(L – 1) input sequence
x(L – M + 1) ....
x2(n) x(L), x(L + 1), ....x(2L – 1)
....x(L – 1)
These (M–1)
samples
x(2L – M + 1)... x(2L), x(2L + 1), ....x(3L – 1)
are taken x3(n)
....x(2L – 1)
from x1(n)
These (N + M – 1) samples of output
TM
are obtained due to x1(n)
^y (0) .... ^ ^ ^
1
....Y^ (M–1) y1(M),y1(M + 1), ....y1 (N – 1)
1
^ ^ ^
^y (0) ....
2
y2(M), y2(M + 1), ....y2 (N – 1)
....y^2 (M–1)

These (M – 1)
samples of output y^3 (0) .... ^ ^ ^
are discarded ....y^3(M – 1) y3(M), y3(M +1), .... y3 (N – 1)
due to overlap
Output blocks containing

‘L’ samples are fitted
one after another to ^ ^ ^ ^ ^ ^ ^ ^ ^
y1(M), y1(M + 1), ....y1 (N–1) y2(M), y2(M + 1), .... y2 (N – 1) y3(M), y3(M + 1), .... y3 (N – 1)
form output sequence
2M
N  M  L 1
x 1  n 0, 0, ... 0, x 0 x 1, ... x L  1 

x 2  n x L  M  1 , ... x L  1, x L, x L  1, ... x 2L  1 
x 3  n x 2L  M  1, ... x 2L  1, x 2L, x 2L  1, ... x 3L  1 
Y1  k   X 1  k   H  k  
 y 1  n  x 1  n N h  n
y 1  n  IDFT Y1  k  
y 2  n , y 3  n
y 1  n , y 2  n , y 3  n
N  L  M 1
M 1
 
 
x 1 ( n)  x ( 0), x (1), .... x ( L  1) , 0, 0, ...... 0 
 ' L' samples of input data sequence x (n) ( M 1) zeros are padded at the end 
 
 
 
x 2 ( n)  x ( L), x ( L  1), ..... x ( 2L  1) , 0, 0, ........ 0 
 Next ' L' samples of input sequence x (n) ( M 1) zeros are padded at the end 
 
 
 
x 3 ( n)  x ( 2L), x ( 2L  1), x ( 3L  1) , 0, 0, ....... 0
 Next ' L' samples of input sequence x (n) ( M 1) zeros 
 
Ym ( k)
H ( k) and X m ( k)
Ym ( k) H ( k)  X m ( k), k  0, 1, .... N  1
TM

H ( k) h ( n) and X m ( k) mth
y m ( n) Ym ( k)
y m ( n)
y 1 ( n) y 1 ( 0), y 1 (1), y 1 ( L  1), y 1 ( L), y 1 ( L  1), y 1 ( N  1)
y 2 ( n) y 2 ( 0), y 2 (1), y 2 ( L  1), y 2 ( L), y 2 ( L  1), y 2 ( N  1)
M 1 M 1
M 1
y ( n) y 1 ( n) and y 2 ( n)
y ( n) y 1 (0), y 1 (1), y 1 ( L  1), y 1 ( L)  y 2 ( 0) , y 1 ( L  1)  y 2 (1) ,

..... y 1 ( N  1)  y 2 ( M  1) , y 2 ( M), ...... y 2 ( N  1)
( M  1)
( M  1)
( M  1)
( M  1)
( M  1)
N  2M
N  M  L 1
TM

Long input x(0), x(1), ....x(L – 1) x(L), x(L + 1), ....x(2L – 1) x(2L), x(2L + 1), ....x(3L – 1)
sequence segmented
in blocks of ‘L’
samples M–1 zeros
are padded These ‘L’ samples
at end are taken from
input sequence
x1(n) x(0), x(1), ....x(L – 1) 0, 0, ....0
x2(n) x(L), x(L + 1), ....x(2L – 1) 0, 0, ....0
This block is obtained as

an output due to x1(n)
x3(n) x(2L), x(2L + 1), ....x(3L – 1) 0, 0, ....0
TM
Y1(0), Y1(1), ....Y1(L – 1) Y1(L) ....
....Y1(N – 1)
+
Y2(0) .... Y2 (L) ....

Y (M), ....Y2(L – 1)
....Y2(M – 1) 2 ....Y2 (N – 1)

+
Overlap of two
sequences is Y3(0) .... Y3(L) ....
Y (M), ....Y3(L – 1)
added to give ....Y3(M – 1) 3 ....Y (N – 1)
3
output sequence
=
Output blocks
overlapped
and added to
obtain final Y1(0), Y1(1), ....Y1(L – 1) Y2(M), ....Y2(L – 1) Y3(M), ....Y3(L – 1)
output sequence
[Y1(L) + Y2(0)], ...[Y1(N – 1) + Y2(M – 1) [Y2(L) + Y3(0)], ...[Y2(N – 1) + Y3(M – 1)
x 1  n x 0, x 1, .... x L  1, 0, 0, .... 0
x 2  n x L, x L  1, .... x 2L  1, 0, 0, .... 0
x 3  n x 2 L, x 2L  1, .... x 3L  1, 0, 0, .... 0
 y 1  n  x 1  n N h  n
Y1  k   X 1  k   H  k  
y 1  n  IDFT Y1  k 
y 2  n , y 3  n
(M  1)
(M  1)
(M  1) M 1
(M  1)
x ( n) X () X ()
TM

' ' X ()
Fs
Fs  2 Fmax
2
T 0  LT
1
T0
x ( n) x ( n)
w ( n)
x ( n) x ( n) w ( n)
w ( n)
 1, for 0  n  L 1
w ( n) 
0 otherwise
x ( n)
x ( n) cos ( 0 n)
x ( n)
x ( n) cos ( 0 n) 0  n  L 1
L1
X ( k)  x ( n) e  j 2 kn/ N
n 0
k  0, 1, N 1 NL
X ( k) k
'2'
2
' k'
N
2
TM

 
h ( n)
x 1 ( n)
x 2 ( n)
x 3 ( n)
x 4 ( n)
TM

y 1 ( n) x 1 ( n) h( n)
y 2 ( n) x 2 ( n) h( n)
y 3 ( n) x 3 ( n) h( n)
y 4 ( n) x 4 ( n) h( n)
y 1 ( 0)   1 0 0 1 2  1   1 
 y (1)   2 1 0 0 1  2  4 
 1      
y 1 ( 2)  1 2 1 0 0  3  6 
      
y 1 ( 3)   0 1 2 1 0  0  4 
y 1 ( 4)   0 0 1 2 1  0 3 
y 2 ( 0)   2 0 0 2 3  1   2 
 y (1)   3 2 0 0 2  2  7 
 2      
y 2 ( 2)  2 3 2 0 0  3  10 
      
y 2 ( 3)   0 2 3 2 0  0  5 
y 2 ( 4)   0 0 2 3 2  0 6 
y 3 ( 0)  3 0 0 1 1  1   3 
 y (1)  1 3 0 0 1  2  7 
 3      
y 3 ( 2)  1 1 3 0 0  3 10
      
y 3 ( 3)  0 1 1 3 0  0  1 
y 3 ( 4)   0 0 1 1 3  0  3 
y k ( n)
y k ( n)
y1 (n)  4 –3 1 4 6
Discard
y2 (n)  7 –3 6 4 10
Discard
y3 (n)  2 7 2 – 13 – 10
Discard
y4 (n)  3 –4 0 7 6
Discard
y5 (n)  2 3 4 –3 0
y (n)  1 4 6 6 4 10 2 – 13 – 10 0 7 6 4 –3
TM

 
 0, 0 1, 2, 1 
x 1 ( n)  , 
 M  1 zeros Samples of x( n) 
 
 
 2,  1 2, 3,  2 
x 2 ( n)  
 M  1 samples of x 1 ( n) L samples of x 1 ( n) 
 
x 3 ( n)
x 4 ( n)
x5 ( n)
y 1 ( n) x 1 ( n)
y 2 ( n) x 2 ( n)
y 3 ( n) x 3 ( n)
y 4 ( n) x 4 ( n)
y 5 ( n) x5 ( n)
y1 (n)  1 4 6 4 –3
y2 (n)  2 7 10 5 –6
Add
y3 (n)  –3 –7 –10 –1 3
Add
y4 (n)  1 4 6 4 –3
Add
y (n)  1 4 6 6 4 10 2 –13 –10 0 7 6 4 –3
x5 ( n)
TM

 
{1, 2, 0, 0}
L – 1 zeros
are padded
x 1 ( n) {1, 2, – 1 , 0 }
' L' samples M– 1
of x( n) zeros
x 2 ( n) {2, 3, – 2 , 0 }
' L' samples M– 1
of x( n) zeros
x 3 ( n)
x 4 ( n)
y 1 ( n) x 1 ( n)
y 2 ( n) x 2 ( n)
y 3 ( n) x 3 ( n)
y 4 ( n) x 4 ( n)
y 1 (0)   1 0 –1 2  1  1 
y (1)   2 1 0 –1 2 4 
 1      
y 1 (2)  –1 2 1 0  0 3
      
y 1 (3)   0 –1 2 1  0 –2
y 2 (0)   2 0 –2 3  1  2
y (1)   3 2 0 –2 2 7 
 2      
y 2 (2)  –2 3 2 0  0 4 
      
y 2 (3)   0 –2 3 2  0 –4 
y 3 (0)  –3 0 1 –1 1  –3 
y (1)  –1 –3 0 1  2 –7 
 3      
y 3 (2)   1 –1 –3 0  0 –1 
      
y 3 (3)   0 1 –1 –3 0 2
TM

y 4 (0)   1 0 –1 2  1  1 
y (1)   2 1 0 –1 2 3
 4      
y 4 (2)  –1 2 1 0  0 3
      
y 4 (3)   0 –1 2 1  0 –2
y k ( n)
y k ( n)
y1(n)
y 2 (n)
y 3 (n)
y 4 (n)
y(n)
1 First value
2
–1
x1(n) = { 0, 1, 2, –1 }
M–1 L-samples
zeros of x(n)
2
3
–2
x2(n) = { –1, 2, 3, –2 }
x(n)
M–1 L-New
samples samples
from x1(n) of x(n)
–3
–1
1
x3(n) = { –2, –3, –1, 1 }
1
2
–1 Last value
x4(n) = { 1, 1, 2, –1 }
x5(n) = { –1, 0, 0, 0 }
TM

y 1(n) x 1(n) 4 h(n)
y 2 (n) x 2 (n) 4 h(n)
y 3 (n) x 3 (n) 4 h(n)
y 4 (n) x 4 (n) 4 h(n)
y 5 (n) x5 (n) 4 h(n)
y 1( 0 )  0 1 2 1  1   2 
y (1 ) 1 0 1 2  2  1 
 1       
y 1( 2 ) 2 1 0 1 0  4 
       
y 1( 3 ) 1 2 1 0  0  3 
y 2 ( 0 ) 1 2 3 2  1   5 
y (1 )  2 1 2 3  2  0 
 2       
y 2 ( 2 )  3 2 1 2 0  7 
       
y 2 ( 3 ) 2 3 2 1 0  4 
y 3 ( 0 ) 2 1 1 3  1   0 
y (1 ) 3 2 1 1  2  7 
 3       
y 3 ( 2 ) 1 3 2 1 0  7 
       
y 3 ( 3 )  1 1 3 2  0  1 
 y 4 ( 0 )  1 1 2 1 1   1 
 y (1 )   1 1 1 2 2  3 
 4       
 y 4 ( 2 )  2 1 1 1 0  4 
       
y 4 ( 3 )  1 2 1 1 0  3 
y 5 ( 0 )  1 0 0 0 1   1 
y (1 )  0 1 0 0 2  2 
 5       
y 5 ( 2 )  0 0 1 0  0  0 
       
y 5 ( 3 )  0 0 0  1 0  0 
M1 y k (n)
y1(n) 
y 2(n) 
y 3(n) 
TM

y 4(n) 
y5(n) 
y(n) 
7 7 1 2
h ( n)  1, 2

x ( n)  2, 1
h ( n) 1, 2 M2

x ( n) 2, 1 L2
x(n)  2 1

 h(n)  1 2

4 2
x ( n) and h ( n) 2 1 
y ( n) x ( n) * h ( n) y(n)  2 5 2

x ( n) and h ( n) x (n ) and h (n )
y ( n) 2, 5, 2

L  M 1  2  2 1  3
x (n ) and h (n ) N 4
N4 x ( n) and h ( n)
TM

h ( n)  1, 2, 0, 0  

 

x ( n)   2, 1, 0, 0  
 

1 0 0 2 2 2
2 1 0 0 1  5 
y ( n) h( n) 4 x( n)      
0 2 1 0 0 2
     
0 0 2 1 0 0
y ( n) {2, 5, 2}

{1, 1, 1, 1},
 
1, 1,
y( 0 )  h( 0) h( 6) h(5) h( 4) h( 3) h( 2) h(1)  x(0) 

y(1 )   h(1) h( 0) h( 6) h(5) h( 4) h( 3) h( 2)  x(1) 
    
y( 2)  h( 2) h(1) h( 0) h( 6) h(5) h( 4) h( 3)  x(2) 
     
y 3 )  h( 3) h( 2) h(1) h( 0) h( 6) h(5) h( 4)  x(3) 
y( 4 ) h( 4) h( 3) h( 2) h(1) h( 0) h( 6) h(5)  x(4) 
     
y (5 )   h(5) h( 4) h( 3) h( 2) h(1) h( 0) h( 6)  x(5) 
y( 6 )  h( 6) h(5) h( 4) h( 3) h( 2) h(1) h( 0)  x(6) 

TM

1 0 0 0 4 3 2   1  1 
2 1 0 0 0 4 3  1 1 
    
3 2 1 0 0 0 4   1  2
    
4 3 2 1 0 0 0  1 2
0 4 3 2 1 0 0   0  3 
    
0 0 4 3 2 1 0   0  1 
0 0 0 4 3 2 1   0  4 
2M  2 3
 
{1, 1, 1, 0, 0, 0, 0, 0 }
M samples L  1 zeros
x 1 ( n) {1, 2, 0,  3, 4, 2, 0, 0 }
L samples M  1 zeros
x 2 ( n) { 1, 1,  2, 3, 2, 1, 0, 0 }
L samples M  1 zeros
x 3 ( n) { 3, 0, 0, 0, 0, 0, 0, 0 }
Zeros appended M  1 zeros
X 1 (k)
x 1 ( n)
x 1 ( n)  ( n)  2 ( n  1)  3  ( n  3)  4  ( n  4)  2  ( n  5)
DFT 2
j kl
 ( n  l)  e N  W Nkl
N
 X 1 ( k) 1  2 W 8k  3 W 83 k  4 W 4k
8
 2W 5k
8
 ( n)   ( n  1)   ( n  2) 1  W 8k  W 82 k
TM

Y1 ( k) X 1 ( k )  H ( k)
(1  2 W 8k  3 W 83 k  4 W 84 k  2 W 85 k ) (1  W 8k  W 82 k )
1  3 W 8k  3 W 82 k  W 83 k  W 84 k  3 W 85 k  6 W 86 k  2 W 87 k
y 1 ( n) 1  3 ( n  1)  3  ( n  2)   ( n  3)   ( n  4)  3  ( n  5)  6  ( n  6)  2  ( n  7)
x 2 ( n)
 X 2 ( k)  1  W 8k  2 W 82 k  3 W 83 k  2 W 84 k  W 85 k
 y 2 ( k) X 2 ( k)  H ( k)
(  1  W 8k  2 W 82 k  3 W 83 k  2 W 84 k  W 85 k ) (1  W 8k  W 82 k )
 1  2 W 82 k  2 W 83 k  3 W 84 k  6 W 85 k  3 W 86 k  W 87 k
y 2 ( n)
x 3 ( n)
 X 3 ( k)
 y 3 ( k) X 3 ( k )  H ( k) (1  W 8k  W 82 k )  3  3 W 8k  3 W 82 k
 y 3 ( n)
y k ( n)
y k ( n)
y1(n)
y 2 (n)
y 3 (n)
y(n)
{ 1 , 3 , 3 ,  1 , 1 , 3 , 5 , 2 ,  2 , 2 , 3 , 6 , 0 ,  2 ,  3}

TM

y n h n  2, 2, 1
x n   3, 0,  2, 0, 2, 1, 0,  2,  1, 0 
h n 2, 2, 1 M  3
N M  L 1
3  L 1  L  6
 
 
x 1  n  3, 0,  2, 0, 2, 1, 0, 0 
 ' L' samples of xn M  1 zeros 
 
 These two zeros 
are appeared
 to make ' L' samples 
 
x 2  n  0,  2,  1, 0, 0, 0 , 0, 0 
 ' L' samples of xn M  1 zeros 
 
 
 
 
h n  2, 2, 1 , 0, 0, 0, 0, 0 
 ' M' samples L  1 zeros 
 
y 1  n x 1  n 8 h  n
y 2  n x 2  n 8 h  n
y 1  0  3 0 0 1 2 0 2 0  2 6 
y 1  0 3 0 0 1    6 
 1  
2 0 2 2
     
y 1  2  2 0 3 0 0 1 2 0  1   1 
       
y 1  3   0 2 0 3 0 0 1 2      4 
0
y 1  4   2 0 2 0 3 0 0 1  0 2 
       
 y 1 5  1 2 0 2 0 3 0 0  0 6 
y 1  6  0 1 2 0 2 0 3 0  0 4 
       
y 1 7   0 0 1 2 0 2 0 3  0  1 
TM

y 2  n  0, – 2, – 1, 0, 0, 0, 0, 0  8  2, 2, 1, 0, 0, 0, 0, 0 
 0 , – 4 , – 6 , – 4 , –1 , 0 , 0 , 0 
M –1 y 1  n M –1 y 2  n
y1 n  –1
y2 n  –4 –6 –4 –1
yn  –1 –3 –6 –4 –1
y  n x  n h  n – 1  12
y  n x 2  n
 
y  n  6, 6, –1, – 4 , 2, 6, 4 , –3, –6, –4 , –1, 0 
 
x( n)
y( 0)   1 0 0  11 9 7 5  3   4 
 y(1)   3 1 0 0  11 9 7 5  8 
    
y( 2)   5 3 1 0 0  11 9  7   16
    
y( 3)   7 5 3 1 0 0  11 9  0 
y( 4)   9 7 5 3 1 0 0 11  0 
    
 y(5)   11 9 7 5 3 1 0 0  0 
y( 6)   0  11 9 7 5 3 1 0  0 
    
y(7)   0 0  11 9 7 5 3 1  0 
TM

 1, 2, 3
h ( n)   
 
 1, 2
x ( n)   
 
y  n
h  n  1, 1, 1 
x  n   3,  1, 0, 1, 3, 2, 0, 1, 2, 1 
 
   
y ( n)  x ( n) * h ( n)
x ( n)  1, 1, 0, 1, 1 , h ( n)  1, 2, 3, 2, 1
     
TM

N–1
 x(n) W Nkn
n 0
W Nkn
th
One Second Third (N – 1)
complex complex complex complex
addition addition addition addition
0 k 2k 3k (N – 1)k
X(k) = x(0)  WN + x(1)  WN + x(2)  WN + x(3)  WN + .............. + x(N – 1)  WN
th
One Second Third N
complex complex complex complex
multiplication multiplication multiplication multiplication
(N – 1) complex additions for one value of k
N complex multiplications for one value of k
NN N2
( N – 1)  N N2 – N
N2
N 2  N 
TM

N 1
X ( k)  x ( n) e  j 2  kn/ N , k  0, 1, .... , N  1
n 0
2
j
e N  WN
N 1
X ( k)  x ( n) W Nkn , k  0, 1, .... , N  1
n 0
x ( n) and W Nkn
x ( n) x R ( n)  j x I ( n) W Nkn kn  j W kn
W RN IN
x R ( n) x ( n)
x I ( n) x ( n)
kn
W RN W Nkn
kn
W IN W Nkn
N 1
X ( k)  x R (n)  j x I (n) W RN
kn kn
 j W IN 
n 0
N 1
 x R (n) W RN
kn kn
 x I ( n) W IN   j x R (n) W INkn  x I (n) W RN
kn

n 0
x ( n) W Nkn
Four real multiplications
kn kn kn kn
[ xR(n) WRN – x(n) WN ] + j[ xR(n) WN + x(n) WRN ]
Two real additions
TM




N 1 x ( n)
N2
(N  N) 4N  N  4N 2

2N  N  2N 2
Two
complex
numbers
This is one
a  jb c j d complex number
(a + jb) + (c + jd) = (a + c) + j(b + d)
One complex
addition Two real
 additions
( N  1)
For each value of k , ( N – 1) complex
 2  ( N  1)  2 ( N  1)
additions are converted to
TM

N 1 x ( n)
( N  1) N
For complete DFT ( N – 1) complex
 2  ( N  1) N  2N 2  2N real additions
additions are converted to
2N 2  2N 2  2N
4 N 2  2N N ( 4 N  2)
4N 2
W Nkn e  j 2 kn/ N
e  j   cos   j sin 
2 kn 2 kn
W Nkn cos  j sin
N N
kn  2 kn 
W RN cos   W Nkn
 N 
kn  2 kn 
W IN  sin   W Nkn
 N 
W Nkn
W Nkn N 1 W Nkn
W Nkn
N  N  N2
2  N  N  2N 2
N2
N2  N
4N2
4N2  2N
2N2
TM

WN
x ( n)
N 1
X ( k)  x ( n) W Nkn , k  0, 1, ..... N  1
n 0
WN
2
j
WN e N
WN
W Nk N W Nk
2
j
WN e N
2 2
j (k N ) j  k  j 2
 W Nk N e N e 
2
j k
e N  e  j2 
e  j 2 cos 2  j sin 2 1 j 0
2 k
j k  j 2  j
2
W Nk N e N e N  W Nk e N  WN
 
 
W Nk
N8
W 8k  8 W 8k
WN
N
k
WN 2  W Nk
TM

2
j
WN e N
N 2  N 2 2
k j k   j k j  j k
 WN 2 e N  2 
e N e N  ej 
e j  cos   j sin  1  j 0 1
N 2
k j k
WN 2 e 
2
j
 W Nk e N  WN
W N2  W N / 2
2
j
WN  e N
2 2 2
j j 2 j
WN / 2 e N/2 e N W N2 e N  WN
WN
WN
TM

Computation
of DFT
Divide and DFT as

conquer approach linear filtering
Chirp-z Goertzel
transform algorithm algorithm
Radix-2 FFT Radix-4 FFT Split-Radix FFT

algorithms algorithms algorithms
DIT FFT DIF FFT

algorithms algorithms
N–1
 x(n) W Nkn
n 0
N N
–1 –1
2 2
k( 2m  1)
 x( 2m) W N2 km   x( 2m  1) W N
m 0 m 0
f 1 ( m) f 2 ( m)
N N
–1 –1
2 2
 f 1 ( m) (W N2 ) km   f 2 ( m) (W N2 ) km  W Nk
m 0 m 0
W N2 WN 2
N N
–1 –1
2 2
 f 1 ( m) W Nkm2  W Nk  f 2 ( m) W Nkm2
m 0 m 0
N N
point DFT F1( k ) point DFT F2 ( k )
2 2
TM

F1 ( k)  W Nk F2 ( k)
N
k
2
N
N N k N
X  k   F1  k    W N 2 F2  k  
 2   2   2 
N N
F1 ( k) F2 ( k)
2 2
N N
F1  k   F1 ( k) F2  k   F2 ( k)
 2   2 
N
k
WN 2 – W Nk
N
X  k   F1 ( k) – W Nk F2 ( k)
 2 
N
F1 ( k)  W Nk F2 ( k) –1 
2 

N N 
X  k   F1 ( k) – W Nk F2 ( k) –1
 2  2
N
2
F1 ( k)  W 8k F2 ( k) 


F1 ( k) – W 8k F2 ( k) 
f 1 ( 0) f 1 (1) f 1 ( 2) f 1 ( 3)
v 11 ( n) f 1 ( 2n)
TM

F1(0)
f1(0) = x(0) X(0)
F1(1)
f1(1) = x(2) X(1)
4-point
DFT
F1(2)
f1(2) = x(4) X(2)
F1(3)
f1(3) = x(6) X(3)
0
F2(0) W8
f2(0) = x(1) X(4)
–1
1
F2(1) W8
f2(1) = x(3) X(5)
–1
4-point
DFT 2
F2(2) W8
f2(2) = x(5) X(6)
–1
3
F2(3) W8
f2(3) = x(7) X(7)
–1
v 12 ( n) f 1 ( 2n  1)


v 21 ( n) f 2 ( 2n) 

v 22 ( n) f 2 ( 2n  1) 
F1 ( k) V11 ( k)  W Nk 2 V12 ( k) 

N 
F1  k   V11 ( k) – W Nk 2 V12 ( k) 
 4  

F2 ( k) V21 ( k)  W Nk 2 V22 ( k) 


N 
F2  k   V21 ( k) – W Nk 2 V22 ( k)
 4 
TM

1
V11 ( k)  v 11 (n)W 2kn
n 0
1
 V11 ( 0)  v 11 (n)W 20 v 11 ( 0)  v 11 (1)
n 0
1
V11 (1)  v 11 (n)W 2n v 11 ( 0)  W 21 v 11 (1)
n 0
x( 0) – W 21 x( 4)
2
–j 1
W 21 e 2
This block combines two

2-point DFT Combine 2-point DFTs 4 point DFTs, F1(k) and F2(K)
V11(0) F1(0)
x(0) X(0)
0 0
W2 =W8
V11(1) F1(1)
x(4) X(1)
–1
0 0
W4 =W8
V12(0) F1(2)
x(2) X(2)
–1
0 0 1 2
W2 =W8 W4 =W8
V12(1) F1(3)
x(6) X(3)
–1 –1
Combine 2-point DFTs 0
V21(0) F2(0) W8
x(1) X(4)
–1
0 0 1
W2 =W8 W8
V21(1) F2(1)
x(5) X(5)
–1 –1
0 0
W4 =W8 2
V22(0) F2(2) W8
x(3) X(6)
–1 –1
0 0 1 2
W2 =W8 W4 =W8 3
V22(1) F2(3) W8
x(7) X(7)
–1 –1 –1
v=3 v=2 v=1
Third stage of decimation Second stage of decimation First stage of decimation
Shuffled array in Natural order
bit reversed order of DFT sequence
TM

2v log 2 N log 2 8
r
a A = a + WN b
r
WN r
b B = a – WN b
–1
N 1
 x(n)W Nkn
n 0
WNkn
N2
x(n)WNkn
N2 – N
WNr b
N
2
log 2 N
TM

Butterfies
per stage

N
1   log 2 N
 2
Number of stages
Multiplications
per butterfly
N
log 2 N
2
N
2  log 2 N N log 2 N
2
N2
N2 N2 N N N log2 N N log2 N
 log2 N
2
TM

N
2
N
4
2
N
2
 2N  N 
 
 2 
x ( 0), x ( 4), x ( 2), x ( 6), x (1), x (5), x ( 3), x (7)

X ( k) x ( 0), x (1), , x (7)
x (n ) x (n ) x (n )
n2 n1 n0 n0 n1 n2
x (1)  x ( 001) m4 (100) th

x (1)
4 th
TM

x ( n)  0 . 707, 1, 0 . 707, 0,  0 . 707, 1,  0 . 707, 0
W 80 , W 81 , W 82 and W 83
2
j
WN e N
2 
j j
 W8 e 8  e 4
W 80 e0  1

 
 cos    j sin  
j
W 81 e 4
4
  4
 
0. 7071  j 0. 7071
 
j 2 j
W 82 e 4  e 2
 
cos    j sin j
2 2
 3
j 3 j
W 83 e 4  e 4
3   3 
cos    j sin  
 4   4 
 0.7071  j 0.7071
TM

W80
W81 1 1
0.7071  j 0.7071  j
2 2
W82 j
W83 1 1
 0.7071  j 0.7071   j
2 2
2-point DFT
0
x(0) V11(0) = x(0) + W8 x(4)
0 0
W2 =W8
0
x(4) V11(1) = x(0) – W8 x(4)
–1
2-point DFT
0
x(2) V12(0) = x(2) + W8 x(6)
0 0
W2 =W8
0
x(6) V12(1) = x(2) – W8 x(6)
–1
2-point DFT
0
x(1) V21(0) = x(1) + W8 x(5)
0 0
W2 =W8
0
x(5) V21(1) = x(1) – W8 x(5)
–1
2-point DFT
0
x(3) V22(0) = x(3) + W8 x(7)
0 0
W2 =W8
0
x(7) V22(1) = x(3) – W8 x(7)
–1
TM

x ( 0)  0 . 707 x ( 4)   0.707
x (1)  1 x (5)  1
x ( 2)  0.707 x ( 6)   0 . 707
x ( 3)  0 x (7)  0
V11 ( 0) and V11 (1)
V11 ( 0)
V11 ( 0) x ( 0)  W 80 x ( 4)
V11 ( 0) 0.707  (1)  ( 0.707)

 V11 ( 0)  0
V11 (1)
V11 (1) x ( 0)  W 80 x ( 4)
V11 (1) 0.707  (1)  (  0.707)

 V11 (1)  1.414
V12 ( 0) and V12 (1)
V12 ( 0) x ( 2)  W 80 x ( 6) 0.707  (1)  (  0.707)
 V12 ( 0)  0
V12 (1) x ( 2)  W 80 x ( 6) 0.707  (1)  (  0.707)
 V12 (1)  1.414
V21 ( 0) and V21 (1)

V21 ( 0) and V21 (1)
V21 ( 0) x (1)  W 80 x (5) 1  (1)  ( 1)
 V21 ( 0)  0
V21 (1) x (1)  W 80 x (5) 1  (1)  ( 1)
 V21 (1)  2
TM

V22 ( 0) and V22 (1)
V22 ( 0) and V22 (1)
V22 ( 0) x ( 3)  W 80 x (7)
0 1 0  0  V22 ( 0)  0
V22 (1) x ( 3)  W 80 x (7)
0 1  0  0  V22 (1)  0
Combine 2-point DFTs

0
V11(0) F1(0) = V11(0) + W8 V12(0)
2
V11(1) F1(1) = V11(1) + W8 V12(1)
0 0
W4 =W8
V12(0) 0
F1(2) = V11(0) – W8 V12(0)
–1
1 2
W4 =W8
2
V12(1) F1(3) = V11(1) – W8 V12(1)
–1
V21(0) 0
F2(0) = V21(0) + W8 V22(0)
2
V21(1) F2(1) = V21(1) + W8 V22(1)
0 0
W4 =W8
0
V22(0) F2(2) = V21(0) – W8 V22(0)
–1
1 2
W4 =W8
2
V22(1) F2(3) = V21(1) – W8 V22(1)
–1
TM

F1 ( 0), F1 (1), F1 ( 2) and F1 ( 3)
F1 ( 0), F1 (1), F1 ( 2) and F1 ( 3)
F1 ( 0) V11 ( 0)  W 80 V12 ( 0)
F1 ( 0) 0  1  ( 0)  0  F1 ( 0)  0
F1 (1) V11 (1)  W 82 V12 (1)
F1 (1) 1.414  (  j)  1.414
1.414  j 1.414  F1 (1)  1.414  j 1.414
F1 ( 2) V11 ( 0)  W 80 V12 ( 0)
F1 ( 2) 0  1  ( 0)  0  F1 ( 2)  0
F1 ( 3) V11 (1)  W 82 V12 (1)
F1 ( 3) 1.414  (  j)  1.414
1.414  j 1.414  F1 ( 3)  1.414  j 1.414
F2 ( 0), F2 (1), F2 ( 2) and F2 ( 3)

F2 ( 0), F2 (1), F2 ( 2) and F2 ( 3)
F2 ( 0) V21 ( 0)  W 80 V22 ( 0)
0  1  ( 0)  0  F2 ( 0)  0
F2 (1) V21 (1)  W 82 V22 (1) 2  (  j)  0
 F2 (1)  2
F2 ( 2) V21 ( 0)  W 80 V22 ( 0)
0  1  ( 0)  0  F2 ( 2)  0
TM

F2 ( 3) V21 (1)  W 82 V22 (1)
2  (  j)  0  F2 ( 3)  2
F1 (k ) and F2 (k )

0
F1(0) X(0) = F1(0) + W8 F2(0)
1
F1(1) X(1) = F1(1) + W8 F2(1)
F1(2) 2
X(2) = F1(2) + W8 F2(2)
3
F1(3) X(3) = F1(3) + W8 F2(3)
0
W8 0
F2(0) X(4) = F1(0) – W8 F2(0)
–1
1
W8 1
F2(1) X(5) = F1(1) – W8 F2(1)
–1
2
W8 2
F2(2) X(6) = F1(2) – W8 F2(2)
–1
3
W8 3
F2(3) X(7) = F1(3) – W8 F2(3)
–1
X ( 0), X (1), X ( 2), X (7)

X ( 0) F1 ( 0)  W 80 F2 ( 0)
0 1 0  0  X ( 0)  0
X (1) F1 (1)  W 81 F2 (1)

1.414  j 1.414  (0.7071  j 0.7071)  2
TM

1.414  j1.414  1.4142  j 1.4142
2.8284  j 2.8284  X (1)  2.8284  j 2.8284
X ( 2) F1 ( 2)  W 82 F2 ( 2)
0  (  j)  0  0  X ( 2)  0
X ( 3) F1 ( 3)  W 83 F2 ( 3)
1.414  j 1.414  (  0 . 7071  j 0 . 7071)  2

1.414  j 1.414  1.414  j 1.414
 X ( 3)  0
X ( 4) F1 ( 0)  W 80 F2 ( 0)
0 1  0  0  X ( 4)  0
X (5) F1 (1)  W 81 F2 (1)
1.414  j 1.414  ( 0 . 7071  j 0 . 7071)  2
1.414  j 1.414  1.414  j 1.414
 X (5)  0
X ( 6) F1 ( 2)  W 82 F2 ( 2)
0  (  j)  0  0  X ( 6)  0
X (7) F1 ( 3)  W 83 F2 ( 3)
1.414  j 1.414  ( 0.7071  j 0.7071)  2

1.414  j 1.414  1.414  j 1.414
2.8284  j 2.8284  X (7)  2.8284  j 2.8284
X ( k) 0, 2.8284  j 2.8284 , 0, 0, 0, 0, 0, 2.8284  j 2.8284
TM

2-point DFT Combine 2-point DFTs Combine 4-point DFTs
x(0) = 0.707 V11(0) = 0 F1(0) = 0 X(0) = 0
0 0
W2 =W8 =1
x(4) = –0.707 V11(1) =1.414 F1(1) = 1.414 –j1.414 X(1) = 2.8284 –j2.8284
–1
0 0
W4 =W8 =1
x(2) = 0.707 V12(0) = 0 F1(2) = 0 X(2) = 0
–1
0 0 1 2
W2 =W8 =1 W4 =W8 =–j
x(6) = –0.707 V12(1) =1.414 F1(3) = 1.414 + j1.414 X(3) = 0
–1 –1
Combine 2-point DFTs 0
W8 =1
TM
x(1) = 1 V21(0) = 0 F2(2) = 0 X(4) = 0
–1
1
0 0 W8 =
W2 =W8 =1 0.7071 –j0.7071
x(5) = –1 V21(1) = 2 F2(1) = 2 X(5) = 0
–1 –1
0 0 2
W4 =W8 =1 W8 =–j
x(3) = 0 V22(0) = 0 F2(2) = 0 X(6) = 0
–1 –1
3
0 0 1 2 W8 =
W2 =W8 =1 W4 =W8 =–j
–0.7071 – j0.7071

x(7) = 0 V22(1) = 0 F2(3) = 2 X(7) = 2.8284 + j2.8284
–1 –1 –1
Fig. 1.15.7 Complete signal flow graph of example 1.15.1 It shows input sequence,
output DFT and intermediate values in Radix-2 DIT-FFT algorithm
V11 W80 x F1  0 V11  0  W80 V12 0 F1  0  W80 F2  0

V11 W80 x F1 1 V11 1  W82 V12 1 F1 1  W81 F2 1
 1 1 
j2   j   –2
 2 2
– 2  j 2 2 
V12 W80 x F1  2 V11  0  W80 V12 0 F1  2  W82 F2  2

V12 W80 x F1  3 V11 1  W82 V121 F1  3  W83 F2  3

 1 1 
j 2    j   2
 2 2

2  j 2 2 
V21 W80 x F2  0 V21  0  W80 V22 0 F1  0  W80 F2  0

V21 W80 x F2 1 V21 1  W82 V221 F1 1  W81 F2 1
  1 1 
j2   j   2
 2 2

2  j 2 2 
V22 W80 x F2  2 V21  0  W80 V22 0 F1  2  W82 F2  2

V22 W80 x F2  3 V21 1  W82 V221 F1  3  W83 F2  3

  1 1 
j 2    j   2
 2 2

 2  j 2 2 
TM

x(0) = 1 2 2 X(0) = 0
0
W8 = 1
x(4) = 1 0 j2 X(1) = – 2 + j(2+ 2 )
–1
0
W8 = 1
x(2) = –1 0 2 X(2) = 2 – j2
–1
0 2
W8 = 1 W8 = – j
x(6) = 1 –2 –j2 X(3) = 2 – j(2 – 2 )
–1 –1
0
W8 = 1
x(1) = –1 0 –2 X(4) = 4
–1
0 1
W8 = 1 W8
x(5) = 1 –2 –2 X(5) = 2 + j(2 – 2 )
–1 –1
0 2
W8 = 1 W8 = – j
x(3) = –1 –2 2 X(6) = 2 + j2
–1 –1
0 2 3
W8 = 1 W8 = – j W8
x(7) = –1 0 –2 X(7) = – 2 – j(2 + 2 )
–1 –1 –1
0 1 1 1 2 3 1 1
W 8 = 1, W 8 = 2 – j 2 , W 8 = – j, W 8 = – –j
2 2
Bit reversed Stage - 1 Stage - 2 Stage - 3 calculations

input calculations calculations final output
x(0) = 1 1+1=2 2 + 1(2) = 4 4 + (1) 4 = 8
x(4) = 1 1–1=0 0 + (–j) 2 = –j2 –j2 + ( 12 – j 12 ( (–1 + j) = –j (2 – 2)
x(2) = 2 2+0=2 2 – 1(2) = 0 0 + (–j) 2 = –j2
x(6) = 0 2–0=2 0 – (–j) 2 = j2 (

j2 + –
1
2
–j
1
2
(
(–1 – j) = j (2 2)
x(1) = 1 1+2=3 3 + 1(1) = 4 4 – (1) 4 = 0
x(5) = 2 1 – 2 = –1 –1 + (–j)(–1) = –1 + j – j2 – ( 12 – j 12 ( (–1+j) = – j(2+2)

x(3) = 0 0+1=1 3 – 1(1) = 2 0 – (–j) 2 = j2
x(7) = 1 0 – 1 = –1 –1 – (–j) (–1) = –1–j (

j2 – –
1
2
–j
1
2
(
(–1–j) = j(2–2)
TM

x(0) = 1 2 4 X(0) = 8
0
W8 = 1
x(4) = 1 0 –j2 X(1) = –j(2 –2)
–1
0
W8 = 1
x(2) = 2 2 0 X(2) = –j2
–1
0 2
W8 = 1 W8 = – j
x(6) = 0 2 j2 X(3) = j(2 +2)
–1 –1
0
W 8 =1
x(1) = 1 3 4 X(4) = 0
–1
0 1
W8 = 1 W8
x(5) = 2 –1 –1+j X(5) = –j(2 +2)
–1 –1
0 2
W8 = 1 W8 = – j
x(3) = 0 1 2 X(6) = j2
–1 –1
0 2
W8 = 1 W8 = – j 3
W8
x(7) = 1 –1 –1–j X(7) = j(2 –2)
–1 –1 –1
0 1 1 1 2 3 1 1
W 8 = 1, W 8 = – j , W 8 = – j, W 8 = – – j
2 2 2 2
X k
8
6
j( 2  2) 2 2 |X(k)| 4
2
0 1 2 3 4 5 6 7 k
j( 2  2) 2 2
90º
1 2 4 5
X(k)
j( 2  2) 2 2 0 3 6 7 k
–90º
j( 2  2) 2 2
TM

x(0) = 1 5 10 20
0
W8 = 1
x(4) = 4 –3 –3–j –5.828–j2.414
–1
0
W8 = 1
x(2) = 3 5 0 0
–1
0 2
W8 = 1 W8 = –j
x(6) = 2 1 –3+j –0.172–j0.414
–1 –1
TM
0
W8 = 1
x(1) = 2 5 10 0
–1
0 1
W8 = 1 W8 = 0.707–j0.707
x(5) = 3 –1 –1–j3 –0.172+j0.414
–1 –1
0 2
W8 = 1 W8 = –j
x(3) = 4 5 0 0
–1 –1

0 2 3
W8 = 1 W8 = –j W8 = –0.707–j0.707
x(7) = 1 3 –1+j3 –5.828+j2.414
–1 –1 –1
1 for  3  n  3

0 otherwise
x(n) = {1, 1, 1, 1, 1, 1, 1,} Here N = 7
 x(n) = {1, 1, 1, 1, 1, 1, 1, 0}  N = 8
th th th
(n – 1) period n period (n + 1) period
xp(n) = {....1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0,....}
x(–3) x(–2) x(–1) x(0) x(1) x(2) x(3) x(4) x(5) x(6) x(7)
xp(n) for n = 0 to 7
xp
x p 1 1, 1, 1, 1, 0, 1, 1, 1
DFT

N
TM

DFT
xp  xp
N
xp
Bit reversed Stage - 1 Stage - 2 Stage - 3 calculations

input calculations calculations or final output
x(0) = 1 1+0=1 1+2=3 3+4=7
1 1
x(4) = 0 1–0=1 1 + (–j)0 = 1 1+ –j ×0=1
2 2
x(2) = 1 1+1=2 1 – 2 = –1 – 1 + (–j) 0 = –1
1 1
x(6) = 1 1–1=0 1 – (–j)0 = 1 1+ – –j ×0=1
2 2
x(1) = 1 1+1=2 2+2=4 3 – 4 = –1
1 1
x(5) = 1 1–1=0 0 + (–j)0 =0 1– –j ×0=1
2 2
x(3) = 1 1+1=2 2–2=0 – 1 – (–j) 0 = –1
1 1
x(7) = 1 1–1=0 0 – (–j)0 = 0 1– – –j ×0=1
2 2
x(0) = 1 1 3 X(0) = 7
0
W8
x(4) = 0 1 1 X(1) = 1
–1
0
W8
x(2) = 1 2 –1 X(2) = –1
–1
0 2
W8 W8
x(6) = 1 0 1 X(3) = 1
–1 –1
0
W8
x(1) = 1 2 4 X(4) = –1
–1
0 1
W8 W8
x(5) = 1 0 0 X(5) = 1
–1 –1
0 2
W8 W8
x(3) = 1 2 0 X(6) = –1
–1 –1
0 2 3
W8 W8 W8
x(7) = 1 0 0 X(7) = 1
–1 –1 –1
TM

 1
1  j  
 2
j
1 
 1  j
2

1 j 1 2 

1  j   

1
2
j
1 
 1  j
2

1 j 1 2 
 1
1  j  
 2
j
1 
 1  j
2

1 j 1 2 

1  j   

1
2
j
1 
 1  j
2

1 j 1 2 
x(0) = 1 1 2 X(0) = 4
0
W8
x(4) = 0 1 1–j X(1) = 1– j (1 + 2 )
–1
0
W8
x(2) = 1 1 0 X(2) = 0
–1
0 2
W8 W8
x(6) = 0 1 1+j X(3) = 1 + j (1 – 2)
–1 –1
0
W8
x(1) = 1 1 2 X(4) = 0
–1
0 1
W8 W8
x(5) = 0 1 1– j X(5) = 1 – j (1 – 2)
–1 –1
0 2
W8 W8
x(3) = 1 1 0 X(6) = 0
–1 –1
0 2 3
W8 W8 W8
x(7) = 0 1 1+ j X(7) = 1 + j (1 + 2)
–1 –1 –1
TM

n for 0 n7

 0 otherwise
x(0) = 0 4 12 X(0) = 28
0
W8 = 1
x(4) = 4 –4 –4 + j4 X(1) = – 4 + j 9.656
–1
0
W8 = 1
x(2) = 2 8 –4 X(2) = – 4 + j 4
–1
0 2
W8 = 1 W8 = – j
x(6) = 6 –4 –4–j4 X(3) = – 4 + j 1.656
–1 –1
0
W8 = 1
x(1) = 1 6 16 X(4) = – 4
–1
0 1
W8 = 1 W8
x(5) = 5 –4 –4+j4 X(5) = – 4 – j 1.656
–1 –1
0 2
W8 = 1 W8 = – j
x(3) = 3 10 –4 X(6) = – 4 – j 4
–1 –1
0 2 3
W8 = 1 W8 = – j W8
x(7) = 7 –4 –4–j4 X(7) = – 4 – j 9.656
–1 –1 –1
0 1 2 3
W8 = 1, W8 = 0.707 – j 0.707, W8 = – j, W8 = – 0.707 – j 0.707
 1
1  j  
 2
j
1 
  1  j
2

1 j 1 2 
TM

 1
1 j   
 2
j
1 
   1  j
2

1 j 1 2 
 1
1 j  
 2
j
1 
  –1  j
2

1 j 1 2 
 1
1 j   
 2
j
1 
   1  j
2

1 j 1 2 
x(0) = 1 1 2 X(0) = 0
0
W8 = 1
x(4) = 0 1 1–j X(1) = 1– j (1 – 2 )
–1
0
W8 = 1
x(2) = 1 1 0 X(2) = 0
–1
0 2
W 8 =1 W8 = – j
x(6) = 0 1 1+j X(3) = 1 + j (1 + 2)
–1 –1
0
W8 = 1
x(1) = –1 –1 –2 X(4) = 4
–1
0 1
W 8 =1 W8
x(5) = 0 –1 –1+ j X(5) = 1 – j (1 + 2)
–1 –1
0 2
W8 = 1 W8 = – j
x(3) = –1 –1 0 X(6) = 0
–1 –1
0 2 3
W 8 =1 W8 = – j W8
x(7) = 0 –1 –1– j X(7) = 1 + j (1 – 2)
–1 –1 –1
TM

x(0) X(0)
x(4) X(1)
x(8) X(2)
x(12) 8-point X(3)
FFT
x(16) chip X(4)
x(20) X(5)
x(24) X(6)
x(28) X(7)
0
W16
x(2) X(8)
1 –1
W16
x(6) X(9)
2
W16 –1
x(10) X(10)
3 –1
W16
x(14) 8-point X(11)
4 –1
FFT W16
x(18) chip X(12)
5 –1
W16
x(22) X(13)
6 –1
W16
x(26) X(14)
7 –1
W16
x(30) X(15)
–1 0
W32
x(1) 1
X(16)
W32 –1
x(5) X(17)
2 –1
W32
x(9) X(18)
3 –1
W32
x(13) 8-point X(19)
4 –1
FFT W32
x(17) chip 5
X(20)
W32 –1
x(21) X(21)
6
W32 –1
x(25) X(22)
7 –1
W32
x(29) X(23)
–1
0 8
W16 W32
x(3) X(24)
1 –1 9 –1
W16 W32
x(7) X(25)
2 –1 10 –1
W16 W32
x(11) X(26)
3 –1 11 –1
W16 W32
x(15) 8-point X(27)
4 –1 12 –1
FFT W16 W32
x(19) chip 5 13
X(28)
W16 –1 W32 –1
x(23) X(29)
6 –1 14 –1
W16 W32
x(27) X(30)
7 –1 15 –1
W16 W32
x(31) X(31)
–1 –1
TM

  
x( n)
n 
x( n) cos  
 4 
W 80 W 81
W 82 W 83
N–1
 x(n)W Nkn
n 0
N
2
N
–1
2 N–1
 x( n) W Nkn   x(n) W Nkn
n 0 N
n 2
TM

x(0) = 2 3 6 12
0
W8
x(4) = 1 1 1–j 1–j(1+2)
–1
0
W8
x(2) = 2 3 0 0
–1
0 2
W8 W8
x(6) = 1 1 1+j 1+j(1–2)
–1 –1
0
W8
x(1) = 2 3 6 0
TM
–1
0 1
W8 W8
x(5) = 1 1 1–j 1–j(1–2)
–1 –1
0 2
W8 W8
x(3) = 2 3 0 0
–1 –1

0 2 3
W8 W8 W8
x(7) = 1 1 1+j 1+j(1+2)
–1 –1 –1
0 2 1
W8 = 1 W8 = – j W8 = 1 – j 1
2 2
3
W8 = – 1 – j 1
2 2
x(0) = 1 0 0 x(0) = 0
0
W8 =1
x(4) = –1 2 2 x(1) = 4
–1
0
W8 =1
x(2) = 0 0 0 x(2) = 0
–1
0 2
W8 =1 W8 = –j
x(6) = 0 0 2 x(3) = 0
–1 –1
TM
0
W8
x(1) = 0.707 0 0 x(4) = 0
–1
0 1
W8 =1 W8
x(5) = –0.707 1.414 1.414 + j 1.414 x(5) = 0
–1 –1
0 2
W8 =1 W8
x(3) = –0.707 0 0 x(6) = 0
–1 –1

0 2 3
W8 =1 W8 = –j W8
x(7) = 0.707 –1.414 1.414 – j 1.414 x(7) = 4
–1 –1 –1
N N
–1 –1  N
2 2  k n 
N
x  n   W N
2 
 x( n) W Nkn    2 
n 0 n 0
N N
–1 –1
2 2
N
  x  n   W Nkn
kN 2
x( n) W Nkn  W N
n 0 n 0  2 
kN 2
 – j 2 
kN 2
WN e N  e – jk (– 1) k
 
 
N N
–1 –1
2 2
N
  x( n) W Nkn  (– 1) k  x  n   W Nkn
n 0 n 0  2 
N
–1
2
 k  N W kn
 x( n)  (– 1) x  n  2

 N

n 0 
N
–1
2
 2k  N W 2 kn N
X ( 2 k)  x( n)  (– 1) x  n  2

 N
 2
–1
n 0 
N
–1
2
 ( 2 k  1) x  n  N W ( 2 k  1)n N
 x( n)  (– 1) 


2  N 2
–1
n 0 
(–1) 2k (–1) 2 k  1
W N2 kn (W N2 ) kn W Nkn 2
( 2 k  1)n
WN W N2 kn n W N2 kn  W N
n W Nkn 2  W N
n
N
–1
2
  N  kn
X ( 2 k)  x( n)  x  n  2 W N 2
 
n 0 
TM

N
–1
2
  N W kn W n
 x( n) – x  n  2

 N 2  N

n 0 
N
–1
2    N W n W kn
  x( n) – x  n  2

 N  N 2

n 0  
N
–1
2
N
X ( 2 k)  g 1 ( n)W Nkn 2
2
–1
n 0
N
–1
2
N
 g 2 ( n)W Nkn 2
2
–1
n 0
N N
g 1 ( n) x( n)  x  n   –1
 2  2
  N W n N
g 2 ( n) x( n) – x  n  2  N
2
–1
  
N N
2 2
g 1 ( n) and g 2 ( n)
g 1 ( n) x ( n)  x ( n  4)
g 1 ( 0)  x ( 0)  x ( 4) 
g 1 (1)  x (1)  x (5) 


 g 1 ( 2)  x ( 2)  x ( 6) 
g 1 ( 3)  x ( 3)  x (7) 
g 2 ( n)  x ( n)  x ( n  4)  W 8n N8
g 1 ( 0)  x ( 0)  x ( 4)  W 80 

g 1 (1)  x (1)  x (5)  W 81 

 g 1 ( 2)  x ( 2)  x ( 6)  W 82 

g 1 ( 3)  x ( 3)  x (7)  W 83 
TM

g 1 ( n) and g 2 ( n)
g 1 ( n)
X ( 2 k) g 2 ( n) X ( 2k  1)
X(2k)
g1(0)
X ( k) x(0) X(0)
g1(1)
x(1) X(2)
4 - point
g1(2) DFT
x(2) X(4)
g1(3)
x(3) X(6)
X(2k + 1)
0
W8 g2(0)
g 1 ( n) and g 2 ( n) x(4) X(1)
–1 1
W8 g2(1)
x(5) X(3)
–1 2 4 - point
W8 g2(2) DFT
x(6) X(5)
g 1 ( n) and g 2 ( n) x ( n) –1 3
W8 g2(3)
x(7) X(7)
–1
This block splits x(n)
into g1(n) and g2(n)
N 8
v  log 8 2
N
2
a A = a +b
r
W r
N
b B = (a – b) W
–1 N
TM

This block splits input sequence Split input sequence
into two sequences g1(n) and g2(n) into two sequences 2-point DFT
g1(0) p11(0)
x(0) X(0)
0
g1(1) p11(1) W8
x(1) X(4)
–1
0
g1(2) W8 p12(0)
x(2) X(2)
–1
2 0
g1(3) W8 p12(1) W8
x(3) X(6)
–1 –1
0
TM
W8 g2(0) p21(0)
x(4) X(1)
–1
1 0
W8 g2(1) p21(1) W8
x(5) X(5)
–1 –1
2 0
W8 g2(2) W8 p22(0)

x(6) X(3)
–1 –1
3 2 0
W8 g (3) W8 W8
2 p21(1)
x(7) X(7)
–1 –1 –1
v=1 v=2 v=3
First stage of decimation Second stage of decimation Third stage of decimation
Input sequence DFT sequence shuffled
in natural order in bit reversed order
X ( 2k) and X ( 2k  1)
v  log 2 N
r
WN
N N
v  log 2 N v
2 2
N N
v log 2 N
2 2
N
2    v   N log 2 N
 2 
Aa B b
2 2  4
N
2
N
4  2N
2
N
2N 
2
TM

x ( n) 2, 1, 2, 1
x ( n)
x ( n) 2, 1, 2, 1, 0, 0, 0, 0
x ( 0)  2 x ( 4)  0
x (1)  1 x (5)  0
x ( 2)  2 x ( 6)  0
x ( 3)  1 x (7)  0
TM

Signal flow graph for splitting x(n) into Calculations of g1(n) & g2(n) according to
Inputs g1(n) and g2(n) 8-point DIF-FFT algorithm & signal flow graph
W 80
x(0) = 2 g1(0) = x(0)+x(4)
= 2+0
=2  g1(0) = 2
x(1) = 1 g1(1) = x(1)+x(5)

W 81
= 1+0
=1  g1(1) = 1
.
0707
x(2) = 2 g1(2) = x(2)+x(6)

= 2+0
=2  g1(2) = 2
.
 j 0707
x(3) = 1 g1(3) = x(3)+x(7)

= 1+0
 g1(3) = 1
TM
0
=1
W8 = 1 0
W 82
x(4) = 0 g2(0) = [x(0)–x(4)]W8

–1 = [2–0]1
=2  g2(0) = 2
j
1
W8 = 0.707–j0.707 1
x(5) = 0 g2(1) = [x(1)–x(5)]W8
–1 = [1–0](0.707–j0.707) g (1) = 0.707–j.707
 2
W 83
2
= 0.707–j0.707

W8 = –j 2
x(6) = 0 g2(2) = [x(2)–x(6)]W8
g2(2) = –j2
–1 = [2–0](–j) 
= –j2
3
W8 = –0.707–j0.707 3
x(7) = 0 g2(3) = [x(3)–x(7)]W8
–1 = [1–0](–0.707–j0.707) g2(3) = –0.707–j0.707
= –0.707–j0.707 
0.707  j 0.707
g1 (n ) and g 2 (n )
Signal flow graph for splitting 4 point
Inputs Calculations for 2-point sequences
sequences into 2-point sequences
g 1 ( n) and g 2 ( n)
g1(0) = 2 p11(0)= g1(0) + g1(2)
= 2+2
=4  p11(0) = 4
g1(1) = 1 p11(1)= g1(1) + g1(3)

= 1+1
= 2  p11(1) = 2
0
W8 = 1 0
g1(2) = 2 p12(0)= [g1(0) – g1(2)] W8
–1
=(2–2)1  p12(0) = 0
2 =0
x ( n)
W8 = –j 2
g1(3) = 1 p12(1)= [g1(1) – g1(3)]W8
–1
= (1–1)(–j)

TM
p12(1) = 0
=0
g2(0) = 2 p21(0)= g2(0) + g2(2)

= 2 –j2
 p21(0) = 2–j2
g2(1) = 0.707–j0.707 p21(1)= g2(1) + g2(3)

= 0.707–j0.707–0.707 –j0.707  p21(1) = –j1.414
= –j1.414
0

W8 = 1 0
g2(2) = –j2 p22(0)= [g2(0) – g2(2)]W8
–1 p22(0) = 2+j2
= [2–(–j2)]1 
2
= 2 + j2
g 1 ( n) and g 2 ( n)
W8 = –j 1
g2(3) = –0.707–j0.707 p22(1)= [g2(1)–g2(3)]W8
–1 = [0.707–j0.707+0.707+j0.707](–j) p (1) = –j1.414
= –j1.414  22
g 1 ( n) and g 2 ( n)
Signal flow graph for
Inputs Calculations
calculation of 2-point DFT
p11(0) = 4 X(0) = p11(0) + p11(1)

= 4+2  X(0) = 6
0 =6
W8 = 1 0
p11(1) = 2 X(4) = [p11(0) – p11(1)] W8
–1
= (4–2)1  X(4) = 2
=2
p 11 ( n), p 12 ( n) p 21 ( n) and p 22 ( n)
p12(0) = 0 X(2) = p12(0) – p12(1)

= 0+0  X(2) = 0
0 =0
g 1 ( n) and g 2 ( n)
W8 = 1 0
p12(1) = 0 X(6)= [p12(0) – p12(1)]W8
–1
= (0–0)1 X(6) = 0
TM

=0
p21(0) = 2–j2 X(1) = p21(0) + p21(1)
= 2 –j2–j1.414  X(1) = 2–j3.414
0 = 2–j3.414
W8 = 1 0
p21(1) = –j1.414 X(5) = [p21(0) – p21(1)]W8
–1  X(5) = 2–j0.586
g 1 ( n) and g 2 ( n)
= [2–j2–(–j1.414)]1
= 2–j0.586

p22(0) =2+j2 X(3) = p22(0) + p22(1)
g 1 ( n) and g 2 ( n)
X(3) = 2+j0.586
= 2+j2–j1.414 
0 = 2 + j 0.586
W8 = 1 0
p22(1) = – j1.414 X(7) = [p22(0) – p22(1)]W8
–1
= [2+j2–(–j1.414)]1 X(7) = 2+j3.414

= 2+j3.414
x(0) = 2 g1(0) = 2 p11(0) = 4 X(0) = 6
0
W8
x(1) = 1 g1(1) = 1 p11(1) = 2 X(4) = 2
–1
0
W8
x(2) = 2 g1(2) = 2 p12(0) = 0 X(2) = 0
–1
2 0
W8 W8
x(3) = 1 g1(3) = 1 p12(1) = 0 X(6) = 0
–1 –1
0
W8
x(4) = 0 g2(0) = 2 p21(0) = 2–j2 X(1) = 2–j3.414
TM
–1
1 0
W8 W8
x(5) = 0 g2(1) = 0.707–j0.707 p21(1) = –j1.414 X(5) = 2–j0.586
–1 –1
2 0
W8 W8
x(6) = 0 g2(2) = –j2 p22(0) = 2 + j2 X(3) = 2+j0.586
–1 –1
3 2 0

W8 W8 W8
x(7) = 0 g2(3) = –0.707–j0.707 p22(1) = –j1.414 X(7) = 2+j3.144
–1 –1 –1
Fig. 1.16.4 Signal flow graph of example 1.16.1 It shows computation of DFT
using DIF-FFT algorithm. Input sequence, output DFT and intermediate
results are shown in the above diagram
x ( n)
X ( 0)  6 
X (1)  2  j 3.414 

X ( 2)  0 

X ( 3)  2  j 0.586 

X ( 4)  2 
X (5)  2  j 0.586 

X ( 6)  0 
X (7)  2  j 3.414 
1 0  n  7

 0 otherwise
Bit reversed Stage - 1 Stage - 2 Stage - 3 calculations or

input calculations calculations final output
x(0) = 1 x(0) + x(4) 2+2=4 4+4=8

=1+1=2
x(4) = 1 x(0) – x(4)

=1–1=0
0 + (– j) 0 = 0 0+ ( 12 – j 12 ( 0 = 0
x(2) = 1 x(2) + x(6) 2–2=0 0 + (– j) 0 = 0
=1+1=2
x(6) = 1
x(2) – x(6)
=1–1=0
0 – (– j) 0 = 0 0+–
1
2
(–j
1
2
0=0 (
x(1) = 1 x(1) + x(5) 2+2=4 4–4=0
=1+1=2
x(5) = 1 x(1) – x(5)

=1–1=0
0 + (– j) 0 = 0 0– ( 12 – j 12 ( 0 = 0
x(3) = 1 x(3) + x(7) 2–2=0 0 – (– j) 0 = 0
=1+1=2
x(7) = 1 x(3) – x(7)

=1–1=0
0 – (– j) 0 = 0 0–– ( 1
2
–j
1
2
0=0 (
TM

x(0) = 1 2 4 X(0) = 8
0
W8 = 1
x(4) = 1 0 0 X(1) = 0
–1
0
W8 = 1
x(2) = 1 2 0 X(2) = 0
–1
0 2
W8 = 1 W8 = – j
x(6) = 1 0 0 X(3) = 0
–1 –1
0
W8
x(1) = 1 2 4 X(4) = 0
–1
0 1
W8 = 1 W8
x(5) = 1 0 0 X(5) = 0
–1 –1
0 2
W8 = 1 W8
x(3) = 1 2 0 X(6) = 0
–1 –1
0 2 3
W8 = 1 W8 = – j W8
x(7) = 1 0 0 X(7) = 0
–1 –1 –1
Input Stage - 1 calculations Stage - 2 calculations Stage - 3 calculations

or final output
x(0) = 1 x(0) + x(4) = 1 + 1 = 2 2+2=4 4+4=8
x(1) = 1 x(1) + x(5) = 1 + 1 = 2 2+2=4 4–4=0
x(2) = 1 x(2) + x(6) = 1 + 1 = 2 (2 – 2) (1) = 0 0+0=0
x(3) = 1 x(3) + x(7) = 1 + 1 = 2 (2 – 2) (–j) = 0 0–0=0

0
x(4) = 1 [x(0) – x(4)] W8
0+0=0 0+0=0
= (1 – 1) × 1 = 0
1
x(5) = 1 [x(1) – x(5)] W 8 0+0=0 0–0=0
= (1 – 1) )1–j 1
2 2
=0 )
2
x(6) = 1 [x(2) – x(6)]W 8 (0 – 0) (1) = 0 0+0=0
= (1 – 1) (– j) = 0
3
x(7) = 1 [x(3) – x(7)]W 8
(0 – 0) (–j) = 0 0+0=0
)1
= (1 – 1) – – j
2
1
2
=0 )
TM

x(0) = 1 2 4 X(0) = 8
x(1) = 1 2 4 X(4) = 0
–1
0
W8
x(2) = 1 2 0 X(2) = 0
–1
2
W8
x(3) = 1 2 0 X(6) = 0
–1 –1
0
W8
x(4) = 1 0 0 X(1) = 0
–1
1
W8
x(5) = 1 0 0 X(5) = 0
–1 –1
2 0
W8 W8
x(6) = 1 0 0 X(3) = 0
–1 –1
3 2
W8 W8
x(7) = 1 0 0 X(7) = 0
–1 –1 –1
 n for 0 n7

 0 otherwise
x x x x x x x x
TM

x(0) = 0 4 12 X(0) = 28
0
W8
x(1) = 1 5 16 X(4) = – 4
–1
0
W8
x(2) = 2 8 –4 X(2) = –4+j4
–1
2 0
W8 W8
x(3) = 3 10 j4 X(6) = –4–j4
–1 –1
0
W8
x(4) = 4 –4 –4+j4 X(1) = –4+j9.656
TM
–1
1 0
W8 W8
x(5) = 5 –2.828+j2.828 j5.656 X(5) = –4–j1.656
–1 –1
2 0
W8 W8
x(6) = 6 j4 –4–j4 X(3) = – 4+j1.656
–1 –1

3 2 0
W8 W8 W8
x(7) = 7 2.828+j2.828 j5.656 X(7) = – 4 – j9.656
–1 –1 –1
0 1
W8 = 1, W8 = 0.707– j0.707
2 3
W8 = –j, W8 = – 0.707– j0.707
x(0) = 1 2 4 X(0) = 8
0
W8
x(1) = 1 2 4 X(4) = 0
–1
0
W8
x(2) = 1 2 0 X(2) = 0
–1
2 0
W8 W8
x(3) = 1 2 0 X(6) = 0
–1 –1
0
W8
x(4) = 1 0 0 X(1) = 0
–1
1 0
W8 W8
x(5) = 1 0 0 X(5) = 0
–1 –1
2 0
W8 W8
x(6) = 1 0 0 X(3) = 0
–1 –1
3 2 0
W8 W8 W8
x(7) = 1 0 0 X(7)= 0
–1 –1 –1
TM

x(0) = 1 g1(0) = 6 p11(0) = 16 X(0) = 36
0
W8
x(1) = 2 g1(1) = 8 p11(1) = 20 X(4) = – 4
–1
0
W8
x(2) = 3 g1(2) = 10 p12(0) = – 4 X(2) = – 4+j4
–1
0
2 W8
W8
x(3) = 4 g1(3) = 12 p12(1) = j4 X(6) = – 4 – j4
–1 –1
TM
W8
x(4) = 5 g2(0) = – 4 p21(0) = – 4+j4 X(1) = – 4+j9.656
–1
1 0
W8 W8
x(5) = 6 g2(1) = –2.828+j2.828 p21(1) = j5.656 X(5) = – 4 – j1.656
–1 –1
2 0
W8 W8
x(6) = 7 g2(2) = j4 p22(0) = – 4 – j4 X(3) = – 4 + j1.656

–1 –1
3 2 0
W8 W8 W8
x(7) = 8 g2(3) = 2.828+j2.828 p22(1) = j5.656 X(7) = – 4 – j9.656
–1 –1 –1
Fig. 1.16.8 Signal flow graph of Ex 1.16.4


sin n  0 n7
2 
x( n)  0, 1, 0,  1, 0, 1, 0,  1 
TM

X 6
X 4
X 2
X 0
0
0
j4
x(0) = 1 X(0)
 j4
5 10 20
0
W8
x(1) = 2 5 10 0 X(4)
–1
0
W8
x(2) = 3 5 0 0 X(2)
–1
2 0
W8 W8
x(3) = 4 5 0 0 X(6)
–1 –1
0
W8
x(4) = 4 –3 –3–j – 5.828 – j2.414 X(1)
TM
–1
1 0
X7 0
X5 0
X 3 0
W8 W8
X1 0
x(5) = 3 – 0.707 + j 0.707 – 2.828 – j1.414 – 0.172 – j0.414 X(5)

–1 –1
2 0
W8 W8
x(6) = 2 –j –3+j – 0.172 + j0.414 X(3)
–1 –1
3 2 0
W8 W8 W8
x(7) = 1 – 2.121 – j2.121 2.828 – j1.414 – 5.828 + j2.414 X(7)
–1 –1 –1

Fig. 1.16.11 DIF - FFT algorithm
 X ( k)
x p ( n)
x p ( n) DFT
 X 1 ( k)
N
x p ( n) DFT
 X 3 ( k)
3N
X 1 ( k) X 3 ( k)
x p ( n) {...1, 2, 1, 2 , 1, 2, ... }

N 1
X 1 ( k)  nk
x p ( n) W N
n 0
3N  1
X 3 ( k)  x p ( n) W 3nkN
n 0
N 1 2N  1 3N  1
X 3 ( k)  x p ( n) W 3knN  x p ( n) W 3nkN  x( n) W 3nkN
n 0 n N n  2N
N 1 N 1 N 1
( n N ) k ( n 2 N ) k
 x p ( n) W 3nkN  x p (n  N) W 3 N  x p ( n  2N ) W 3 N
n 0 n 0 n 0
x p ( n)
x p ( n) x p (n  N) x p ( n  2N )
N 1 N 1 N 1
 x p ( n) W 3nkN  x p ( n) W 3nkN W 3Nk
N  x p ( n) W 3nkN W 32N
Nk
n 0 n 0 n 0
W 2nN n/ 2
WN
kN
WmN Wmk
TM

N 1 N 1 N 1
n 3k n 3k n 3k
 x p ( n) W N  x p ( n) W N W 3k  x p ( n) W N W 32 k
n 0 n 0 n 0
N 1
n 3k
 x p ( n) [1  W 3k  W 32 k ]W N
n 0
k
X 3 ( k) [1  W 3k  W 32 k ] X 1  
3
x p ( n) {...1, 2 , 1, 2, 1, 2, ...}

x p ( n)
X 1 ( k) DFT {x p ( n)} N 2
X 1 ( k)
x p ( n)
X 3 ( k) DFT {x 3 ( n)} N  6
X 3 ( k)
X 3 ( k) 3X 1 ( k 3)
X 3 ( k) [1  W 3k  W 32 k ] X 1 ( k 3)
X 1 ( k)
X 3 ( 0) [1  W 30  W 30 ] X 1 ( 0)
3X 1 ( 0)
X 3 (1) [1  W 31  W 32 ] X 1 (1 3) X 1 (1 3)
X 3 ( 2) [1  W 32  W 34 ] X 1 ( 2 3) X 1 ( 2 3)
X 3 ( 3) [1  W 33  W 36 ] X 1 ( 3 3)
[1  1  1] X 1 (1) W 33  1
3X 1 (1) W 36  1
X 1 (1)  1
TM

X 3 ( 4) [1  W 34  W 38 ] X 1 ( 4 3) X 1 ( 4 3)  0
X 3 (5) [1  W 35  W 310 ] X 1 (5 3) X 1 (5 3)  0
X 3 ( k)
x( n)
W 40 W 41
x(0) = 0 2 X(0) = 6
0
W4 = 1
x(2) = 2 –2 X(1) = – 2 + j2
–1
0
W4 = 1
x(1) = 1 4 X(2) = – 2
–1
0 1
W4 = 1 W4 = –j
x(3) = 3 –2 X(3) = – 2 – j2
–1 –1
X(0) = 0 2 x(0) = 6
0
W4 = 1
X(1) = 1 4 x(2) = – 2
–1
0
W4 = 1
X(2) = 2 –2 x(1) = – 2 + j2
–1
1 0
W4 = – j W4 = 1
X(3) = 3 j2 x(3) = – 2 – j2
–1 –1
 6, –2  j 2, – 2, –2 – j 2

TM

0  n 7
0
 
X k   0, 0, 4, 0, 0, 0, 0, 4
X( k)  0, 2  j2,  j4, 2  j2, 0
x 1  n  1, 2, 1, 2, 4, 2, 1, 2 
TM

N 1
 x(n) W Nkn
n 0
1 N 1
N  X(k) W N kn
k0
W N kn
W8
x k   36, –4  j 9.656, – 4  j 4,
– 4  j 1.656, – 4, –4 – j 1.656
– 4 – j 4, – 4 – j9.656
TM

Computation of
2- point sequences Combine 2-point sequences Combining 4 point sequences
1/N = 1/8
X(0) v11(0) f1(0) x(0)
–0 –0
W2 = W8 1/N = 1/8
X(4) v11(1) f1(1) x(1)
–1
–0 –0
W4 = W8 1/N = 1/8
X(2) v12(0) f1(2) x(2)
–1
–0 –0 –1 –2
W2 = W8 W4 = W8 1/N = 1/8
X(6) v12(1) f1(3) x(3)
–1 –1
–0
W8 1/N = 1/8
X(1) v21(0) f2(0) x(4)
TM
–1
–0 –0 –1
W2 = W8 W8 1/N = 1/8
X(5) v21(1) f2(1) x(5)
–1 –1
–0 –0 –2
W4 = W8 W8 1/N = 1/8
X(3) v22(0) f2(2) x(6)
–1 –1

–0 –0 –1 –2 –3
W2 = W8 W4 = W8 W8 1/N = 1/8
X(7) v22(1) f2(3) x(7)
–1 –1 –1
Final outputs are

multiplied by '1/N'
DFT in Here N = 8 x(n) in
bit reversed natural order
order Fig. 1.17.1 Alternate version of 8-point Inverse radix-2 DIF-FFT algorithm.
In this algorithm, final outputs are multiplied by 1/N
1/8
X(0) = 36 32 24 x(0) = 1
W –0
8 =1 1/8
X(4) = – 4 40 32 x(1) = 2
–1
W –0
8 =1 1/8
X(2) = – 4 + j4 –8 40 x(2) = 3
–1
W –0
8 =1 W –2
8 =j 1/8
X(6) = – 4 – j4 j8 48 x(3) = 4
–1 –1
–0
W8 =1 1/8
TM
X(1) = – 4 + j9.656 –8 + j8 –16 x(4) = 5
–1
W –0
8 =1 W 8–1 1/8
X(5) = – 4 – j1.656 j11.312 –11.312 + j11.312 x(5) = 6
–1 –1
–2
W –0
8 =1 W8 = j 1/8
X(3) = – 4 + j1.656 –8 – j8 j16 x(6) = 7
–1 –1
–3
W –0 W –2
8 = j W8 1/8
8 =1

X(7) = – 4 – j9.656 j11.312 11.312 + j11.312 x(7) = 8
–1 –1 –1
–2 –3
W –8 0 = 1, W –1
8 = 0.707 + j 0.707, W 8 = j, W 8 = – 0.707 + j 0.707
x  n x  n 1 n 8
X k    7, – 0.707 –j 0.707, – j,0.707 – j 0.707, 1, 0.707  j 0.707, j, – 0.707  j 0.707
X(0)  7 X(4)  1
X(1)  0.707  j 0.707 X(5)  0.707  j 0.707
X(2)   j X(6)  j
X(3)  0.707  j0.707 X(7)  0.707  j 0.707
1, 1, 1, 1, 1, 1, 1, 0
Input Decimation stage - 1 Decimation stage - 2, output

DFT
1 –
X(0) = 6 X(0) + X(2) = 6 – 2 = 4 x(0) = (4 4) = 0
4
X(1) = – 2 + j2 X(1) + x(3) 1 Time domain

x(2) = [4 – (– 4)] = 2
4 sequence
= – 2 + j2 – 2 – j2 = – 4
is decimated
1 Hence it is
[X(0) – X(2)]W 8–0 x(1) =
4
[8 – 4 ] = 1
IDIT - FFT
X(2) = – 2
[6 – (–2)] 1 = 8 algorithm
X(3) = – 2 – j2 1
[X(1) – X(3)] W 8–2 x(3) =
4
[8 – (– 4) ] = 3
= [–2 + j2 – (– 2 – j2)] j = – 4
TM

X(0) = 7 8 8 x(0) = 1
1/8
W –0
8 =1
X(4) = 1 6 8 x(1) = 1
–1 1/8
W –0
8 =1
X(2) = – j 0 8 x(2) = 1
–1 1/8
W –0
8 =1 W –2
8 =j
X(6) = j – j2 4 x(3) = 1
–1 –1 1/8
–0
W8 = 1
TM
X(1) = – 0.707 – j0.707 0 0 x(4) = 1
–1 1/8
–1
W –0
8 =1
W8
X(5) = 0.707 + j0.707 – 1.414 – j1.414 0 x(5) = 1
–1 –1 1/8
–2
W –0
8 =1 W8 = j
X(3) = 0.707 – j0.707 0 0 x(6) = 1
–1 –1 1/8
W –2
8 = j –3
W –0
8 =1 W8

X(7) = – 0.707 + j0.707 1.414 – j1.414 – 2.828 – j 2.828 x(7) = 0
–1 –1 –1 1/8
–0 –1 –2 –3
W8 = 1, W8 = 0.707 + j0.707, W8 = j, W8 = – 0.707 + j0.707
X(0) = 6 4 x(0) = 0
1
4
X(1) = – 2 + j2 –4 x(2) = 2
–1 1
–0 4
W8 =1
X(2) = –2 8 x(1) = 1
–1 1
–2 4
W 8 =j
X(3) = – 2 – j2 –4 x(3) = 3
–1 –1 1
4
1 1 1
x1  n   1, , ,  x 2  n  1,1,1,1
 2 4 8
x 1  n x 2  n
x 1  n x 2  n
 
 
 
 15 3  3 5 3  3 
X 1 ( k)  8 , 4 j 8 , 8 , 4 j 8  , X 2 (k)  {4, 0, 0, 0}
 
x1 (n)  {1,2,0,1}, x 2 (n)  {1,3,3,1} x 1 ( n) x 2 ( n)
X ( k)
X (0)  0, X (1)  2  j2, X (2)   j4, X (3)  2  j2, X (4)  0

x ( n)
X ( k)
TM

4v
These are basically powers of

0
F1(0) W16. Here '0' means W16 0
x(0) 0
X(0)
0 0
F1(1)
0
x(4) –j X(1)
–1 j
1 3
–1 F1(2) 2 0
x(8) X(2)
2
–1
j 6
F1(3) 4
–1 0
x(12) X(3)
–j 3
6 9
F2(0) 0
x(1) 4
X(4)
8 12
F2(1) 0
x(5) –j X(5)
–1
5
j 10 15
F2(2) 0
–1
x(9) X(6)
6
–1
j 12 2
–1
F2(3)
0
x(13) X(7)
–j 7
14 5
F3(0) 0
8
x(2) 0 X(8)
8
F3(1) 0
9
x(6) –j X(9)
–1 2 11
j
F3(2) 0
–1 10
x(10) 4 X(10)
–1 14
j 0
F3(3)
–1 11
x(14) 6 X(11)
–j
1
12
F4(0) 0
8
x(3) 4 X(12)
13
0
F4(1)
10
x(7) –j
3
X(13)
–1 14
j
0
F4(2)
–1 12
x(11) 10
X(14)
–1 15
j 0
F4(3)
–1 14
x(15) X(15)
–j 13
v = 2, Second stage of decimation v = 1, First stage of decimation
TM

42 4v  4 2
f 1 ( m)
f 2 ( m)
f 3 ( m)
N
f 3 ( m)
4
F1 ( 0)  W 0 W 40 W 40 W 40   x( 0)  1 1 1 1   x( 0) 
F (1)   40   x( 4)  1  j  1 j   x( 4) 
W 4 W 41 W 42 W 43 
 1       
F1 ( 2)  W 0 W 42 W 44 W 46   x( 8)  1  1 1  1  x( 8) 
   4       
F1 ( 3)  W 40 W 43 W 46 W 49  x(12)  1 j  1  j  x(12) 
F2 ( k) F3 ( k)
N1
 x( n) W Nkn
n 0
N N N N
1 1 1 1
4 4 4 4
k( 4m  1) k ( 4m  2) k( 4m  3)
 x( 4m) WN4mk   x( 4m  1) WN   x( 4m  2) WN   x( 4m  3) WN
m0 m0 m0 m0
N N N
1 1 1
4 4 4
 f 1 ( m) (W N4 ) km   f 2 ( m) (W N4 ) km  W Nk   f 3 ( m) (W N4 ) km  W N2 k
m0 m0 m0
N
1
4
  f 4 ( m) (W N4 ) km  W N3 k
m0
TM

N N N
1 1 1
4 4 4
 f 1 ( m)W Nkm4  W Nk  f 2 ( m) W Nkm4  W N2 k  f 3 ( m) W Nkm4
m0 m0 m0
N
1
4
 W N3 k  F4 ( m) W Nkm4
m0
N
4
F1 ( k)  W Nk F2 ( k)  W N2 k F3 ( k)  W N3 k F4 ( k)
0 0 0
F1 ( 0)  W 16 F2 ( 0)  W 16 F3 ( 0)  W 16 F4 ( 0)
1 2 3
F1 (1)  W 16 F2 (1)  W 16 F3 (1)  W 16 F4 (1)
2 4 6
F1 ( 2)  W 16 F2 ( 2)  W 16 F3 ( 2)  W 16 F4 ( 2)
3 6 9
F1 ( 3)  W 16 F2 ( 3)  W 16 F3 ( 3)  W 16 F4 ( 3)
4 8 12
F1 ( 0)  W 16 F2 ( 0)  W 16 F3 ( 0)  W 16 F4 ( 0) F1 ( 4)  F1 ( 0), F2 ( 4) F2 ( 0)
5 10 15
F1 (1)  W 16 F2 (1)  W 16 F3 (1)  W 16 F4 (1) F1 (5)  F1 (1), F2 (5) F2 (1)
6 12 2
F1 ( 2)  W 16 F2 ( 2)  W 16 F3 ( 2)  W 16 F4 ( 2) F1 ( 6)  F1 ( 2), F2 (5) F2 ( 2)
18  W 2
W 16 16
7 14 5
F1 ( 3)  W 16 F2 ( 3)  W 16 F3 ( 3)  W 16 F4 ( 3) F1 (7)  F1 ( 3), F2 (7) F2 ( 3)
21  W 5
W 16 16
8 0 8
F1 ( 0)  W 16 F2 ( 0)  W 16 F3 ( 0)  W 16 F4 ( 0) F1 ( 8)  F1 ( 0), F2 ( 8)  F2 ( 0)
16  W 0 W 24  W 8
W 16 16 16 16
TM

4v
Ym ( k)
y m ( k)
N log 2 2 N
L
2 N log 2 2 N
L
TM

 n
h n T   n 
x n
y n x n  h n
 
y n  x k  h n  k   h k  x n  k 
k  k 
y n x n  h n
y n x n  x n  1  y n  1
y n x n  x n  1
TM

x n  M x   y n  M y  

 h k  
k  
Fs  2B Fs
' B'
h( n) n 0
n
 1
  u(n )
n  2
x( n)  1  u( n)
 
2
2
   1 n 
 |x( n)|2    
n  n 0  2  
n
  1  2  1 4
   
 2   3
2
1
1   
n 0
2
TM

|z| r
|z| r
Input Discrete time Output

x(n) system y(n)
h(n)
X ( k) X( Z) z j 2k / N
k e
TM

 y(0)  h(0) h(2) h(1)  x(0)  1 2 2 1   3 
 y(1)  h(1) h(0) h(2)  x(1)  2 1 2  2   2 
         
 y(2)  h(2) h(1) h(0)  x(2)   2 2 1  1  1
XN [W N ] x N
 X4 [W 4 ] x 4
1 1 1 1   1 1  1 1 1   0 
1  j 1 j   1 1  j 1  j  2  j2
       
1 1 1 1  1 1 1 1 1   0 
       
1 j 1  j  1 1  j 1  j  2  j 2
2k
1 
xN [W N ] XN
N

[W N ] X4 ,
1 1 1 1  1  1  0  1  0 0.5
1 j  1  j  0   1  0   0
1     1 1 0
  
x4
4 1  1 1  1 1  4 1  0  1  0 0.5
       
1  j  1 j  0 1  0  1  0  0
TM

X4 W4 x 4
X( 0)  1 1 1 1  1   2 
X(1)  1 j 1 j  1  1  j 
       
X( 2)  1 1 1 1 0  0 
X( 3)  1 j 1 j  0 1  j
       
DFT
N

x(n) e j 2ln/ N DFT

N
 X(( k – l)) N
X ( z ) z  e j 


TM

N1
X ( k)  x( n)W Nkn k  0,1, ........... N  1
n 0
N 1
1
x( n)
N  X( k)W N kn n  0,1 ................. N  1
k0
DFT DFT
x 1 ( n)  X 1 ( k) x 2 ( n)  X 2 ( k)
N N
DFT
x 1 ( n) N x 2 ( n)  X 1 ( k)  X 2 ( k)
N
x 1 ( n) x 2 ( n)
DFT
x( n)  X( k)
N
DFT
x(( n  l)) N  X( k) e  j 2l N
N
e  j 2kl N
W80 W80 (–1)W82 

1  1  (–1)  (– j)
TM

r
a A = a + WN b
r
WN r
b B = a – WN b
–1

[W 4 ] x 4
X( 0)  1 1 1 1  1  0
X(1)  1 j –1 – j   0  2
      
X( 2)  1 –1 1 –1  –1 0
      
X( 3)  1 – j – 1 j   0  2
r a
a A = a + WN b A = a +b
r
WN
r W r
r N
b B = a – WN b b B = (a – b) W
–1 –1 N
(a) (b)
a A = a +b
r
W
N r
r b B = (a – b) W
WN –1 N
TM

x(n)
n2 n1n0
n0 n1n2 x( 0) x(1) x( 2) x( 3) x( 4) x(5) x( 6) x(7)
x( 0), x( 4), x( 2), x( 6), x(1), x(5), x( 3), x(7)
X( k)
N 32
log 2 N log 2 32
2 2
N
log 2 N
2
N log 2 N
TM

2
j
WN e N
2 3
j 2   j 2p 
N 3 j 3 e N 
WN e e N WN3
 
3  
log 10 32
 log 2 N log 2 32
log 10 2
–1 1 1
 (n  1)   (n ) –  (n – 1)
4 2 4
1 1 1
 h ( n)   
4 2 4

h ( n)  h 0 h ( n)
x (n) h (n) M
N N M  L 1

x ( n)
   
   
x 1 ( n)  x ( 0), x (1), ... x ( L  1) 0, 0, ... 0   x ( 0), x (1), ... x (14), 0, 0, ... 0
 first L samples of x ( n) ( m 1) zeros   49 zeros 
   
x 1 (n), x 2 (n), x 3 (n), ... x (n)
TM

sin x (n )
 y ( n) x ( n)
sin ( )
N
X ( k) X ( ) 2
 k
N
X ( k) [W 4 ] x 4
 X ( 0)  1 1 1 1   1  0
 X (1)   1 j 1  j   1  0
        
 X ( 2)   1  1 1 1   1  4 
       
 X ( 3)   1  j 1 j   1  0
2
j
WN e N
N 1 N 1
X ( k)  x (n) W Nkn  x (n) e  j 2 kn/ N
n 0 n 0
TM

Ec8553 - Dtsp - Unit i

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Ec8553 - Dtsp - Unit i

Uploaded by

Copyright:

Available Formats

z

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

Analog Antialiasing Digital

TECHNICAL PUBLICATIONS - An up thrust for knowledge

x 1 (t)  cos 2 (10) t

x 2 (t)  cos 2 (50) t

x 3 (t)  cos 2 ( 90) t

x 4 (t)  cos 2 (130) t

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

x ( n) {5, 7 , 20, 3, 5}  0th

k  1 and N  200 'f'

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

x(n) x(n  1) x(n  1)

(a) Original sequence (b) Delay by (c) Advance by

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

T {a 1 x 1 ( n)  a 2 x 2 ( n)} a 1 T { x 1 ( n)}  a 2 T { x 2 ( n)}

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

' n' cos  0 n ( n  k) ' cos  0 n'

' n' ( n  k) x ( n) and cos  0 n

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

x(t – t 0 )  h(t) x(t)  h(t – t 0 )

TECHNICAL PUBLICATIONS - An up thrust for knowledge

 y 1  xk h1 – k  1  2  1  2  1  0  1  0 0 1 k

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

–3 –3 0 –3 –3 x This digit is marked zero or

1 1 0 1 1 x x x ‘–2’ multiplies samples in x(n)

TECHNICAL PUBLICATIONS - An up thrust for knowledge

... h ( 2) x ( n  2)  h ( 1) x ( n  1)  h ( 0) x ( n)  h (1) x ( n  1)  ...

... h ( 2) h ( 1)

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

X ( z) 3Z 4n u (n) 4 Z 2n u (n)

| z| 4 | z| 2 | z| 4

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge

TECHNICAL PUBLICATIONS - An up thrust for knowledge