Fast Fourier Transform

In this experiment we take 4 point signal x(n) and find X[K] using FFT algorithm.
For 4 point 

                                            DFT                                      FFT
Complex multiplication          16                                         4
Complex addition                  12                                         8
Real multiplication                 64                                        16
Real addition                        56                                        24
It was observed that using FFT the computations were reduced as compared to DFT. This increases the speed of processing.