The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
On computing the discrete Hartley transform
Abstract
The discrete Hartley transform (DHT) is a real-valued transform closely related to the DFT of a real-valued sequence. Bracewell has recently demonstrated a radix-2 decimation-in-time fast Hartley transform (FHT) algorithm. In this paper a complete set of fast algorithms for computing the DHT is developed, including decimation-in-frequency, radix-4, split radix, prime factor, and Winograd transform algorithms. The philosophies of all common FFT algorithms are shown to be equally applicable to the computation of the DHT, and the FHT algorithms closely resemble their FFT counterparts. The operation counts for the FHT algorithms are determined and compared to the counts for corresponding real-valued FFT algorithms. The FHT algorithms are shown to always require the same number of multiplications, the same storage, and a few more additions than the real-valued FFT algorithms. Even though computation of the FHT takes more operations, in some situations the inherently real-valued nature of the discrete Hartley transform may justify this extra cost.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
An algorithm for the machine calculation of complex Fourier series
Cooley, J. W., & Tukey, J. W. (1965) · Mathematics of Computation · doi:10.1090/s0025-5718-1965-0178586-1 · Cited by 13,154
Mark, J. W. (1975) · Proceedings of the IEEE · doi:10.1109/proc.1975.9993 · Cited by 1,565
On computing the discrete Fourier transform
Winograd, S. (1978) · Mathematics of Computation · doi:10.1090/s0025-5718-1978-0468306-4 · Cited by 613
Bracewell, R. N. (1984) · Proceedings of the IEEE · doi:10.1109/proc.1984.12968 · Cited by 453
Bracewell, R. N. (1983) · Journal of the Optical Society of America · doi:10.1364/josa.73.001832 · Cited by 445
Duhamel, P., & Hollmann, H. (1984) · Electronics Letters · doi:10.1049/el:19840012 · Cited by 417
On Computing the Discrete Fourier Transform
Winograd, S. (1978) · Mathematics of Computation · doi:10.2307/2006266 · Cited by 279
Index mappings for multidimensional formulation of the DFT and convolution
Burrus, C. (1977) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1977.1162938 · Cited by 191
Self-citationNumerical Analysis: A fast fourier transform algorithm for real-valued series
Bergland, G. D. (1968) · Communications of the ACM · doi:10.1145/364096.364118 · Cited by 136
Number theory in digital signal processing
Agarwal, R. C. (1980) · Proceedings of the IEEE · doi:10.1109/proc.1980.11872 · Cited by 114
Cited by
Real-valued fast Fourier transform algorithms
Sorensen, H., Jones, D., Heideman, M., & Burrus, C. (1987) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1987.1165220 · Cited by 500
Self-citation
Metadata
- Authors
- Sorensen, H., Jones, D., Burrus, C., & Heideman, M.
- Venue
- IEEE Transactions on Acoustics, Speech, and Signal Processing
- Published
- 1985-10
- Volume
- 33
- Issue
- 5
- Pages
- 1231-1238
- ISSN
- 0096-3518 (ISSN-L)
- OpenAlex
- W2028911956
- Cited by
- 277
- References
- 12
- FWCI
- 16.85
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On computing the discrete Hartley transform. https://app.cochat.ai/papers/10.1109/tassp.1985.1164687
- The paper
- Sorensen, H., Jones, D., Burrus, C., & Heideman, M. (1985). On computing the discrete Hartley transform. IEEE Transactions on Acoustics, Speech, and Signal Processing. https://doi.org/10.1109/tassp.1985.1164687
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.