Split manageable efficient algorithm for Fourier and Hadamard transforms

DOI10.1109/78.815487MaRDI QIDQ2734280zbMATH OpenOpenAlexFDO

Authors Artyom M. Grigoryan, Sos 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

algorithmsfast transformationsFourier transformsHadamard transformpaired transformssplitting transformationsunitary transforms

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3926792
• Method of fast 1-D paired transforms for computing the 2-D discrete Hadamard transform
• Method of fast 1-D paired transforms for computing the 2-D discrete Hadamard transform
• scientific article; zbMATH DE number 3926791
• Fast algorithm for discrete fractional Hadamard transform

Cited in

(9)

• Tensor transform-based quaternion Fourier transform algorithm
• Paired quantum Fourier transform with \(\log_2N\) Hadamard gates
• Resolution map in quantum computing: signal representation by periodic patterns
• Method of fast 1-D paired transforms for computing the 2-D discrete Hadamard transform
• Method of fast 1-D paired transforms for computing the 2-D discrete Hadamard transform
• Comments on "Split Manageable Efficient Algorithm for Fourier and Hadamard Transforms
• Response to: ``Comments on: `Split manageable efficient algorithm for Fourier and Hadamard transforms{'}
• Fast Fourier transform using matrix decomposition
• Representation of the Fourier transform by Fourier series

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

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