Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Prakash et al. (1982) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: