09-05-2014, 10:42 AM
CIRCULAR FOLDING PROPERTY OF DFT
AIM
To verify the circular folding property of one dimensional DFT.
THEORY
Folding in the time domain corresponds to the folding in frequency domain.
DFT [ x((-n))N ] = X((-k))N
x((-n))N is the folded time domain digital signal , where N is the order of signal. X((-k))N. is the folded frequency domain signal.
OBSERVATIONS
enter sequence[1 2+5i 6-7i 3-i 3+9i 5-7i]
a =
16.0000 -2.4641 - 2.0000i 16.2487 + 5.1962i 4.0000 + 4.0000i -32.2487 - 5.1962i 4.4641 - 2.0000i
p =
16.0000 4.4641 - 2.0000i -32.2487 - 5.1962i 4.0000 + 4.0000i 16.2487 + 5.1962i -2.4641 - 2.0000i
q =
16.0000 4.4641 - 2.0000i -32.2487 - 5.1962i 4.0000 + 4.0000i 16.2487 + 5.1962i -2.4641 - 2.0000i
RESULT
Program for circular folding property of DFT is executed and the property is verified.. The magnitude and phase plot of the equation “ DFT [ x((-n))N ] = X((-k))N.” is plotted.