| |
Browse All Reviews > Mathematics Of Computing (G) > Numerical Analysis (G.1) > Approximation (G.1.2) > Fast Fourier Transforms (FFT) (G.1.2...)
|
|
 |
|
|
| |
|
|
| |
1-5 of 5
Reviews about "Fast Fourier Transforms (FFT) (G.1.2...)":
|
Date Reviewed |
| |
 Discrete fourier and wavelet transforms: an introduction through linear algebra with applications to signal processing
Goodman R., World Scientific Publishing Co, Inc., River Edge, NJ, 2016. 300 pp. Type: Book
Fourier and wavelet transforms have proven to be indispensable tools in signal processing. They are taught in many courses, both at the graduate and undergraduate levels. When deciding how to teach these topics, the lecturer can choose...
|
Aug 29 2016 |
| |
Digital Fourier analysis: advanced techniques
Kido K., Springer International Publishing, New York, NY, 2014. 178 pp. Type: Book (978-1-493911-26-4)
If there was ever a “gift that keeps on giving” to the most esoteric of mathematico-physical theories or to the most pragmatic of engineering practice, it is Fourier analysis. (On my bucket list is someday to discov...
|
Dec 8 2015 |
| |
Parameter selection and numerical approximation properties of Fourier extensions from fixed data
Adcock B., Ruan J. Journal of Computational Physics 273453-471, 2014. Type: Article
The term “Fourier extensions” refers to a technique for approximating nonsmooth or nonperiodic functions using Fourier modes. Fourier series can approximate a smooth and periodic function very well with spectral con...
|
Jan 13 2015 |
| |
Fast computation of RBF coefficients using FFT
Abe Y., Iiguni Y. Signal Processing 86(11): 3264-3274, 2006. Type: Article
Radial basis functions (RBFs) are real valued functions whose domain is in a real or complex vector space. The term “radial” refers to the fact that their value at a point depends only on the distance of that point ...
|
May 22 2007 |
| |
Efficient 2D FFT implementation on mediaprocessors
Mermer C., Kim D., Kim Y. Parallel Computing 29(6): 691-709, 2003. Type: Article
Mermer, Kim, and Kim address the problems of computation and data flow in the mapping of the 2D fast Fourier transform (FFT) onto a single programmable mediaprocessor. The MAP, which is a recently introduced commercial mediaprocessor, ...
|
Nov 18 2003 |
| |
|
|
| |
|
