Fast Fourier transform: algorithms and applications
DOI10.1007/978-1-4020-6629-0zbMATH Open1203.65292OpenAlexW3147354744MaRDI QIDQ978560FDOQ978560
Authors: J. Martínez
Publication date: 25 June 2010
Published in: Signals and Communication Technology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4020-6629-0
Recommendations
- scientific article; zbMATH DE number 1134974
- scientific article; zbMATH DE number 610966
- scientific article; zbMATH DE number 3956396
- scientific article; zbMATH DE number 3894433
- scientific article; zbMATH DE number 698682
- scientific article; zbMATH DE number 5270385
- The Fast Fourier Transform
- scientific article; zbMATH DE number 107575
- Fast and precise Fourier transforms
- On a fast algorithm for computing the Fourier transform
algorithmsmonographnumerical examplessignal processingFFTfilteringimage processingdiscrete Fourier transformfast Fourier transformDFTexercisesflow diagramdecimation-in-frequencysparse matrix factorization\texttt{MATLAB} programsdecimation-in-timeinteger FFTmixed-radix FFTnonuniform DFTradix-2 FFTradix-3 FFTradix-4 FFTsplit-radix FFT
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Numerical methods for discrete and fast Fourier transforms (65T50)
Cited In (30)
- Title not available (Why is that?)
- Multiset neurons
- Title not available (Why is that?)
- Title not available (Why is that?)
- Signal flow graph approach to efficient and forward stable DST algorithms
- Nonlinear Schrödinger equation and the hyperbolization method
- Transforms and fast algorithms for signal analysis and representations.
- Digital Fourier analysis -- advanced techniques. Transl. from the Japanese by Hideo Suzuki, Jin Yamagishi and the author
- Title not available (Why is that?)
- Fast algorithms for signal processing.
- Title not available (Why is that?)
- Even faster integer multiplication
- Title not available (Why is that?)
- Title not available (Why is that?)
- The discrete Fourier transform. Theory, algorithms and applications
- Title not available (Why is that?)
- Fast Fourier transform algorithms for parallel computers
- Title not available (Why is that?)
- Title not available (Why is that?)
- Dynamic modeling and stability analysis for the combined milling system with variable pitch cutter and spindle speed variation
- Sparsity of matrices of localization operators for curvelet transforms
- Lowest complexity self-recursive radix-2 DCT II/III algorithms
- Title not available (Why is that?)
- Quantum circuit for the fast Fourier transform
- Nonlinear model reduction for wave energy systems: a moment-matching-based approach
- An iterative solver for the 3D Helmholtz equation
- Complexity reduction, self/completely recursive, radix-2 DCT I/IV algorithms
- Title not available (Why is that?)
- Numerical Fourier analysis
- The pricing of compound option under variance gamma process by FFT
Uses Software
This page was built for publication: Fast Fourier transform: algorithms and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q978560)