An efficient design for general mixed radix FFT processors

Abstract

A general mixed-radix FFT design for in-place strategy is derived and a low-complexity scheme for efficiently implementing mixed-radix FFTs is proposed. In this method, we develop an accumulator that can simply and practically generate addresses for the operands, as well as the twiddle factors. This approach extends the range of FFT size and reduces the hardware complexity of any non-power-of-two memory-based FFTs. Finally, the 3780-point FFT is taken an example to illustrate the validation of the proposed method.