Conference Paper

A novel 64-point FF/IFFT processor for IEEE 802.11(a) standard

IHP, Frankfurt, Germany
DOI: 10.1109/ICASSP.2003.1202359 Conference: Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03). 2003 IEEE International Conference on, Volume: 2
Source: IEEE Xplore

ABSTRACT A novel 64-point FFT/IFFT processor is presented in this article, named TURB064, developed primarily for the application for the IEEE 802.11 (a) standard. The processor does not use any digital multiplier or RAM. It has been fabricated and tested successfully. Its core area is 6.8 mm2 and the average power consumption is 41 mW at 1.8 V @ 20 MHz frequency. Compared to some other existing IP cores and ASIC chips TURB064 needs a smaller number of clock cycles and consumes less power.

  • [Show abstract] [Hide abstract]
    ABSTRACT: The Fast Fourier Transform (FFT) is a very important algorithm in signal processing, software defined radio and the most promising modulation technique i.e. Orthogonal Frequency Division Multiplexing (OFDM). This paper describes the design and implementation of a fully pipelined 64-point FFT engine in programmable logic. The FFT takes 16-bit fixed point complex numbers as input and after a known pipelined latency of 20 clock cycles produces the desired output. The input data samples are fed in parallel to the FFT engine to generate outputs in parallel. The architecture is capable of performing FFT operation without changing the internal coefficients which makes it highly suitable for practical applications. The architecture requires 25% multiplication operations compared to conventional Cooley-Tukey approach. Hence it leads to low power and area saving.
    Advances in Recent Technologies in Communication and Computing (ARTCom), 2010 International Conference on; 11/2010
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we introduce a fixed-point 16-bit 64 point FFT processor architecture for OFDM-based wireless applications. The processor is based on the DIT (decimation-in-time) radix-2 butterfly FFT algorithm. A canonical signed digit is used to implement constant complex multiplications with a CSA tree for lower power and cost. The simulation shows the module can reach low cost/power and high speed for OFDM-based high-speed wireless applications.
    Solid-State and Integrated Circuits Technology, 2004. Proceedings. 7th International Conference on; 11/2004
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: 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-μm BiCMOS technology. The core area of this chip is 6.8 mm<sup>2</sup>. 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.
    IEEE Journal of Solid-State Circuits 04/2004; · 3.06 Impact Factor

Full-text (2 Sources)

Available from
Nov 20, 2014