Abstract
In this paper three Real Factor FFT algorithms are presented. Two of them are based on Radix-2 and one on Radix-4. The computational complexity of Radix-2 and Radix-4 is shown as order ~ 41/2Nlog2N and ~ 4 1/8 Nlog2N respectively unlike their standard counterparts ~ 5Nlog2N and ~ 41/4 Nlog2N. Moreover, the proposed algorithms also require fewer multiplications than their standard FFTs. We then show that the fixed point implementation of 'real factor' FFT can be modified, with unique scaling procedure, so that its noise to signal ratio (NSR) is lower than the NSR of standard FFT. Finally, implementation issues are presented which verify the suitability of the proposed 'real factor' FFT's.
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 callMore From: International Journal of Simulation Systems Science & Technology
Disclaimer: 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.
