Duhamel/Hollmann-Like Discrete Fourier Transform Algorithm With the Smallest Multiplicative Complexity Over a Finite Field

DOI10.1109/TSP.2020.3015419OpenAlexW3048529937MaRDI QIDQ5103032

S. V. Fedorenko

Publication date: 23 September 2022

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tsp.2020.3015419

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

This page was built for publication: Duhamel/Hollmann-Like Discrete Fourier Transform Algorithm With the Smallest Multiplicative Complexity Over a Finite Field