Abstract
Fast Fourier Transform represents a canonical example of DSP algorithm since it is in some form present in virtually every signal processing application. While most DSP platforms, based on the classical Harvard architecture, tend to prefer fixed-radix FFT algorithms due to their regular structure, general purpose platforms may benefit more from advanced FFT implementations, such as split-radix FFT. In this paper, we present an implementation of conjugate-pair variant of split-radix FFT, optimized for platforms with SIMD instruction set extension.
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.
