Abstract
The Fast Fourier Transform (FFT), Good-Winograd Fourier Transform (GWFT) and Winograd Fuorier Transform (WFT) are studied using residue arithmetic. High speed, high precision arithmetic is achieved by using arithmetic architecture and a plurality of small wordlength processors running is parallel. The disadvantage of this arithmetic is overflow intolerance. To insure that register overflow will not occur, in this modular structure, scaling policies for the three DFT's are derived and compared.
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.
