Computation of the Fast Walsh-Fourier Transform

DOI10.1109/T-C.1969.222685zbMath0174.20703MaRDI QIDQ5562359

John L. Shanks

Publication date: 1969

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

zbMATH Keywords

efficient Walsh transform computation algorithmmultiplicative iteration equation

Mathematics Subject Classification ID

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

Related Items (9)

Approximation by double least-squares inverses ⋮ Seasonal time series forecasting by the Walsh-transformation based technique ⋮ A state-space approach to Walsh series solution of linear systems ⋮ ECG data compression using fast Walsh transform and its clinical acceptability ⋮ On spectral techniques in analysis of Boolean networks ⋮ Distributed parameter system identification via Walsh functions ⋮ On the Fourier transform of sequency limited signals with applications to delta modulation and medicine† ⋮ Solution and identification of discrete state-space equations via Walsh functions ⋮ Counting Boolean functions with specified values in their Walsh spectrum

This page was built for publication: Computation of the Fast Walsh-Fourier Transform