Institute of Electrical & Electronic Engineers
In this paper, the authors present 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 non-uniform 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.