Global Sources
EE Times-India
Stay in touch with EE Times India
EE Times-India > Processors/DSPs

Fast Fourier Transform for Xtensa processor

Posted: 03 Oct 2008     Print Version  Bookmark and Share

Keywords:Fast Fourier Transform  FFT  Xtensa microprocessor  DSP 

One of the most widely used algorithms in digital signal processing applications is the Fast Fourier Transform (FFT), which covers a family of techniques for computing the Discrete Fourier Transform (DFT). The FFT is a large class of algorithms applicable to a variety of signal processing applications such as audio, video, and speech.

The goal of this application note is to show the results and design methodology for a high-performance DSP sample application on the Xtensa microprocessor using a widely known example, the 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.

View the PDF document for more information.

Comment on "Fast Fourier Transform for Xtensa pr..."
*  You can enter [0] more charecters.
*Verify code:


Visit Asia Webinars to learn about the latest in technology and get practical design tips.


Go to top             Connect on Facebook      Follow us on Twitter      Follow us on Orkut

Back to Top