A 64-point Fourier transform chip for high-speed wireless LAN application using OFDM

In this paper, we present a novel fixed-point 16-bit word-width 64-point FFT/IFFT processor developed primarily for the application in an OFDM-based IEEE 802.11a wireless LAN baseband processor. The 64-point FFT is realized by decomposing it into a two-dimensional structure of 8-point FFTs. This approach reduces the number of required complex multiplications compared to the conventional radix-2 64-point FFT algorithm. The complex multiplication operations are realized using shift-and-add operations. Thus, the processor does not use a two-input digital multiplier. It also does not need any RAM or ROM for internal storage of coefficients. The proposed 64-point FFT/IFFT processor has been fabricated and tested successfully using our in-house 0.25-/spl mu/m BiCMOS technology. The core area of this chip is 6.8 mm/sup 2/. The average dynamic power consumption is 41 mW at 20 MHz operating frequency and 1.8 V supply voltage. The processor completes one parallel-to-parallel (i.e., when all input data are available in parallel and all output data are generated in parallel) 64-point FFT computation in 23 cycles. These features show that though it has been developed primarily for application in the IEEE 802.11a standard, it can be used for any application that requires fast operation as well as low power consumption.

[1]  Petri Mähönen,et al.  On the single-chip implementation of a Hiperlan/2 and IEEE 802.11a capable modem , 2001, IEEE Wirel. Commun..

[2]  Hong-Jin Yeh.  Highly pipelined VLSI architecture for computation of fast Fourier transforms , 1993, Optics & Photonics.

[3]  Eckhard Grass,et al.  A Low-Power 64-point FFT/IFFT Architecture for Wireless Broadband Communication , 2000 .

[4]  D. Trystram,et al.  Perfect shuffle VLSI implementation: applications to sorting and FFT computation , 1989 .

[5]  J. O'Brien,et al.  A 200 MIPS single-chip 1 k FFT processor , 1989, IEEE International Solid-State Circuits Conference, 1989 ISSCC. Digest of Technical Papers.

[6]  John V. McCanny,et al.  A 64-point Fourier transform chip for video motion compensation using phase correlation , 1996, IEEE J. Solid State Circuits.

[7]  Tom Chen,et al.  COBRA: a 100-MOPS single-chip programmable and expandable FFT , 1999, IEEE Trans. Very Large Scale Integr. Syst..

[8]  Earl E. Swartzlander,et al.  A radix-8 wafer scale FFT processor , 1992, J. VLSI Signal Process..

[9]  Koushik Maharatna,et al.  A novel 64-point FF/IFFT processor for IEEE 802.11(a) standard , 2003, 2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03)..

[10]  D. Trainor,et al.  Rapid design of complex DSP cores , 1997, Proceedings of the 23rd European Solid-State Circuits Conference.

[11]  Hyesook Lim,et al.  A systolic array for 2-D DFT and 2-D DCT , 1994, Proceedings of IEEE International Conference on Application Specific Array Processors (ASSAP'94).

[12]  Chin-Liang Wang,et al.  A new efficient systolic architecture for the 2D discrete Fourier transform , 1992, [Proceedings] 1992 IEEE International Symposium on Circuits and Systems.

[13]  C. Joanblanq,et al.  A fast single-chip implementation of 8192 complex point FFT , 1995 .

[14]  T. Bially,et al.  Parallelism in fast Fourier transform hardware , 1973 .

[15]  Tad A. Kwasniewski,et al.  A chip set for pipeline and parallel pipeline FFT architectures , 1994, J. VLSI Signal Process..

[16]  Alvin M. Despain,et al.  Very Fast Fourier Transform Algorithms Hardware for Implementation , 1979, IEEE Transactions on Computers.

[17]  Tom Chen,et al.  An expandable column fft architecture using circuit switching networks , 1993, J. VLSI Signal Process..

[18]  Mohammed Ahmed Ghouse,et al.  2D grid architectures for the DFT and the 2D DFT , 1993, J. VLSI Signal Process..

[19]  Anantha P. Chandrakasan,et al.  A low-power IDCT macrocell for MPEG-2 MP@ML exploiting data distribution properties for minimal activity , 1999 .