Fast Fourier transforms with recursively generated trigonometric functions

DOI10.1007/BF02241701MaRDI QIDQ1164404zbMATH OpenOpenAlexFDO

Authors 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

signal processingfast Fourier transformrecursive formulaeSpeed comparisonstrigonometric coefficientstrigonometric functions generation

Mathematics Subject Classification ID

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

Cites work

• A Fast Fourier Transform Algorithm Using Base 8 Iterations

Describes a project that uses

Uses Software

• AS 83

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1164404)