Abstract
Three methods have been described for computing the two-dimensional, discrete Hartley transform. Two of these employ a separable transform; the third method, the vector-radix algorithm, does not require separability. In-place computation of the vector-radix method is described. Operation counts and execution times indicate that the vector-radix method is fastest.
Original language | English (US) |
---|---|
Pages (from-to) | 818-822 |
Number of pages | 5 |
Journal | Journal of the Optical Society of America A: Optics and Image Science, and Vision |
Volume | 6 |
Issue number | 6 |
DOIs | |
State | Published - Jun 1989 |
Externally published | Yes |
ASJC Scopus subject areas
- Electronic, Optical and Magnetic Materials
- Atomic and Molecular Physics, and Optics
- Computer Vision and Pattern Recognition