Non-Uniform search domain based Genetic algorithm for the optimization of real time FFT Processor architectures

This paper presents a GA for optimization of word length coefficients in a pipelined FFT processor. The algorithm optimizes memory and buses both at the I/O interfaces within the processor datapath. This provides a complex search space in which the algorithm needs balance optimization parameters against error. A special feature of the GA is the use of nonuniform operators which allow tuning the search to provide an optimal optimization with minimum number of generations. The paper describes the algorithm, the concept of non uniform operators through the mutation operation. The results show the effect of both uniform and non uniform sampling on the quality of the optimization, turbulence towards convergence, and the speed of convergence.