DSPP experiment 3
Now another method to calculate the dft was using the fft formulae i.e DITFFT formulae
This was our 3rd experiment.This was also done for 4pt and 8pt sequences.The flowchart of this is exactly opposite to that of the DFT whereas the results obtained are faster.The input sequence order is also different and the output is in "BIT Reverse Form".
Also ,the formulae for real and complex multiplications and additions were tested.
The result that was concluded was that FFT is computationally faster than DFT.
This was our 3rd experiment.This was also done for 4pt and 8pt sequences.The flowchart of this is exactly opposite to that of the DFT whereas the results obtained are faster.The input sequence order is also different and the output is in "BIT Reverse Form".
Also ,the formulae for real and complex multiplications and additions were tested.
The result that was concluded was that FFT is computationally faster than DFT.
well written!
ReplyDeleteBIT reverse technique is easy to understand
ReplyDeleteThe BIT reverse technique is used for the memorising of the order
DeleteBIT reverse technique is easy to understand
ReplyDeleteYes .The Bit reverse technique is good for memorising the sequence.
DeleteFFT is used in various applications before processing of signal.
ReplyDeleteYes indeed
DeleteQuite informative.
ReplyDeleteThanks
DeleteWell explained
ReplyDelete