Abstract
In this paper, we present an efficient FPGA implementation method of fractional Fourier transform (FrFT) algorithm. Firstly, a polyphase implementation of the FrFT computation algorithm base on the theory of multirate signal processing and filter banks is proposed. This polyphase implementation costs less computations and its parallel structure is suitable for FPGA realization. Then we present one computational method, which improve the resolution on any portion of fractional spectrum. Some realization details, such as the parity restrictions of signal length, special interval for transform order, interpolation filter, continuous frame computation and continuous order computation are also investigated. Finally, the efficiency of the novel method is verified by FPGA implementation results.
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.
