FAST FOURIER TRANSFORMATION CIRCUIT

摘要

Provided is a fast Fourier transformation circuit capable of optimizing an operation resource while matching a plurality of communication systems. In this circuit, an FFT circuit (100) comprises a first FFT operation unit (110) for subjecting two-parallel 2<SUP>M-1</SUP> digital signals to FFT operations of (M-1) steps, a second FFT operation unit (120) for subjecting 2<SUP>N</SUP> digital signals to FFT operations of (N-M+1) steps, and a third FFT operation unit (130) for subjecting 2<SUP>M</SUP> digital signals to an FFT operation of one step. The output signal of the first FFT operation unit (110) is subjected to the FFT operation by the second FFT operation unit (120) and the third FFT operation unit (130) thereby to perform the FFT operations of 2<SUP>N</SUP> points and 2<SUP>M</SUP> points simultaneously.