The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Eigenvectors and functions of the discrete Fourier transform
Abstract
A method is presented for computing an orthonormal set of eigenvectors for the discrete Fourier transform (DFT). The technique is based on a detailed analysis of the eigenstructure of a special matrix which commutes with the DFT. It is also shown how fractional powers of the DFT can be efficiently computed, and possible applications to multiplexing and transform coding are suggested.
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The definition in [38] and [39] corresponds to a completely distinct definition of the fractional Fourier transform [40].”
From The discrete fractional Fourier transform (2000) · cites this paper as [38]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“This transform matrix is unitary since the eigenvalues of the DFT matrix have unit magnitude [38], [41].”
From The discrete fractional Fourier transform (2000) · cites this paper as [38]
The cited source says what the claim attributes to it.
In the citing paper
“They suggest defining the discrete FRT in terms of a particular set of eigenvectors (previously discussed in [38]), which they claim to be the discrete analogs of the Hermite-Gaussian functions”
From The discrete fractional Fourier transform (2000) · cites this paper as [38]
The cited source says what the claim attributes to it.
In the citing paper
“The matrix was previously employed in [38].”
From The discrete fractional Fourier transform (2000) · cites this paper as [38]
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“It is known that when is not a multiple of 4, all of the eigenvalues of are distinct [38].”
From The discrete fractional Fourier transform (2000) · cites this paper as [38]
Experimental — accuracy not yet measured
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
Perturbation Theory for Linear Operators
Kato, T. (1995) · Classics in Mathematics · doi:10.1007/978-3-642-66282-9 · Cited by 16,290
Perturbation theory for linear operators
Kato, T. (1966) · Springer eBooks · doi:10.1007/978-3-662-12678-3 · Cited by 7,131
The algebraic eigenvalue problem
Wilkinson, J. H. (1965) · Cited by 5,833
The Algebraic Eigenvalue Problem
I., E., & Wilkinson, J. H. (1966) · Mathematics of Computation · doi:10.2307/2003558 · Cited by 5,140
Lancaster, P. (1969) · Medical Entomology and Zoology · Cited by 2,652
Theory and Application of Mathieu Functions
McLachlan, N. W. (1964) · CERN Document Server (European Organization for Nuclear Research) · Cited by 2,343
The Theory of Matrices in Numerical Analysis.
Haynsworth, E. V., & Householder, A. S. (1966) · The American Mathematical Monthly · doi:10.2307/2314680 · Cited by 1,363
THE THEORY OF MATRICES IN NUMERICAL ANALYSIS
Mirsky, L. (1965) · Journal of the London Mathematical Society · doi:10.1112/jlms/s1-40.1.378b · Cited by 1,148
Orthogonal Transforms for Digital Signal Processing
Ahmed, N., & Rao, K. R. (1975) · Springer eBooks · doi:10.1007/978-3-642-45450-9 · Cited by 948
Orthogonal transforms for digital signal processing
Rao, K., & Ahmed, N. (2005) · ICASSP '76. IEEE International Conference on Acoustics, Speech, and Signal Processing · doi:10.1109/icassp.1976.1170121 · Cited by 830
Research works printed but not linked: 1
- landau, 1950, Vorlesungen �ber Zahlentheorie, 1, 164
Cited by
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
Fractional Fourier transforms and their optical implementation: I
Mendlovic, D., & Ozaktas, H. M. (1993) · Journal of the Optical Society of America A · doi:10.1364/josaa.10.001875 · Cited by 848
The discrete fractional Fourier transform
Candan, C., Kutay, M. A., & Ozaktas, H. M. (2000) · IEEE Transactions on Signal Processing · doi:10.1109/78.839980 · Cited by 683
Ozaktas, H. M., Mendlovic, D., Onural, L., & Barshan, B. (1994) · Journal of the Optical Society of America A · doi:10.1364/josaa.11.000547 · Cited by 483
Metadata
- Authors
- Dickinson, B., & Steiglitz, K.
- Affiliations
- Princeton University (US)
- Venue
- IEEE Transactions on Acoustics, Speech, and Signal Processing
- Published
- 1982-02
- Volume
- 30
- Issue
- 1
- Pages
- 25-31
- ISSN
- 0096-3518 (ISSN-L)
- OpenAlex
- W2132538465
- Semantic Scholar
- 657cca46bb3f02667962ea43293e02acb83fc02d
- Cited by
- 252
- References
- 23
- Citations by year
- 2026: 2 · 2025: 2 · 2024: 5 · 2023: 31 · 2022: 6 · 2021: 5 · 2020: 6 · 2019: 8 · 2018: 12 · 2017: 7 · 2016: 5 · 2015: 8 · 2014: 10 · 2013: 9 · 2012: 9
- FWCI
- 1.72
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- IEEE Transactions on Acoustics Speech and Signal Processing (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Signal Processing › Digital Filter Design and Implementation
- Physical Sciences › Mathematics › Applied Mathematics › Mathematical Analysis and Transform Methods
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Matrix Theory and Algorithms
- Keywords
- discrete Fourier transform, eigenvectors, eigenstructure, commuting matrices, transform coding, multiplexing
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: Eigenvectors and functions of the discrete Fourier transform. https://app.cochat.ai/papers/10.1109/tassp.1982.1163843
- The paper
- Dickinson, B., & Steiglitz, K. (1982). Eigenvectors and functions of the discrete Fourier transform. IEEE Transactions on Acoustics, Speech, and Signal Processing. https://doi.org/10.1109/tassp.1982.1163843
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.