The Fast Fourier Transform (FFT) is based on an important factorization of the Fourier matrix Fn into a product of sparse matrices. In this paper, we demonstrate the existence of a set of FFT-like factorizations for an arbitrary Kronecker product of Fourier matrices F = Fn1 ⊗ . . . ⊗ Fnk . We show that there exists such a factorization for any chain of nested subgroups of the Abelian group Zn1×...

© 2010 Sang-In Cho et al. 1 In this paper, we present a fast Fourier transform (FFT) processor with four parallel data paths for multiband orthogonal frequency-division multiplexing ultrawideband systems. The proposed 128-point FFT processor employs both a modified radix-2 algorithm and a radix-2 algorithm to significantly reduce the numbers of complex constant multipliers and complex booth mul...

Fructosyltransferases (FTs) synthesize fructans, fructose polymers accumulating in economically important cool-season grasses and cereals. FTs might be crucial for plant survival under stress conditions in species in which fructans represent the major form of reserve carbohydrate, such as perennial ryegrass (Lolium perenne). Two FT types can be distinguished: those using sucrose (S-type enzymes...

The technique of orthogonal frequency divisionmultiplexing (OFDM) is famous for its robustness against frequency-selective fading channel. This technique has been widely used in many wired and wireless communication systems. In general, the fast Fourier transform (FFT) and inverse FFT (IFFT) operations are used as the modulation/demodulation kernel in the OFDM systems, and the sizes of FFT/IFFT...

In this paper, we proposed a low power high performance 16-point 2-parallel pipelined FFT architecture with the use of various low power functional block implementation techniques. This paper presents the techniques to minimize the power consumption of the FFT architecture by reducing number of functional blocks used to implement the FFT processor. The FFT is employed by the modified radix-4 al...

This paper presents an optimized column fast Fourier transform (FFT) architecture, which utilizes bit-serial arithmetic and dynamic reconfiguration to achieve a complete overlap between computation and communication. As a result, for a clock rate of 40 MHz, the system can compute a 24-b precision 1K point complex FFT transform in 9.25 s, far surpassing the performance of any existing FFT systems.

Pseudo-spectral method is one of the most accurate techniques for simulating turbulent flows. Fast Fourier transform (FFT) is an integral part of this method. In this paper, we present a new procedure to compute FFT in which we save operations during interprocess communications by avoiding transpose of the array. As a result, our transpose-free FFT is 15% to 20% faster than FFTW.

Purpose: Heart rate variability (HRV) is acknowledged as a useful tool to estimate autonomic function. Fast Fourier transform (FFT) and autoregressive model (AR) are used for power spectral analysis of HRV. However, there is little evidence of agreement between FFT and AR in relation to HRV following food intake in females. In the present study, we applied both FFT and AR after food intake duri...

We present the fast Fourier transform (FFT), of arbitrary dimensions, on the graphics processing unit (GPU). The FFT on GPUs exploits the architecture in its image processing capability, as well as its particular graphics/image rendering capacity. It also couples the processing and rendering furthermore. We view the GPU as a special architecture that supports fine-granularity, two-dimensional (...

This paper shows a design and implementation of a radix-4 FFT in FPGA using a Xilinx Spartan-6. The decimation in time equations are reviewed and in sequence several FPGA modules are presented according to algorithm architecture looking for optimization in execution time and occupied device area. Several tests were performed in order to validate the algorithm performance, FFT functionality, and...