Scribd
Upload
38 views

10.properties of DFT

The document outlines several key properties of the discrete Fourier transform (DFT): 1. The DFT is a linear transformation - the DFT of a sum of signals is equal to the sum of the individual DFTs. 2. For real signals, the DFT is even for the real part and odd for the imaginary part. For imaginary signals, the opposite is true. 3. A time shift in the signal results in a phase shift in the frequency domain. A frequency shift in the signal results in a shift of the spectrum. 4. Convolution in the time domain is equivalent to multiplication in the frequency domain under the DFT.

Uploaded by

هاشم عبدالكريم
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
38 views

10.properties of DFT

The document outlines several key properties of the discrete Fourier transform (DFT): 1. The DFT is a linear transformation - the DFT of a sum of signals is equal to the sum of the individual DFTs. 2. For real signals, the DFT is even for the real part and odd for the imaginary part. For imaginary signals, the opposite is true. 3. A time shift in the signal results in a phase shift in the frequency domain. A frequency shift in the signal results in a shift of the spectrum. 4. Convolution in the time domain is equivalent to multiplication in the frequency domain under the DFT.

Uploaded by

هاشم عبدالكريم
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

Properties of DFT

1. Linearity:

For x [n ] ⎯⎯
DFT
→ X [k ] and y [n ] ⎯⎯
DFT
→Y [K ]

then
a x [n ] + b y[n] ⎯⎯
DFT
→a X [k ] + b Y[k]

Where a and b are constant


2. Real and Imaginary Signals: For x [n ] ⎯⎯
DFT
→ X [k ]

• If x[n] is a real signal, then

X [k ] = X [−k ]  Re X [k ] = Re X [−k ] even

ImX [k ] = − ImX [−k ] odd

• If x[n] is an imaginary signal, then

X [k ] = −X [−k ]  Re X [k ] = − Re X [−k ] odd

ImX [k ] = ImX [−k ] even


3. Time Shift

For x [n ] ⎯⎯
DFT
→ X [k ] , then

2 n 0
−j
x [n − n 0 ] ⎯⎯
DFT
→e N . X [k ]

4. Frequency Shift:

For x [n ] ⎯⎯
DFT
→ X [k ] , then

2 k 0 n
j
e N . x[n] ⎯⎯
DFT
→ X [k − k 0 ]
5. Convolution:

For x [n ] ⎯⎯
DFT
→ X [k ] and y [n ] ⎯⎯
DFT
→Y [k ] , then

x [n ]  y [n ] ⎯⎯
DFT
→ X [ k ] . Y [k ]

Where the symbol  stands for periodic or cyclic convolution.


6. Parseval’s Theorem:

For x [n ] ⎯⎯
DFT
→ X [k ] , then

 
1 2 2
x [n ] = X [k ]
N n k

The Parseval relationship states that the energy (or power) in the time domain representation
of a signal is equal to the energy (or power) is conserved in the Fourier representation.

Energy in the time domain = Energy in the frequency domain


= energy spectrum
k
2
where energy spectrum = magnitude spectrum
2- Point DFT:

• The general form of a DFT is :

N −1 2 nk
−j
 x [n ] e
1
X [k ] = N
for k=0,1,2,………..,N-1
N n =0

• For a 2-point DFT (N=2), we have


1
X [k ] = x [n ] e− j  nk
2 n =0 for k=0,1

1
X [0] = ( x [0] + x [1])
2
1
(
X [1] = x [0] + x [1] e− j  ) But e − j  = −1
2
1
X [1] = ( x [0] − x [1])
2
X[0]
 X[0]

X[1]
-1  X[1]

You might also like