Fast Fourier transform(FFT) accelerator and Coordinate rotation digital computer(CORDIC) algorithm play important roles in signal processing. We propose a configurable floating-point FFT accelerator based on CORDIC rotation, in which twiddle direction prediction is presented to reduce hardware cost and twiddle angles are generated in real time to save memory. To finish CORDIC rotation efficiently, a novel approach in which segmentedparallel iteration and compress iteration based on CSA are presented and redundant CORDIC is used to reduce the latency of each iteration. To prove the efficiency of our FFT accelerator, four FFT accelerators are prototyped into a FPGA chip to perform a batch-FFT. Experimental results show that our structure, which is composed of four butterfly units and finishes FFT with the size ranging from 64 to8192 points, occupies 33230(3%) REGs and 143006(30%)LUTs. The clock frequency can reach 122 MHz. The resources of double-precision FFT is only about 2.5 times of single-precision while the theoretical value is 4. What’s more, only 13331 cycles are required to implement 8192-points double-precision FFT with four butterfly units in parallel. Fast Fourier transform (FFT) accelerator and Coordinate rotation digital computer (CORDIC) algorithm play important roles in signal processing. We propose a configurable floating-point FFT accelerator based on CORDIC rotation, in which twiddle direction prediction is presented to reduce hardware cost and twiddle angles are generated in real time to save memory. To finish the effective method of compressing a CSD in CORDIC is to reduce the latency of each iteration. To prove the efficiency of our FFT results show that our structure, which is composed of four butterfly units and finishes FFT with the size ranging from 64 to 8192 points, occupies 33230 (3% ) REGs and 143006 (30%) LUTs. The clock frequency can reach 122 MHz. The resources of double-precision FFT is only about 2.5 times single-precision while the theoretical value is 4. What’s more, only 13331 cycles are required to implement 8192-points double-precision FFT with four butterfly units in parallel.