Name
Abstract | ||
|---|---|---|
The three-dimensional discrete Hartley transform (3-D DHT) has been applied in a wide range of 3-D applications such as 3-D power spectrum analysis, 3-D filtering, and medical applications, etc. In this paper, a three-dimensional algorithm for fast computation of the three-dimensional discrete Hartley transform is developed. The mathematical concept and derivation is presented and the arithmetic complexity is analysed and compared to the familiar row-column approach. It is found that this algorithm offers substantial savings in both the number of multiplications and additions. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1016/S0165-1684(01)00102-5 | Signal Processing |
Keywords | Field | DocType |
medical application,3-d dht,3-d power spectrum analysis,3-d decimation-in-frequency algorithm,fast computation,three-dimensional algorithm,mathematical concept,3-d application,3-d hartley,familiar row-column approach,arithmetic complexity,three-dimensional discrete hartley,three dimensional,discrete hartley transform | Signal processing,Filter (signal processing),Algorithm,Fast Fourier transform,Spectral density,Discrete Fourier transform (general),Hartley transform,Discrete Hartley transform,Rader's FFT algorithm,Mathematics | Journal |
Volume | Issue | ISSN |
82 | 1 | Signal Processing |
Citations | PageRank | References |
6 | 0.55 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| O. Alshibami | 1 | 10 | 1.45 |
| S. Boussakta | 2 | 135 | 11.59 |