A Recursive Algorithm for Sequency-Ordered Fast Walsh Transforms

DOI10.1109/TC.1977.1674921MaRDI QIDQ4164773zbMATH OpenOpenAlexFDO

Authors

Publication date 1977

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

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

Mathematics Subject Classification ID

Numerical methods for trigonometric approximation and interpolation (65T40) Analysis of algorithms and problem complexity (68Q25)

Cited in

(4)

• Natural-ordered complex Hadamard transform
• Algorithms for converting sequency-, dyadic-, and Hadamard-ordered Walsh functions
• Seasonal time series forecasting by the Walsh-transformation based technique
• Solutions of nonlinear differential equations with feature detection using fast Walsh transforms

This page was built for publication: A Recursive Algorithm for Sequency-Ordered Fast Walsh Transforms

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