Reducing power consumption in FFT architectures by using heuristic-based algorithms for the ordering of the twiddle factors

This paper addresses the exploration of different heuristic-based algorithms for a better manipulation of coefficients in Fast Fourier Transform (FFT). Due to the characteristics of the FFT algorithms, which involve multiplications of input data with appropriate coefficients, the best ordering of these operations can contribute for the reduction of the switching activity, what leads to the minimization of power consumption in the FFTs. The heuristic-based algorithm named Bellmore and Nemhauser and a new proposed one named Anedma are used to get as near as possible to the optimal solution for the ordering of coefficients in FFTs with larger number of points. As will be shown, the appropriate ordering of coefficients, based on the guidance given by the Anedma heuristic algorithm, can contribute for the reduction of power consumption of the FFT architectures.