Cited by 53Mathematical Analysis and Transform MethodsDigital Filter Design and ImplementationMathematical functions and polynomials

The discrete fractional Fourier transform

Candan, C., Kutay, M.A., Ozaktas, H.M.·1999·1999 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings. ICASSP99 (Cat. No.99CH36258)

Abstract

We propose and consolidate a definition of the discrete fractional Fourier transform which generalizes the discrete Fourier transform (DFT) in the same sense that the continuous fractional Fourier transform (FRT) generalizes the continuous ordinary Fourier Transform. This definition is based on a particular set of eigenvectors of the DFT which constitutes the discrete counterpart of the set of Hermite-Gaussian functions. The fact that this definition satisfies all the desirable properties expected of the discrete FRT, supports our confidence that it will be accepted as the definitive definition of this transform.

Integrity signals

Registry

Crossref · 10.1109/icassp.1999.756324

Cites

53 of 53 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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 S_e and S_o matrices have eigenvectors whose number of zero crossings range from 0 to the respective maximum.

    “Therefore, we can show that the and matrices have eigenvectors whose number of zero crossings range from 0 to and from 0 to , respectively [48].”

    From The discrete fractional Fourier transform (2000) · cites this paper as [48]

  • This eigenvalue-based procedure enables accurate determination of the number of zero crossings of an eigenvector without employing any means of counting.

    “This eigenvalue-based procedure enables us to accurately determine the number of zero crossings of an eigenvector without employing any means of counting. [48].”

    From The discrete fractional Fourier transform (2000) · cites this paper as [48]

  • The odd eigenvector derived from the eigenvector of the matrix with zero crossings is an eigenvector of the matrix with zero crossings [48].

    “It can be further shown that the odd eigenvector derived from the eigenvector of with zero crossings is an eigenvector of with zero crossings [48].”

    From The discrete fractional Fourier transform (2000) · cites this paper as [48]

Cites

Flagged first, then by citations

1 of the 54 references couldn’t be matched to a known paper.

Cited by

Sorted by citations

Authors
Candan, C., Kutay, M. A., & Ozaktas, H. M.
Affiliations
Bilkent University (TR)
Venue
1999 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings. ICASSP99 (Cat. No.99CH36258)
Publisher
IEEE
Published
1999
Pages
1713-1716 vol.3
ISSN
1520-6149 (ISSN-L)
OpenAlex
W2155549970
Cited by
52
References
54
Citations by year
2026: 1 · 2024: 1 · 2023: 2 · 2022: 1 · 2021: 1 · 2020: 3 · 2019: 4 · 2017: 1 · 2016: 5 · 2015: 3 · 2014: 2 · 2013: 5 · 2012: 3
FWCI
6.31
Type
conference paper
Language
en
Open access
closed
Locations
  • IEEE International Conference on Acoustics Speech and Signal Processing (publishedVersion)
  • Bilkent University Institutional Repository (Bilkent University) (submittedVersion)
Topics
  • Physical Sciences › Mathematics › Applied Mathematics › Mathematical Analysis and Transform Methods
  • Physical Sciences › Computer Science › Signal Processing › Digital Filter Design and Implementation
  • Physical Sciences › Mathematics › Applied Mathematics › Mathematical functions and polynomials
Keywords
discrete fractional Fourier transform, discrete Fourier transform, fractional Fourier transform, Hermite-Gaussian functions

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