arXiv Open Access 2017

Characterizing and Enumerating Walsh-Hadamard Transform Algorithms

François Serre Markus Püschel

Lihat Sumber

Abstrak

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}}\otimes \text{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.

Topik & Kata Kunci

cs.DS cs.DM

Penulis (2)

François Serre

Markus Püschel

Format Sitasi

APA MLA BibTeX

Serre, F., Püschel, M. (2017). Characterizing and Enumerating Walsh-Hadamard Transform Algorithms. https://arxiv.org/abs/1710.08029

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2017
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓