Fast DHT algorithms for length \(N=q*2^m\) (Q2732815)
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: Fast DHT algorithms for length N=q*2ᵐ |
scientific article; zbMATH DE number 1632221
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast DHT algorithms for length \(N=q*2^m\) |
scientific article; zbMATH DE number 1632221 |
Statements
19 March 2002
0 references
signal processing
0 references
split-radix algorithm
0 references
discrete Hartley transforms
0 references
0.8981327
0 references
0.87999904
0 references
0.86025286
0 references
0.8320701
0 references
0.81269926
0 references
0.8120767
0 references
0 references
0.80026704
0 references
Fast DHT algorithms for length \(N=q*2^m\) (English)
0 references
