This paper compares wavelet and short time Fourier transform based techniques for single channel speech signal noise reduction. Despite success of wavelet denoising of images, it has not yet been widely used for removal of noise in speech signals. We explored how to extend this technique to speech denoising, and discovered some problems in this endeavor. Experimental comparison with large amoun...

The Spectral decomposition of seismic data was incepted earlier in the second half of the 19th century, howeverlimited research work has been done in this filed because of lack of availability of advancetools/ techniques for analysis of transient signal like earthquake time historyrecords. Although, there are several conventional techniques like Fourier Transform (FT),Fourier Series (FS)that ar...

A framework for approximate signal processing is introduced which can be used to design novel classes of algorithms for performing DFT and STFT calculations. In particular , we focus on the derivation of multi-stage incremen-tal reenement algorithms that meet a variety of design criteria on the tradeoo achieved at each stage between solution quality and computational cost.

The recent emergence of the discrete fractional Fourier transform (DFRFT) has caused a revived interest in the eigenanalysis of the discrete Fourier transform (DFT) matrix F with the objective of generating orthonormal Hermite-Gaussian-like eigenvectors. The Grünbaum tridiagonal matrix T – which commutes with matrix F – has only one repeated eigenvalue with multiplicity two and simple remaining...

In this paper, the quaternion Bessel-Fourier moments are introduced. The significance of phase information in quaternion Bessel-Fourier moments is investigated and an accurate estimation method for rotation angle is described. Furthermore, a new set of invariant descriptors based on the magnitude and the phase information of quaternion Bessel-Fourier moments is derived. Experimental results sho...

Circulant embedding is a technique that has been used to generate realizations from certain real-valued Gaussian stationary processes. This technique has two potential advantages over competing methods for simulating time series. First, the statistical properties of the generating procedure are exactly the same as those of the target stationary process. Second, the technique is based upon the d...

In this paper, we present an algorithm to estimate a signal from its modified short-time Fourier transform (STFT). This algorithm is computationally simple and is obtained by minimizing the mean squared error between the STFT of the estimated signal and the modified STFT. Using this algorithm, we also develop an iterative algorithm to estimate a signal from its modified STFT magnitude. The iter...

The paper presents a fast algorithm for the calculation of a multiresolution discrete Fourier transform. The presented approach is based on the realization of the Fast Fourier Transform for each frequency resolution level. This algorithm allows reducing the number of complex multiplications and additions compared to the method consisting in the multiplication between the input signal expressed ...

The Hartley transform, a real-valued alternative to the complex Fourier transform, is presented as an efficient tool for the analysis and simulation of earthquake accelerograms. This paper is introduced a novel method based on discrete Hartley transform (DHT) and radial basis function (RBF) neural network for generation of artificial earthquake accelerograms from specific target spectrums. Acce...

In this article, by using a partial on locally compact semi-direct product groups, we present a compatible extension of the Fourier transform. As a consequence, we extend the fundamental theorems of Abelian Fourier transform to non-Abelian case.