Fast algorithm for calculation of both Walsh-Hadamard and Fourier transforms (FWFTs) (Q3481209)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:3481209 |
scientific article; zbMATH DE number 4151796
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast algorithm for calculation of both Walsh-Hadamard and Fourier transforms (FWFTs) |
scientific article; zbMATH DE number 4151796 |
Statements
Fast algorithm for calculation of both Walsh-Hadamard and Fourier transforms (FWFTs) (English)
0 references
1989
0 references
signal processing
0 references
algorithms
0 references
Hartley transform
0 references
discrete Fourier transform
0 references
Walsh-Hadamard transform
0 references
factorization
0 references
sparse matrices
0 references
butterfly structure
0 references
cosine transforms
0 references
0.8055115342140198
0 references
0.7878159284591675
0 references
0.7851840257644653
0 references
