| 摘要 |
Disclosed is a large N-point fast Fourier transform processor 100, where N= m*n. The N sized data words are permutated into n data blocks each of m words by a first permutation unit 31, the m data words are then put through a m-point FFT 10. The transformed data is then put through another permutation unit 32 to give m blocks of n words and then through a twiddle factor multiplication unit 40. The n words then go through a n-point FFT 20 and then through a third permutation unit 33 to give the final N-point FFT of the original data. The processor may have a permutation controller 50 to provide address signals to the permutation units, such that the data is written into and read from the units according to the signals. The m-point FFT processor may be arranged to process each of the n data blocks in turn and write the transformed data into the second permutation unit. The n-point FFT processor may process each of the m data blocks of the twiddle factored data separately and in turn, then write the transformed data into the third permutation unit. Also, disclosed is a testing apparatus for the processor. |
