Abstract
In this paper, expressions are derived for the mean square error in modified radix-2 FFT algorithms. To reduce the mean square error at the output of a special purpose, high-speed low-order <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">(n {\leq} 32)</tex> FFT processor implemented in fixed-point arithmetic, a modified FFT architecture is considered in which an extra bit is added to the register wordlength to prevent overflow. In this way, the scaling error is avoided and only the error due to product roundoff remains, in the case of implementation with stored-product ROM multipliers. The predicted signal/noise ratios are compared with those obtained by computer simulation.
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.
