SVD and FFT are both the efficient tools for image analysis and face recognition. In this paper, we first study the role of SVD and FFT in both filed. Then the decomposition information from SVD and FFT are compared. Next, a new viewpoint that the singular value matrix contains the illumination information of the image is proposed and testified by the experiments based on the ORL face database ...

In this paper, the design of decimation in time Radix-2 FFT processor is presented, which is integrated in FPGA chip, regarding FPGA as design carrier. New butterfly-shaped operation method is proposed based on the traditional FFT algorithm and the analysis of hardware unit, which can reduce multiplication. And it adopted the Look-up table method .The results of hardware test of FFT processor s...

Algorithms for computing Fast Fourier Transforms (FFTs) have been employed in the past for sequence analysis. However these techniques had to perform a large number of FFT computations. In this paper we present algorithms for sequence analysis that reduce the number of FFT computations drastically. We also provide experimental evaluation of the new algorithms. The speedups obtained are impressive.

The Hilbert-Huang transform (HHT) is a powerful method for nonlinear and non-stationary vibrations analysis. This approach consists of two basic parts of empirical mode decomposition (EMD) and Hilbert spectral analysis (HSA). To achieve the reliable results, Bedrosian and Nuttall theorems should be satisfied. Otherwise, the phase and amplitude functions are mixed together and consequently, the ...

This paper is concerned with a synthesis study of the fast Fourier transform (FFT), the short time Fourier transform (STFT and the Wigner distribution (WD) in analysing the phonocardiogram signal (PCG) or heart cardiac sounds.     The FFT (Fast Fourier Transform) can provide a basic understanding of the frequency contents of the heart sounds. The STFT is obtained by calculating the Fourier tran...

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

In the analysis of sound (for synthesis), digitally sampled audio is processed to extract certain features. The resulting data can be synthesised to reproduce the original sound, or modified before synthesis to musically transform the sound. The analysis primarily uses a harmonic model, which considers a sound to be composed of multiple nonstationary sinusoids. The first stage of analysis is of...

The fast Fourier transform (FFT), which is employed by all commercially available ultrasonic systems, provides a time-frequency representation of Doppler ultrasonic signals obtained from blood flow. The FFT assumes that the signal is stationary within the analysis window. However, the presence of short duration embolic signals invalidates this assumption. For optimal detection of embolic signal...

DOI: 10.5281/zenodo.55536 ABSTRACT Discrete Fourier Transform is a principal mathematical method for the frequency analysis and has wide applications in Engineering and Sciences. Because the DFT is so ubiquitous, fast methods for computing DFT have been studied extensively, and continuous to be an active research. The way of splitting the DFT gives out various fast algorithms. In this paper, we...