Tuesday, 14 March 2017

FFT

We performed Fast fourier transform in 3rd experiment . In FFT,The procedure of  performing the butterfly computations and returning the result to memory is repeated many times .this repetition takes place ( (N log2 (N))/2 times ) in the computation of an N-point DFT. For DSP processor radix 2 or 4 decimation in frequency, FFT algorithm are preferable in terms of speed and accuracy. 

3 comments:

  1. Precise and easy to understand

    ReplyDelete
  2. Obvious calculations are avoided by these algorithms avoiding unnecessary memory space for storage. That's why it is fast.

    ReplyDelete

DSP application on one dimensional signal

Patent Review : Pulse width modulation control unit of inverter. Application No: 89303871.1 Patent No:033878B1 Date of patent:18.04.89 ...