Skip to main content

EXP 3 - Fast Fourier Transform

Fast Fourier Transform is an algorithm used to compute Discrete Fourier Transform of a sequence. An FFT rapidly computes transformations by factorising the DFT matrix into a product of a sparse factors. As a result the complexity of the computation is reduced.

In this experiment the FFT algorithm was applied to a 4 point and an 8 point sequence. The code was modified to calculate the number of real multiplications and real additions.



Comments

  1. Unknown25 April 2017 at 21:56

    Why is FFT preferred over DFT in practical applications?

    ReplyDelete
    Replies
    1. Unknown25 April 2017 at 22:48

      FFT is preferred over DFT because it is computationally faster.

      Delete
  2. Unknown25 April 2017 at 22:28

    FFT uses Parallel processing

    ReplyDelete
  3. Unknown25 April 2017 at 23:03

    Fast Fourier transforms are widely used for many applications in engineering, science, and mathematics

    ReplyDelete
  4. Meet Patel25 April 2017 at 23:16

    precise

    ReplyDelete
  5. Akash Bangera28 April 2017 at 05:28

    Number of computations in FFT is less than that of DFT. This makes FFT computationally faster.

    ReplyDelete
  6. shrinish_00128 April 2017 at 08:23

    Well wriiten and nice explanation

    ReplyDelete
  7. Unknown28 April 2017 at 10:28

    Parallel processing and less number of computations makes FFT better than DFT.

    ReplyDelete

Post a Comment

Popular posts from this blog

EXP 6 - Chebyshev Filter design

After designing Butterworth filtwr there was another IIR filter that was to be designed and that was Chebyshev Filter. The filter was designed by coding in SCILAB.  Both Low Pass and High Pass Chebyshev filters were designed and the results were verified by manual calculations. Increasing  the sampling frequency increased the  accuracy of the results obtained.
9 comments
Read more

EXP 5 - Butterworth Filter Design

After learning DFT and FFT techniques it was finally time  to start designing filters. We started with IIr filter  design. The first filter that we were going to design was a Butterworth Filter. Butterworth filter  was designed by using SCILAB. The results were verified by running the program and manually solving  using the same set of values. Results for both Low Pass and High Pass Butterworth filter were verified.
9 comments
Read more

EXP 2 - Discrete Fourier Transform

Discrete Fourier Transform is used to transform signal in time domain to frequemcy domain. In this experiment, we ran a C program to find the DFT of a 4 -ponit and an 8-point sequemce. Also, we plotted their magnitude spectrum. From the magnitude spectrum it was observed that expansion of input signal in time domain gives compressed spectrum in frequency domain.
5 comments
Read more