Here we present a new design of a 64-point Fast Fourier Transform circuit. The design is derived from Radix-23 algorithm and implemented using Single Path Delay Feedback architecture. This approach ensures high memory and multiplier utilizations. The 64-Point FFT is realized by decomposing into two-dimensional structure of 8-point FFTs. Each of this FFT is re-decomposed into 4-point and 2-point FFTs. This decomposition reduces the number of non-trivial twiddle factor into just one. Thus we only need one complex multiplier for the design. The complex multiplier is realized using modified Booth (radix-4) encoding algorithm to achieve faster computational speed. The validity and efficiency of the proposed circuit has been thoroughly verified by functional simulation, timing simulation, and FPGA implementation. The proposed design has been successfully synthesized using Synopsys with TSMC 0.18µ technology. The core area is 0.47 mm2. The power consumption is 29.7 mW. The time delay is 6 ns. The circuit computes one serial-to-serial data in 116 clock cycles. Thus our design has 3 advantages: small area, low power consumption, and fast computation.
[1]
Mats Torkelson,et al.
A new approach to pipeline FFT processor
,
1996,
Proceedings of International Conference on Parallel Processing.
[2]
J. A. Hidalgo,et al.
A RADIX-8 MULTIPLIER UNIT DESIGN FOR SPECIFIC PURPOSE
,
2000
.
[3]
U. Jagdhold,et al.
A 64-point Fourier transform chip for high-speed wireless LAN application using OFDM
,
2004,
IEEE Journal of Solid-State Circuits.
[4]
Alexandre F. Tenca,et al.
A Radix-4 Design of a Scalable Modular Multiplier With Recoding Techniques
,
2004
.
[5]
Karl S. Gugel,et al.
PIPELINED 64-POINT FAST FOURIER TRANSFORM FOR PROGRAMMABLE LOGIC DEVICES
,
2002
.