09-05-2014, 10:40 AM
CIRCULAR FOLDING OF A SEQUENCE
AIM
To verify the circular folding of a sequence.
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+6i 5-8i 4+3i 2 7-8i]
y =
1.0000 7.0000 - 8.0000i 2.0000 4.0000 + 3.0000i 5.0000 - 8.0000i 2.0000 + 6.0000i
RESULT
Program for circular folding of a sequence is executed.