Method of fast 1-D paired transforms for computing the 2-D discrete Hadamard transform

DOI10.1109/82.899632zbMATH Open0981.65157OpenAlexW2115032969MaRDI QIDQ2732965FDOQ2732965

Authors: Artyom M. Grigoryan, Sos Agaian 

Publication date: 9 August 2001

Published in: IEEE Transactions on Circuits and Systems. II: Analog and Digital Signal Processing (Search for Journal in Brave)

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

Recommendations

• Method of fast 1-D paired transforms for computing the 2-D discrete Hadamard transform
• Fast algorithm for discrete fractional Hadamard transform
• Split manageable efficient algorithm for Fourier and Hadamard transforms
• New algorithms for multidimensional discrete Hartley transform
• scientific article; zbMATH DE number 3951888

zbMATH Keywords

algorithmfast algorithmssplittingdiscrete Hadamard transformdiscrete paired transforms

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

Cited In (2)

• Split manageable efficient algorithm for Fourier and Hadamard transforms
• Method of fast 1-D paired transforms for computing the 2-D discrete Hadamard transform

This page was built for publication: Method of fast 1-D paired transforms for computing the 2-D discrete Hadamard transform

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