2012
DOI: 10.1002/mma.1547
|View full text |Cite
|
Sign up to set email alerts
|

A discrete Fourier transform based on Simpson's rule

Abstract: Communicated by J. BanasiakFourier analysis plays a vital role in the analysis of continuous-time signals. In many cases, we are forced to approximate the Fourier coefficients based on a sampling of the time signal. Hence, the need for a discrete transformation into the frequency domain giving rise to the classical discrete Fourier transform. In this paper, we present a transformation that arises naturally if one approximates the Fourier coefficients of a continuous-time signal numerically using the Simpson qu… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
3
0

Year Published

2012
2012
2017
2017

Publication Types

Select...
4

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 4 publications
0
3
0
Order By: Relevance
“…The DFT plays an important role in audio signal processing, adaptive filtering of artefacts from the human electroencephalogram and detection of fetal heartbeats from the fetal electrocardiogram 2 . We have proposed a DFT based on Simpson's numerical quadrature rule 1 and proved analogous properties to the classical DFT 3 . The eigenvalues of a matrix play an important role in the spectral resolution of functions of the matrix into their constituent components and the multiplicities give the number of linearly independent eigenvectors corresponding to each eigenvalue 4 .…”
Section: Introductionmentioning
confidence: 94%
“…The DFT plays an important role in audio signal processing, adaptive filtering of artefacts from the human electroencephalogram and detection of fetal heartbeats from the fetal electrocardiogram 2 . We have proposed a DFT based on Simpson's numerical quadrature rule 1 and proved analogous properties to the classical DFT 3 . The eigenvalues of a matrix play an important role in the spectral resolution of functions of the matrix into their constituent components and the multiplicities give the number of linearly independent eigenvectors corresponding to each eigenvalue 4 .…”
Section: Introductionmentioning
confidence: 94%
“…Recently, the Fast Fourier Transform algorithm [2] based on the classical DFT has been used in financial mathematics to evaluate option pricing [3]. In order to improve the accuracy of the computation of the Fourier coefficients of a period function we have introduced in [4] a discrete Fourier transform based on Simpson's quadrature rule [5].…”
Section: Introductionmentioning
confidence: 99%
“…This transformation is the preferred tool in these areas since processing in the frequency domain is inexpensive. Having provided an alternative transformation, the SDFT [5], which may be applied to these areas of interests, it is only natural that we establish its properties.…”
mentioning
confidence: 99%