Depanwita Sarkar Debnath

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
The Fast Fourier Transform (FFT) is an efficient algorithm for computing the Discrete Fourier Transform (DFT) and requires less number of computations than that of direct evaluation of DFT. It has several applications in signal processing. Because of the complexity of the processing algorithm of FFT, recently various FFT algorithms have been proposed to(More)
The sensitivity of human ear is dependent on frequency which is nonlinearly resolved across the audio spectrum .Now to improve the recognition performance in a similar non linear approach requires a front-end design, suggested by empirical evidences. A popular alternative to linear prediction based analysis is therefore filter bank analysis since this(More)
  • 1