A parallel and pipelined Fast Fourier Transform (FFT) processor for use in the Orthogonal Frequency division Multiplexer (OFDM) and WLAN, unlike being stored in the traditional ROM. The twiddle factors in our pipelined FFT processor can be accessed directly. A novel simple address mapping scheme and the modified radix 4 FFT also proposed. FPGA was majorly used to develop the ASIC IC’s to which ...

This paper describes in detail the design of a CMOS custom fast Fourier transform (FFT) processor for computing a 256-point complex FFT. The FFT is well-suited for realtime spectrum analysis in instrumentation and measurement applications. The FFT butterfly processor reported here consists of one parallel–parallel multiplier and two adders. It is capable of computing one butterfly computation e...

We have developed a high-performance FFT on SGI Altix 3700, improving the efficiency of the floating-point operations required to compute FFT by using a kind of loop fusion technique. As a result, we achieved a performance of 4.94 Gflops at 1-D FFT of length 4096 with an Itanium 2 1.3 GHz (95% of peak), and a performance of 28 Gflops at 2-D FFT of 4096 with 32 processors. Our FFT kernel outperf...

The FFT(Fast Fourier Transform) processing is one of the key procedure in the popular orthogonal frequency division multiplexing(OFDM) based communication system such as Digital Audio Broadcasting(DAB),Digital Video Broadcasting Terrestrial(DVB-T),Asymmetric Digital Subscriber Loop(ADSL) etc.These application domain require performing FFT in various size from 64 to 8192 point. Implementing each...

In this paper, we propose the grouped scheme, which can be specially applied to compute the pruning fast Fourier transform (pruning FFT) with power-of-two partial transformation length. The group-based pruning FFT algorithm applies the scheme of the grouped frequency indices to accelerate computations of selected discrete Fourier transform (DFT) outputs. The proposed pruning FFT algorithm has f...

A metric d on a finite set X is called a Kalmanson metric if there exists a circular ordering of points of X , such that d(y; u) + d(z; v) > d(y; z) + d(u; v) for all crossing pairs yu and zv of . We prove that any Kalmanson metric d is an l1-metric, i.e. d can be written as a nonnegative linear combination of split metrics. The splits in the decomposition of d can be selected to form a circula...

FFT and IFFT algorithm plays an important role in design of digital signal processing. This paper describes the design of Decimation in Time-Fast Fourier Transform (DIT-FFT). The proposed design is a novel 16 bit word length processor, which is implemented with radix-2, based 8 point FFT. This approach reduces the multiplicative complexity which exists in conventional FFT implementation. For th...

This paper describes in detail the design of a custom CMOS Fast Fourier Transform(FFT) processor for computing 256-point complex FFT. The FFT is well suited for real-time spectrum analysis in instrumentation and measurement applications. The FFT butterfly processor consists of one parallel-parallel multiplier and two adders. It is capable of computing one butterfly computation every 100ns thus ...