Split manageable efficient algorithm for Fourier and Hadamard transforms

DOI10.1109/78.815487zbMath1010.65057OpenAlexW2087375257MaRDI QIDQ2734280

Artyom M. Grigoryan, Sos S. Agaian

Publication date: 14 August 2001

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

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

zbMATH Keywords

algorithmsFourier transformsHadamard transformunitary transformsfast transformationspaired transformssplitting transformations

Mathematics Subject Classification ID

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

Related Items (5)

Representation of the Fourier transform by Fourier series ⋮ Resolution map in quantum computing: signal representation by periodic patterns ⋮ Fast Fourier transform using matrix decomposition ⋮ Tensor transform-based quaternion Fourier transform algorithm ⋮ Paired quantum Fourier transform with \(\log_2N\) Hadamard gates

This page was built for publication: Split manageable efficient algorithm for Fourier and Hadamard transforms