The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Closed-form discrete fractional and affine Fourier transforms
Abstract
The discrete fractional Fourier transform (DFRFT) is the generalization of discrete Fourier transform. Many types of DFRFT have been derived and are useful for signal processing applications. We introduce a new type of DFRFT, which are unitary, reversible, and flexible; in addition, the closed-form analytic expression can be obtained. It works in performance similar to the continuous fractional Fourier transform (FRFT) and can be efficiently calculated by the FFT. Since the continuous FRFT can be generalized into the continuous affine Fourier transform (AFT) (the so-called canonical transform), we also extend the DFRFT into the discrete affine Fourier transform (DAFT). We derive two types of the DFRFT and DAFT. Type 1 is similar to the continuous FRFT and AFT and can be used for computing the continuous FRFT and AFT. Type 2 is the improved form of type 1 and can be used for other applications of digital signal processing. Meanwhile, many important properties continuous FRFT and AFT are kept in the closed-form DFRFT and DAFT, and some applications, such as filter design and pattern recognition, are also discussed. The closed-form DFRFT we introduce has the lowest complexity among all current DFRFTs that is still similar to the continuous FRFT.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Ahmed, N., Natarajan, T., & Rao, K. R. (1974) · IEEE Transactions on Computers · doi:10.1109/t-c.1974.223784 · Cited by 5,156
The fractional Fourier transform and time-frequency representations
Almeida, L. B. (1994) · IEEE Transactions on Signal Processing · doi:10.1109/78.330368 · Cited by 1,924
The Fractional Order Fourier Transform and its Application to Quantum Mechanics
NAMIAS, V. (1980) · IMA Journal of Applied Mathematics · doi:10.1093/imamat/25.3.241 · Cited by 1,722
Digital computation of the fractional Fourier transform
Ozaktas, H. M., Arikan, O., Kutay, M. A., & Bozdagt, G. (1996) · IEEE Transactions on Signal Processing · doi:10.1109/78.536672 · Cited by 1,187
Image rotation, Wigner rotation, and the fractional Fourier transform
Lohmann, A. W. (1993) · Journal of the Optical Society of America A · doi:10.1364/josaa.10.002181 · Cited by 1,019
Linear Canonical Transformations and Their Unitary Representations
Moshińsky, M., & Quesne, C. (1971) · Journal of Mathematical Physics · doi:10.1063/1.1665805 · Cited by 845
Fast algorithms for the discrete W transform and for the discrete Fourier transform
Wang, Z. (1984) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1984.1164399 · Cited by 597
Discrete fractional Fourier-transform based on orthogonal projections
Pei, S.-C., Yeh, M.-H., & Tseng, C.-C. (1999) · IEEE Transactions on Signal Processing · doi:10.1109/78.757221 · Cited by 297
Self-citationEigenvectors and functions of the discrete Fourier transform
Dickinson, B., & Steiglitz, K. (1982) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1982.1163843 · Cited by 252
Abe, S., & Sheridan, J. T. (1994) · Optics Letters · doi:10.1364/ol.19.001801 · Cited by 241
Cited by
Fractional Fourier transform as a signal processing tool: An overview of recent developments
Sejdić, E., Djurović, I., & Stanković, L. (2011) · Signal Processing · doi:10.1016/j.sigpro.2010.10.008 · Cited by 424
Short-Time Fractional Fourier Transform and Its Applications
Tao, R., Li, Y.-L., & Wang, Y. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2028095 · Cited by 293
A method for the discrete fractional Fourier transform computation
Yeh, M.-H., & Pei, S.-C. (2003) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2002.808113 · Cited by 55
Self-citationFractional Fourier analysis using the mobius inversion formula
Miao, H., Zhang, F., & Tao, R. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2019.2912878 · Cited by 32
Metadata
- Authors
- Pei, S.-C., & Ding, J.-J.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2000-05
- Volume
- 48
- Issue
- 5
- Pages
- 1338-1353
- ISSN
- 1053-587X (ISSN-L)
- OpenAlex
- W2169103119
- Cited by
- 345
- References
- 23
- FWCI
- 5.03
- 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: Closed-form discrete fractional and affine Fourier transforms. https://app.cochat.ai/papers/10.1109/78.839981
- The paper
- Pei, S.-C., & Ding, J.-J. (2000). Closed-form discrete fractional and affine Fourier transforms. IEEE Transactions on Signal Processing. https://doi.org/10.1109/78.839981
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.