The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
The Fractional Fourier Transform and Applications
Abstract
This paper describes the “fractional Fourier transform,” which admits computation by an algorithm that has complexity proportional to the fast Fourier transform algorithm. Whereas the discrete Fourier transform (DFT) is based on integral roots of unity $e^{{{ - 2\pi i} / n}} $, the fractional Fourier transform is based on fractional roots of unity $e^{ - 2\pi i\alpha } $ where $\alpha $ is arbitrary. The fractional Fourier transform and the corresponding fast algorithm are useful for such applications as computing DFTs of sequences with prime lengths, computing DFTs of sparse sequences, analyzing sequences with noninteger periodicities, performing high-resolution trigonometric interpolation, detecting lines in noisy images, and detecting signals with linearly drifting frequencies. In many cases, the resulting algorithms are faster by arbitrarily large factors than conventional techniques.
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
Fast fourier transform and convolution algorithms
(1981) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(81)90075-6 · Cited by 679
Fast Fourier Transforms: for fun and profit
Gentleman, W. M., & Sande, G. (1966) · Proceedings of the November 7-10, 1966, fall joint computer conference on XX - AFIPS '66 (Fall) · doi:10.1145/1464291.1464352 · Cited by 542
Discrete Fourier transforms when the number of data samples is prime
Rader, C. M. (1968) · Proceedings of the IEEE · doi:10.1109/proc.1968.6477 · Cited by 535
A linear filtering approach to the computation of discrete Fourier transform
Bluestein, L. (1970) · IEEE Transactions on Audio and Electroacoustics · doi:10.1109/tau.1970.1162132 · Cited by 462
The Chirp z-Transform Algorithm and Its Application
Rabiner, L. R., Schafer, R. W., & Rader, C. M. (1969) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1969.tb04268.x · Cited by 344
FFTs in external or hierarchical memory
Bailey, D. H. (1990) · The Journal of Supercomputing · doi:10.1007/bf00162341 · Cited by 290
Self-citationNew algorithms for digital convolution
Agarwal, R., & Cooley, J. (1977) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1977.1162981 · Cited by 253
FFT algorithms for vector computers
Swarztrauber, P. N. (1984) · Parallel Computing · doi:10.1016/s0167-8191(84)90413-7 · Cited by 179
Self-citationA Linear Filtering Approach to the Computation of the Discrete Fourier Transform
(1969) · The MIT Press eBooks · doi:10.7551/mitpress/5222.003.0018 · Cited by 107
Cited by
Stein, M. L. (1999) · Springer Series in Statistics · doi:10.1007/978-1-4612-1494-6 · Cited by 2,348
Fast Fourier Transforms for Nonequispaced Data
Dutt, A., & Rokhlin, V. (1993) · SIAM Journal on Scientific Computing · doi:10.1137/0914081 · Cited by 918
Electron tomography at 2.4-ångström resolution
Scott, M. C., Chen, C.-C., Mecklenburg, M., Zhu, C., Xu, R., Ercius, P., Dahmen, U., Regan, B. C., & Miao, J. (2012) · Nature · doi:10.1038/nature10934 · Cited by 443
Atomic electron tomography: 3D structures without crystals
Miao, J., Ercius, P., & Billinge, S. J. L. (2016) · Science · doi:10.1126/science.aaf2157 · Cited by 319
Candès, E. J., & Guo, F. (2002) · Signal Processing · doi:10.1016/s0165-1684(02)00300-6 · Cited by 290
Metadata
- Authors
- Bailey, D. H., & Swarztrauber, P. N.
- Venue
- SIAM Review
- Published
- 1991-09
- Volume
- 33
- Issue
- 3
- Pages
- 389-404
- ISSN
- 0036-1445 (ISSN-L)
- 1095-7200
- OpenAlex
- W2078498319
- Cited by
- 333
- References
- 10
- FWCI
- 4.46
- 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
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.