Abstract
In this correspondence expressions are derived for the multiplication roundoff and scaling error variances in a multidimensional vector radix FFT algorithm, for fixed-point one's complement/ sign-magnitude arithmetic. Results are given for base-2 and base-4 algorithms for both decimation-in-time and decimation-in-frequency methods. Comparisons of the erior performance are made with the conventional methods.
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 callMore From: IEEE Transactions on Acoustics, Speech, and Signal Processing
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.
