Name
Abstract | ||
|---|---|---|
The three-dimensional discrete Hartley transform (3-D DHT) has been proposed as an alternative tool to the 3-D discrete Fourier transform (3-D DFT) for 3-D applications when the data is real. The 3-D DHT has been applied in many three-dimensional image and multidimensional signal processing applications. This paper presents a fast three-dimensional algorithm for computing the 3-D DHT. The mathematical development of this algorithm is introduced and the arithmetic complexity is analysed and compared to related algorithms. Based on a single butterfly implementation, this algorithm is found to offer substantial savings in the total number of multiplications and additions over the familiar row-column approach. |
Year | Venue | Keywords |
|---|---|---|
2000 | EUSIPCO | algorithm design and analysis,vectors,multidimensional signal processing |
Field | DocType | ISBN |
Split-radix FFT algorithm,Prime-factor FFT algorithm,Algorithm,Fast Fourier transform,Discrete Fourier transform (general),Discrete Hartley transform,Hartley transform,Discrete Fourier transform,Discrete sine transform,Mathematics | Conference | 978-952-1504-43-3 |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alshibami, O. | 1 | 6 | 0.87 |
| S. Boussakta | 2 | 135 | 11.59 |