scientific article; zbMATH DE number 7234326

DOI10.14188/J.1671-8836.2019.06.007MaRDI QIDQ3307112zbMATH OpenFDO

Authors Enhua Jiang

Publication date 12 August 2020

Full work available at URL https://doi.org/10.14188/J.1671-8836.2019.06.007

zbMATH Keywords

Boolean functionparallel computingspectral techniquesWalsh-Hadamard transform

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Boolean functions (94D10)

Recommendations

• Fast Walsh–Hadamard–Fourier Transform Algorithm
• Computation of the Fast Walsh-Fourier Transform
• scientific article; zbMATH DE number 3997125
• Fast computation of the discrete Walsh and Hadamard transforms
• scientific article; zbMATH DE number 1839718
• scientific article; zbMATH DE number 1267276
• A PARALLEL FAST FOURIER TRANSFORM
• Fast algorithms for Walsh transform in bit-reversed sequency order
• Fast algorithm for calculation of both Walsh-Hadamard and Fourier transforms (FWFTs)
• Fast Fourier transform algorithms for parallel computers

Cited in

(15)

• Modelling Hadamard Haar transform algorithm for Omega connected multiprocessors
• A multivariate fast discrete Walsh transform with an application to function interpolation
• A method for the analytical determination of the Walsh transform of switching functions
• scientific article; zbMATH DE number 3949544 (Why is no real title available?)
• scientific article; zbMATH DE number 494405 (Why is no real title available?)
• scientific article; zbMATH DE number 494450 (Why is no real title available?)
• scientific article; zbMATH DE number 1778395 (Why is no real title available?)
• scientific article; zbMATH DE number 3992799 (Why is no real title available?)
• scientific article; zbMATH DE number 1839718 (Why is no real title available?)
• scientific article; zbMATH DE number 2114154 (Why is no real title available?)
• Properties and ways of calculation of multi-polarity generalized Walsh transforms
• Computation of the Fast Walsh-Fourier Transform
• Fast algorithms for Walsh transform in bit-reversed sequency order
• Improved algorithm about NSFOT
• A block splitting technique for fast 2D Walsh transform

This page was built for publication:

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