Abstract
The Discrete Fourier Transform (DFT) is one of the fundamental operations in digital signal processing. This paper presents a software based implementation of a less known observer based Recursive DFT on a PC ×86 architecture and on a Microchip PIC30 microcontroller. The results are compared with an efficient/optimized Fast Fourier Transform (FFT) implementation. Both algorithms require complex operations with real valued adders and multipliers, thus a complex result has to be calculated separately for the real and imaginary parts. During the implementation floating-point and fixed-point number representation is applied. The comparison is performed based on the required resources and the computational time.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
