Beruflich Dokumente
Kultur Dokumente
B.P.U.T., BHUBANESWAR
Department of ELECTRICAL Engineering
Semester 5th Sheet No. aaaaaa aaaaaaaa
EXPERIMENT NO – 6
SOFTWARE REQUIRED:
MATLAB R2017b
THEORY:
A fast Fourier transform (FFT) is an algorithm that samples a signal over a period of time (or space) and divides
it into its frequency components. An FFT algorithm computes the discrete Fourier transform (DFT) of a
sequence, or its inverse (IFFT). Fourier analysis converts a signal from its original domain to a representation
in the frequency domain and vice versa. FFTs can be decomposed using DFTs of even and odd points, which is
called a Decimation-In-Time (DIT) FFT, or they can be decomposed using a first-half/second-half approach,
which is called a “Decimation-In-Frequency” (DIF) FFT.
A twiddle factor, in fast Fourier transform (FFT) algorithms, is any of the trigonometric constant coefficients
that are multiplied by the data in the course of the algorithm.
Decimation in frequency
The radix-2 decimation-in-frequency algorithm rearranges the discrete Fourier transform (DFT) equation into
two parts: computation of the even-numbered discrete-frequency indices X(k) for k=[0,2,4,…,N−2] (or X(2r)
and computation of the odd-numbered indices k=[1,3,5,…,N−1] or X(2r+1) )
Date :
COLLEGE OF ENGINEERING AND TECHNOLOGY
B.P.U.T., BHUBANESWAR
Department of ELECTRICAL Engineering
Semester 5th Sheet No. aaaaaaa aaaaaaaaaa
Decimation in time
DIT algorithm is used to calculate the DFT of a N-point sequence. The idea is to break the N-point sequence
into two sequences, the DFTs of which can be obtained to give the DFT of the original N-point sequence.
Date :
COLLEGE OF ENGINEERING AND TECHNOLOGY
B.P.U.T., BHUBANESWAR
Department of ELECTRICAL Engineering
Semester 5th Sheet No. aaaaaaa aaaaaaaaa
Fig. 6.1a – Command Window Display of Output Sequence of DIF FFT of the given Sequence
Date :
COLLEGE OF ENGINEERING AND TECHNOLOGY
B.P.U.T., BHUBANESWAR
Department of ELECTRICAL Engineering
Semester 5th Sheet No. aaaaaaaa aaaaaaaaa
Fig. 6.1b – Stem Plot of Input Sequence x(n), amplitude and phase plots of DIF FFT Output Sequence
Date :
COLLEGE OF ENGINEERING AND TECHNOLOGY
B.P.U.T., BHUBANESWAR
Department of ELECTRICAL Engineering
Semester 5th Sheet No. aaaaaaaa aaaaaaaaa
end
Half=2*Half;
end
y=x1
magnitude=abs(y)
phase=angle(y)
Fig. 6.2a – Command Window Display of Output Sequence of DIT FFT of the given Sequence
Date :
COLLEGE OF ENGINEERING AND TECHNOLOGY
B.P.U.T., BHUBANESWAR
Department of ELECTRICAL Engineering
Semester 5th Sheet No. aaaaaaaa aaaaaaaaa
Fig. 6.2b – Stem Plot of Input Sequence x(n), amplitude and phase plots of DIT FFT Output Sequence
CONCLUSION:
Hence, in this experiment, for the given input sequence 𝑥(𝑛) = [ 1 , 2 , 0 , 3 ], the output for FFT by DIF
method was found to be 𝑦(𝑘) = [ 6 , 1 + 𝑗 , −4 , 1 − 𝑗 ]. The magnitude and phase of the output sequence
was found to be 𝑦(𝑘) = [6∠𝟎°, 1.4142∠𝟒𝟓°, 0∠𝟏𝟖𝟎°, 1.4142∠ − 𝟒𝟓°]. Also, the FFT of the same
sequence by DIT method was found to be 𝑦(𝑘) = [ 6 , 1 + 𝑗 , −4 , 1 − 𝑗 ]. The magnitude and phase of
the output sequence was found to be 𝑦(𝑘) = [6∠𝟎°, 1.4142∠𝟒𝟓°, 0∠𝟏𝟖𝟎°, 1.4142∠ − 𝟒𝟓°].
Date :