Parametric versions of the fast Fourier transform

DOI10.1134/S1064562408040285zbMath1218.65157OpenAlexW2065944457MaRDI QIDQ542231

O. V. Prosekov, Vasily N. Malozemov

Publication date: 8 June 2011

Published in: Doklady Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064562408040285

zbMATH Keywords

fast algorithmsfast Fourier transformsparse matricesFourier matrixdiscrete periodic signalsparametric coding of indices

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items (1)

On the properties of a new tensor product of matrices

Cites Work

• A methodology for designing, modifying, and implementing Fourier transform algorithms on various architectures
• Comments on "Split Manageable Efficient Algorithm for Fourier and Hadamard Transforms

This page was built for publication: Parametric versions of the fast Fourier transform