Log in to myMicrochip to access tools and benefits. Sign up in just one minute.
Maximize Your Experience: Reap the Personalized Advantages by Completing Your Profile to Its Fullest. Update Here
Stay in the loop with the latest from Microchip. Update your profile while you are at it. Update Here
Complete your profile to access more resources. Update Here
true
AN542
| Title |
Title
Implementation of Fast Fourier Transforms
|
|---|---|
| Name |
Name
AN542
|
| Date |
Date
06/24/2015
|
| Application Categories |
Application Categories
Algorithms (Building Blocks) /
Digital Filters
Algorithms (Building Blocks) /
Math
|
| Product Categories |
Product Categories
16-bit MCUs
Development Tools /
Matlab
dsPIC DSCs
|
| Description |
Description
Fourier transforms are one of the fundamental operations in signal processing. In digital computations, Discrete Fourier Transforms (DFT) are used to describe, represent, and analyze discrete-time signals. However, direct implementation of DFT is computationally very inefficient. Of the various available high speed algorithms to compute DFT, the Cooley-Tukey algorithm is the simplest and most commonly used. These efficient algorithms, used to compute DFTs, are called Fast Fourier Transforms (FFTs). This application note provides the source code to compute FFTs using a PIC17C42. The theory behind the FFT algorithms is well established and described in literature and hence not described in this application note. A Radix-2 Cooley-Tukey FFT is implemented with no limits on the length of the FFT. The length is only limited by the amount of available program memory space. All computations are performed using double precision arithmetic.
|
Files
Title |
Title |
Date |
Size |
|
|---|---|---|---|---|
| AN542 Source Code - Implementation of Fast Fourier Transforms 39.1 KB 09/24/2021 | AN542 Source Code - Implementation of Fast Fourier Transforms | 09/24/2021 | 39.1 KB | Download |