Using your phone's internet browser
go to:
Click and drag this link to
the Home icon in your browser.

Will U plz telll me about DFT and IDFT and their practical applications?

Asked by Bikash, 28 Mar '09 11:33 am
  Invite a friend  |  
  Save  |  
 Earn 10 points for answering
Answer this question  Earn 10 points for answering    
4000 characters remaining  
Keep me signed inNew User? Sign up

Answers (1)


In mathematics, the discrete Fourier transform (DFT) is one of the specific forms of Fourier analysis. It transforms one function into another, which is called the frequency domain representation, or simply the DFT. Since the input function is a finite sequence of real or complex numbers, the DFT is ideal for processing information stored in computers. In particular, the DFT is widely employed in signal processing and related fields to analyze the frequencies contained in a sampled signal, to solve partial differential equations, and to perform other operations such as convolutions. The DFT can be computed efficiently in practice using a fast Fourier transform (FFT) algorithm.

inverse discrete Fourier transform (IDFT)
Answered by Krishnakumar G. Nair, 28 Mar '09 06:12 pm

Report abuse
Not Useful
Your vote on this answer has already been received

Ask a Question

Get answers from the community

600 characters remaining

Related Answer


Your fasting ends in quarreling and strife, and in striking each other with wicked fists. You cannot fast as you do today and expect..more

Answered by sam raj