Generalization of the fast Fourier transform with a constant structure

DOI10.1134/s0965542523080031OpenAlexW4387463537MaRDI QIDQ6077988

M. S. Bespalov

Publication date: 19 October 2023

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

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

zbMATH Keywords

discrete Fourier transformfast algorithmdiscrete Walsh transformKronecker product of matrices

Mathematics Subject Classification ID

Numerical analysis (65-XX) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A methodology for designing, modifying, and implementing Fourier transform algorithms on various architectures
• Discrete Chrestenson transform
• Frank signal and its generalizations
• New Good's type Kronecker power expansions
• On the properties of a new tensor product of matrices
• Reducing the Time Complexity of Testing for Local Threshold Testability
• An Algorithm for the Machine Calculation of Complex Fourier Series

This page was built for publication: Generalization of the fast Fourier transform with a constant structure