2020
DOI: 10.1088/1742-6596/1479/1/012046
|View full text |Cite
|
Sign up to set email alerts
|

Signal approximations by shifted Gaussians: a direct approach by finite linear systems

Abstract: In this paper we consider interpolation problem connected with series by integer shifts of Gaussians. Known approaches for these problems met numerical difficulties. Due to it another method is considered based on finite–rank approximations by linear systems. The main result for this approach is to establish correctness of the finite–rank linear system under consideration. And the main result of the paper is to prove correctness of the finite–rank linear system approximation. For that an explicit formula for t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(3 citation statements)
references
References 4 publications
0
3
0
Order By: Relevance
“…Description the calculation of direct and inverse GDFT's, associated with the Hermite formula, is possible to produce by Fast Fourier Transform Algorithm in the fft and ifft applications from MatLab according to the following: first, we define the complex amplitudes of the observed signal Y =fft( y ε , n) and the complex amplitudes of the observed signal derivatives Y =fft(y , n), where y, y are vectors signal and its derivatives, second, we get two vectors of complex amplitudes by formulas F = NY − Y, G = Y − (N − 1)Y , thirdly, we will determine of the harmonic components of the signal and its derivatives is carried out by the formulas (26) in the form y = ifft( 1 N (F + εG), n), y = ifft( 1 N (G + (N − 1)εF ), n).…”
Section: Results Of Testing the Proposed Approaches In Practicementioning
confidence: 99%
See 2 more Smart Citations
“…Description the calculation of direct and inverse GDFT's, associated with the Hermite formula, is possible to produce by Fast Fourier Transform Algorithm in the fft and ifft applications from MatLab according to the following: first, we define the complex amplitudes of the observed signal Y =fft( y ε , n) and the complex amplitudes of the observed signal derivatives Y =fft(y , n), where y, y are vectors signal and its derivatives, second, we get two vectors of complex amplitudes by formulas F = NY − Y, G = Y − (N − 1)Y , thirdly, we will determine of the harmonic components of the signal and its derivatives is carried out by the formulas (26) in the form y = ifft( 1 N (F + εG), n), y = ifft( 1 N (G + (N − 1)εF ), n).…”
Section: Results Of Testing the Proposed Approaches In Practicementioning
confidence: 99%
“…DFT is widely used [4,6,9,17,20] to perform Fourier analysis in many practical applications. So, for example, DFT is used to effectively solve equations in private derivatives and perform convolution operation, multiplying large whole numbers, coding, filtering the signal analysis [13,16,25,26]. These transforms are also important in transmutation theory [22,23,24].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation