The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
The fast Hartley transform
Abstract
A fast algorithm has been worked out for performing the Discrete Hartley Transform (DHT) of a data sequence of N elements in a time proportional to Nlog2N. The Fast Hartley Transform (FHT) is as fast as or faster than the Fast Fourier Transform (FFT) and serves for all the uses such as spectral analysis, digital processing, and convolution to which the FFT is at present applied. A new timing diagram (stripe diagram) is presented to illustrate the overall dependence of running time on the subroutines composing one implementation; this mode of presentation supplements the simple counting of multiplies and adds. One may view the Fast Hartley procedure as a sequence of matrix operations on the data and thus as constituting a new factorization of the DFT matrix operator; this factorization is presented. The FHT computes convolutions and power spectra distinctly faster than the FFT.
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
The Fourier Transform and its Applications
Cattermole, K. W. (1965) · Electronics and Power · doi:10.1049/ep.1965.0268 · Cited by 1,417
Terman, F. E. (1943) · Virtual Defense Library (Ministerio de Defensa) · Cited by 1,017
A guided tour of the fast Fourier transform
Bergland, G. D. (1969) · IEEE Spectrum · doi:10.1109/mspec.1969.5213896 · Cited by 673
Bracewell, R. N. (1983) · Journal of the Optical Society of America · doi:10.1364/josa.73.001832 · Cited by 445
Self-citationAhmed, N., & Rao, K. R. (1975) · Orthogonal Transforms for Digital Signal Processing · doi:10.1007/978-3-642-45450-9_4 · Cited by 373
Numerical 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
A winograd-Fourier transform algorithm for real-valued data
Parsons, T. W. (1979) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1979.1163263 · Cited by 14
Cited by
Active noise control: a tutorial review
Kuo, S. M., & Morgan, D. R. (1999) · Proceedings of the IEEE · doi:10.1109/5.763310 · Cited by 1,268
Prefrontal Brain Asymmetry: A Biological Substrate of the Behavioral Approach and Inhibition Systems
Sutton, S. K., & Davidson, R. J. (1997) · Psychological Science · doi:10.1111/j.1467-9280.1997.tb00413.x · Cited by 1,263
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
Suppression and enhancement of emotional responses to unpleasant pictures
Jackson, D. C., Malmstadt, J. R., Larson, C. L., & Davidson, R. J. (2000) · Psychophysiology · doi:10.1111/1469-8986.3740515 · Cited by 459
A review of optical image encryption techniques
Liu, S., Guo, C., & Sheridan, J. T. (2014) · Optics & Laser Technology · doi:10.1016/j.optlastec.2013.05.023 · Cited by 406
Metadata
- Authors
- Bracewell, R. N.
- Venue
- Proceedings of the IEEE
- Published
- 1984
- Volume
- 72
- Issue
- 8
- Pages
- 1010-1018
- ISSN
- 0018-9219 (ISSN-L)
- OpenAlex
- W1975754844
- Cited by
- 453
- References
- 8
- FWCI
- 29.10
- 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: The fast Hartley transform. https://app.cochat.ai/papers/10.1109/proc.1984.12968
- The paper
- Bracewell, R. N. (1984). The fast Hartley transform. Proceedings of the IEEE. https://doi.org/10.1109/proc.1984.12968
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.