New algorithms for multidimensional discrete Hartley transform (Q1603609)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1767832
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New algorithms for multidimensional discrete Hartley transform |
scientific article; zbMATH DE number 1767832 |
Statements
New algorithms for multidimensional discrete Hartley transform (English)
0 references
15 July 2002
0 references
New fast algorithms for multidimensional discrete Hartley transform (MD-DHT) are presented. Based on the index mapping and multidimensional polynomial transform (PT), the MD-DHT is converted into a series of one-dimensional type-II discrete W transform and PTs. The proposed fast algorithms achieve considerable savings on the number of operations. For example, the number of multiplications for computing an \(r\)-dimensional DHT is only \(1/r\) times that needed by the row-column method, and the number of additions is also reduced considerably. Detailed analysis of the computational complexity is also presented.
0 references
fast algorithm
0 references
discrete Hartley transform
0 references
multidimensional signal processing
0 references
computational complexity
0 references
0.917373538017273
0 references
0.9170212745666504
0 references
0.8685329556465149
0 references
0.862466037273407
0 references
0.8451964259147644
0 references
