Discrete Weierstrass Fourier Transform and Experiments
arXiv:1502.077341.22 citationsh-index: 13
Originality Incremental advance
AI Analysis
This work presents a new method for signal processing and data approximation, but the improvements are demonstrated only on specific examples without broad validation.
The paper introduces the Discrete Weierstrass Fourier Transform as a faster and more generalized alternative to the Discrete Fourier Transform for approximating discrete data, demonstrating faster convergence in some examples.
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.