Efficient evaluation of oversampled functions (Q1095626): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3661894 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sampling Theorem for the Fourier Transform of a Distribution with Bounded Support / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shannon sampling theorem—Its various extensions and applications: A tutorial review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5814065 / rank
 
Normal rank

Latest revision as of 12:37, 18 June 2024

scientific article
Language Label Description Also known as
English
Efficient evaluation of oversampled functions
scientific article

    Statements

    Efficient evaluation of oversampled functions (English)
    0 references
    1986
    0 references
    It has long been known that an oversampled function can be represented by a generalized sinc series which converges much faster than the usual one. We show that the speed of convergence is exponential and give numerical approximations to the kernel function involved in the generalized series. The practical consequence is that a bandlimited function which is oversampled can be evaluated at any point with accurary \(O(Le^{- \sqrt{L}})\) using O(L) operations.
    0 references
    sampling theorem
    0 references
    band-limited functions
    0 references
    sinc-series
    0 references
    oversampled function
    0 references
    0 references

    Identifiers