FFT arithmetic and FFT computation method

摘要

PROBLEM TO BE SOLVED: To perform fast Fourier transform(FFT) operation at high speed. ;SOLUTION: A butterfly computing element 4 executes butterfly operation of data inputted from terminals in0 and in1 and outputs two pieces of data provided as a result from a terminal out0 or out1 to both selectors 13-0 and 13-1. At the selector 13-0 or 13-1, any one of two pieces of data supplied from the terminals outO and out1 are selected so that two pieces of data to be simultaneously required for the next butterfly operation can be dividedly stored in memories 15-0 and 15-1, and the data are respectively simultaneously supplied and stored through a selector 14-0 or 14-1 into the memory 15-0 or 15-1.;COPYRIGHT: (C)1997,JPO