Characterizing and Enumerating Walsh-Hadamard Transform Algorithms

10/22/2017
by   François Serre, et al.
0

We propose a way of characterizing the algorithms computing a Walsh-Hadamard transform that consist of a sequence of arrays of butterflies (I_2^n-1⊗DFT_2) interleaved by linear permutations. Linear permutations are those that map linearly the binary representation of its element indices. We also propose a method to enumerate these algorithms.

READ FULL TEXT
research
11/10/2015

The Radon cumulative distribution transform and its application to image classification

Invertible image representation methods (transforms) are routinely emplo...
research
06/30/2020

Binary intersection formalized

We provide a reformulation and a formalization of the classical result b...
research
01/02/2018

Computing the Inverse Mellin Transform of Holonomic Sequences using Kovacic's Algorithm

We describe how the extension of a solver for linear differential equati...
research
02/24/2022

An Algorithm for Computing the Covering Radius of a Linear Code Based on Vilenkin-Chrestenson Transform

We present a generalization of Walsh-Hadamard transform that is suitable...
research
03/03/2010

Properties of the Discrete Pulse Transform for Multi-Dimensional Arrays

This report presents properties of the Discrete Pulse Transform on multi...
research
03/08/2021

Geometrical Representation for Number-theoretic Transforms

This short note introduces a geometric representation for binary (or ter...

Please sign up or login with your details

Forgot password? Click here to reset