Abstract
Fast Fourier Transform (FFT) is a rudimentary operation in signal processing. Modern high speed signal processing application technologies, such as 4G LTE, 5G, Internet of Things (IoT), etc., necessitate a high throughput implementation of FFT. Moreover the FFT size required in aforementioned technologies tends to vary with the operation mode. It is highly desirable to have a FFT implementation that not only meets the high throughput demand but is also scalable to cater selectable N-point FFT. In this paper, our contribution is two-fold; we first propose a novel split-radix 4/8 FFT algorithm which is comparable in efficiency with radix-8 algorithm but is considerably less complex in design for large size FFTs. Secondly, we developed an automation tool that gives high level implementation details of an adaptive N-point split-radix FFT processor.
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.
