Fast algorithms for Walsh transform in bit-reversed sequency order

DOI10.1007/BF02883560MaRDI QIDQ5955880zbMATH OpenOpenAlexFDO

Authors Meilian Zhou, Bao-Chang Shi, Nengchao Wang, Qing Li

Publication date 18 February 2002

Published in Chinese Science Bulletin (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02883560

zbMATH Keywords

bisection patternbit-reversed sequency orderbit-reversed Walsh orderdiscrete Walsh transformfast algorithmWalsh functions

Mathematics Subject Classification ID

General harmonic expansions, frames (42C15) Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• Algorithms for converting sequency-, dyadic-, and Hadamard-ordered Walsh functions
• scientific article; zbMATH DE number 1778395
• Computation of the Fast Walsh-Fourier Transform
• scientific article; zbMATH DE number 7234326
• scientific article; zbMATH DE number 1839718

Cites work

• Bisection technique for designing synchronous parallel algorithms
• scientific article; zbMATH DE number 3896264 (Why is no real title available?)

Cited in

(7)

• Algorithms for converting sequency-, dyadic-, and Hadamard-ordered Walsh functions
• scientific article; zbMATH DE number 7234326 (Why is no real title available?)
• On an Ordering of Walsh Functions
• scientific article; zbMATH DE number 1778395 (Why is no real title available?)
• Walsh matrix's copy generation and its computer images
• scientific article; zbMATH DE number 5046521 (Why is no real title available?)
• Evolving generation and fast algorithms of slantlet transform and slantlet-Walsh transform

This page was built for publication: Fast algorithms for Walsh transform in bit-reversed sequency order

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