Abstract
A new discrete Fourier transform (DFT) processor with a pipelined structure has been developed. This processor is designed to optimise computation of the pair of operationsAx0 ±Bx1, which is mostly encountered in various fast DFT algorithms. For real-valued data and coefficients, the processor needs only two machine cycles to calculate the pair of operations. A straightforward multiple-stage transform algorithm has been proposed to implement real-valued prime-factor or radix-type transforms. About half of the computation can be saved by taking into account the fact that transform outputs are conjugate pairs for real inputs. The short Winograd Fourier transform algorithm is suggested as a basic building block for large transforms because it is more efficient than the fast Fourier transform.
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: IEE Proceedings G (Electronic Circuits and Systems)
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.
