Discrete Weierstrass Fourier Transform and Experiments
Sheng Zhang, Brendan Harding
TL;DR
This paper introduces the Discrete Weierstrass Fourier Transform, a faster and more generalized method for approximating discrete data, with demonstrated faster convergence in some cases.
Contribution
The paper presents a novel Discrete Weierstrass Fourier Transform that improves convergence speed over traditional Discrete Fourier Transform.
Findings
Faster convergence in certain examples
Generalizes the Discrete Fourier Transform
Provides theoretical analysis and experimental validation
Abstract
We established a new method called Discrete Weierstrass Fourier Transform, a faster and more generalized Discrete Fourier Transform, to approximate discrete data. The theory of this method as well as some experiments are analyzed in this paper. In some examples, this method has a faster convergent speed than Discrete Fourier Transform.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsScientific Research and Discoveries · Sensor Technology and Measurement Systems · Neural Networks and Applications