Follow us on:
Subscribe Twitter Facebook

Wednesday, March 03, 2010

FFT Ap Note

This ap note shows the results and design methodology for a high-performance DSP sample application on the Xtensa microprocessor using a widely known example, the Fast Fourier Transform (FFT). This note first explains the basic algorithm and how several TIE language instructions were created to implement the FFT algorithm. Performance results follow, with a comparison of implementations of the radix-2 decimation-in-frequency FFT with and without additional TIE language extensions.