On the effect of correlation between truncation errors in fixed-point error analysis of Winograd short-length DFT algorithms

A technique for the estimation of correlation coefficients between truncation errors in the flow graphs of Winograd short-length DFT algorithms is presented. The fixed-point error analysis of basic modules (corresponds to the Winograd short-length algorithm) is carried out in sign-magnitude (or 1´s complement) arithmetic by assuming correlation between truncation errors. The errors introduced by coefficient quantization and rounding after multiplication are also studied. The results obtained are in close agreement with the corresponding simulation results compared to those predicted by Patterson and McClellan and hence justify the validity of assumptions made in the analysis.