Displaying similar documents to “Algorithms. 41. FOURIER. Computation of Fourier-transform integrals”

Laguerre polynomials in the inversion of Mellin transform

George J. Tsamasphyros, Pericles S. Theocaris (1981)

Aplikace matematiky

Similarity:

In order to use the well known representation of the Mellin transform as a combination of two Laplace transforms, the inverse function g ( r ) is represented as an expansion of Laguerre polynomials with respect to the variable t = l n r . The Mellin transform of the series can be written as a Laurent series. Consequently, the coefficients of the numerical inversion procedure can be estimated. The discrete least squares approximation gives another determination of the coefficients of the series expansion....

A new zoom algorithm and its use in frequency estimation

Manuel D. Ortigueira, António S. Serralheiro, J. A. Tenreiro Machado (2015)

Waves, Wavelets and Fractals

Similarity:

This paper presents a novel zoom transform algorithm for a more reliable frequency estimation. In fact, in many signal processing problems exact determination of the frequency of a signal is of paramount importance. Some techniques derived from the Fast Fourier Transform (FFT), just pad the signal with enough zeros in order to better sample its Discrete-Time Fourier Transform. The proposed algorithm is based on the FFT and avoids the problems observed in the standard heuristic approaches....