Fast Fourier transforms with recursively generated trigonometric functions

DOI10.1007/BF02241701zbMath0485.65095OpenAlexW372558526MaRDI QIDQ1164404

K. Dobes

Publication date: 1982

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02241701

zbMATH Keywords

fast Fourier transformsignal processingrecursive formulaeSpeed comparisonstrigonometric coefficientstrigonometric functions generation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trigonometric approximation (42A10) Numerical methods for trigonometric approximation and interpolation (65T40) Software, source code, etc. for problems pertaining to numerical analysis (65-04)

Uses Software

• AS 83

Cites Work

• A Fast Fourier Transform Algorithm Using Base 8 Iterations

This page was built for publication: Fast Fourier transforms with recursively generated trigonometric functions