In this paper we survey some recent work directed towards generalizing the fast Fourier transform (FFT). We work primarily from the point of view of group representation theory. In this setting the classical FFT can be viewed as a family of e cient algorithms for computing the Fourier transform of either a function de ned on a nite abelian group, or a bandlimited function on a compact abelian g...

In this paper, we propose a texture feature-based language identification using wavelet-domain BDIP (block difference of inverse probabilities) and BVLC (block variance of local correlation coefficients) features and FFT (fast Fourier transform) feature. In the proposed method, wavelet subbands are first obtained by wavelet transform from a test image and denoised by Donoho’s soft-thresholding....

An ultra-fast image simulation algorithm is proposed. The new uses full fast-Fourier-transform (FFT) to calculate the aerial intensity. wavelength, 193 nm, was scaled a number of powers 2, through scaling mask with factor derived from discrete Fourier transform (FT) format. can then be transformed diffraction spectrum in terms spatial frequency using FFT algorithm. Similarly, this inverse aeria...

In this paper we focus on multi-resolution spectral analysis algorithms for music signals based on the FFT. Two previously devised efficient algorithms (efficient constantQ transform [1] and multiresolution FFT [2]) are reviewed and compared with a new proposal based on the IIR filtering of the FFT. Apart from its simplicity, the proposed method shows to be a good compromise between design flex...

FFT (fast Fourier transform) plays a very important role in many fields, such as digital signal processing, digital image processing and so on. However, in application, FFT becomes a factor of affecting the processing efficiency, especially in remote sensing, which large amounts of data need to be processed with FFT. So shortening the FFT computation time is particularly important. GPU (Graphic...

FFT/IFFT has been one of the most important algorithms in digital signal processing. In the recent years, the FFT/IFFT has frequently been applied in the modern communication systems due to its efficiency for OFDM (Orthogonal Frequency Division Multiplex) implementation. Many applications, like xDSL modems, HDTV, mobile radio terminals, use FFT/IFFT processor as a key component. The butterfly e...

Fructans are important vacuolar reserve carbohydrates with drought, cold, ROS and general abiotic stress mediating properties. They occur in 15% of all flowering plants and are believed to display health benefits as a prebiotic and dietary fiber. Fructans are synthesized by specific fructosyltransferases and classified based on the linkage type between fructosyl units. Inulins, one of these fru...

In a wide range of applied problems of 2-D and 3-D imaging a continuous formulation of the problem places great emphasis on obtaining and manipulating the Fourier transform in Polar coordinates. However, the translation of continuum ideas into practical work with data sampled on a Cartesian grid is problematic. In this article we develop a fast high accuracy Polar FFT. For a given two-dimension...

On-Iine running spectral analysis is of considerable interest in many electrophysiological signals, such as the EEG (electroencephalograph). This paper presents a new method of implementing the fast Fourier transform (PTT) algorithm. Our "real-time FFT algorithm" efficiently utilizes computer time to perform the FFT computation while data acquisition proceeds so that local butterfly modules are...

Goal of this research article is to study and the analysis of a parameterization technique called Common Operator for an embedded digital signal processing system and implementation of that embedded system using a special architecture to achieve better performance. This can be realized by efficient hardware design with reduced area and low-power dissipation which is a significant challenge for ...