Fast Walsh–Hadamard–Fourier Transform Algorithm

DOI10.1109/TSP.2011.2162836MaRDI QIDQ4573334zbMATH OpenFDO

Authors Monir T. Hamood, S. Boussakta

Publication date 18 July 2018

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

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

Mathematics Subject Classification ID

Nontrigonometric harmonic analysis involving wavelets and other special systems (42C40) Numerical methods for discrete and fast Fourier transforms (65T50)

Cited in

(5)

• Fast W transform. Algorithms and programs
• scientific article; zbMATH DE number 7234326 (Why is no real title available?)
• scientific article; zbMATH DE number 3949544 (Why is no real title available?)
• The Fast Hartley Transform Algorithm
• Evolving generation and fast algorithms of slantlet transform and slantlet-Walsh transform

This page was built for publication: Fast Walsh–Hadamard–Fourier Transform Algorithm

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