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...

A distributed memory vectorised 1-dimensional FFT benchmark is rst presented. The performance results of this benchmark on SUPRENUM are given and discussed. A performance analysis of the distributed memory FFT benchmark is performed and Hockney's performance parameters (r1 and n 1=2) are then employed to derive the performance formula. This formula is shown to t the experimental results very we...

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...

Computing the discrete Fourier transform is one of the most important in applied computer science, with applications in fields as diverse as seismology, signal analysis, and various branches of engineering. A great many algorithms exist for quickly computing different variations of the transform – fast Fourier transforms, or FFTs. Because of their practical importance, even small improvements t...

In recent years, as a result of advancing VLSI technology, OFDM has received a great deal of attention and been adopted in many new generation wideband data communication systems such as IEEE 802.11a, HiPerLAN/2,digital audio/video broadcasting (DAB/DVB-T) and asymmetric digital subscriber line (ADSL), very high speed digital subscriber line (VDSL) in wireless and wired communications, respecti...

The first stage of all cochlear implant speech processing strategies is a filterbank which decomposes the speech signal into several frequency bands. Two types of filterbanks can be used to achieve this goal and mimic the spectral analysis performed within the cochlea. The first is based on the Fast Fourier Transform (FFT). The second type of filterbank is composed of Infinite Impulse Response ...

Multiple Input Multiple output (MIMO) antennas can be combined with orthogonal frequency division multiplexing (OFDM) to ensure spatial diversity gain and/or to increase spectral efficiency. MIMO communication system with Alamouti methods can improve the bit error rate (BER) and signal to noise ratio (SNR) thus distortions are reduced for higher data rate. Conventionally OFDM is Fast Fourier Tr...