next up previous contents
Next: Zero padding Up: Short-Term Fourier Analysis  Previous: Windowing

The short-term Fourier transform

First extract N samples of speech starting at tex2html_wrap_inline2919 and then window:


Now apply the DFT.

The result is continuous, but it can be sampled at n points without loss of information.

This equation defines an algorithm that takes an array of N complex numbers (or equivalently an array of N real numbers and N imaginary numbers) and returns an array of N complex numbers.

The inverse short-term DFT can be similarly defined:

Speech Vision Robotics group/Tony Robinson