Fast algorithm for calculation of both Walsh-Hadamard and Fourier transforms (FWFTs)

DOI10.1049/EL:19890903zbMATH Open0702.65110OpenAlexW2008957538MaRDI QIDQ3481209FDOQ3481209

Authors: S. Boussakta, J. G. A. Holt 

Publication date: 1989

Published in: Electronics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1049/el:19890903

Recommendations

• Publication:4893175
• Fast algorithm for discrete fractional Hadamard transform
• Fast W transform. Algorithms and programs
• Fast algorithms for the discrete W transform and for the discrete Fourier transform
• scientific article; zbMATH DE number 1737503

zbMATH Keywords

algorithmssparse matricessignal processingfactorizationdiscrete Fourier transformWalsh-Hadamard transformHartley transformbutterfly structurecosine transforms

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Trigonometric interpolation (42A15) Numerical methods for discrete and fast Fourier transforms (65T50)

Cited In (7)

• Fast computation of the discrete Walsh and Hadamard transforms
• Fast algorithm for discrete fractional Hadamard transform
• Conversion factors from Walsh coefficients to Fourier coefficients
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Fast algorithm for calculation of both Walsh-Hadamard and Fourier transforms (FWFTs)

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