Skip to main content

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.

Comments

  1. oh..if there is compression in frequency domain..resolution of the spectrum would also increase.

    ReplyDelete
    Replies
    1. Yes and compression in frequency domain would result in expansion in time domain.

      Delete
  2. The DFT is the most important discrete transform, used to perform Fourier analysis in many practical applications

    ReplyDelete
  3. This Method namely the Dft has more calculations and therefore it is slower than FFT computationaly

    ReplyDelete
  4. DFT needs a lot of calculations to be done hence we use FFT which reduces calculations

    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.

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.