Cited by 1,187Mathematical Analysis and Transform MethodsDigital Filter Design and ImplementationAdvanced Electrical Measurement Techniques

Digital computation of the fractional Fourier transform

Open access
Ozaktas, H.M., Arikan, O., Kutay, M.A., Bozdagt, G.·1996·IEEE Transactions on Signal Processing

Abstract

An algorithm for efficient and accurate computation of the fractional Fourier transform is given. For signals with time-bandwidth product N, the presented algorithm computes the fractional transform in O(NlogN) time. A definition for the discrete fractional Fourier transform that emerges from our analysis is also discussed.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/78.536672

Cites

41 of 41 references verified0 citation errors · 0 not checkable

Statistics

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.

A few free checks a day · papers already verified open instantly · results are public

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 Wigner distribution of a chirp multiplication and of a chirp convolution for an f under consideration will be compact and contained in a circle with radius Δ, twice the original support, as explained in appendix A of Ozaktas et al. (1996).

    “As explained in the appendix A of [16]. The Wigner distribution of a chirp multiplication and of a chirp convolution for an f under consideration, will be compact and contained in a circle with radius ∆. That is twice the original support.”

    From Computation of the fractional Fourier transform (2004) · cites this paper as [16]

    Appendix A says chirp multiplication preserves the compactness of the Wigner distribution and gives a bandwidth bound of up to twice the original; it says a similar argument holds for chirp convolution. But it describes the original circle by its diameter, not its radius, and does not establish that both resulting distributions lie in a circle of radius Δ. Its practical definition of compactness also allows a sufficiently large percentage of energy within the circle rather than requiring strict containment. (LLM, conf=0.88)

    Experimental — accuracy not yet measured
  • The bandwidth after chirp multiplication can be doubled, so that the number of samples must be doubled to avoid aliasing, as explained in appendix A of Ozaktas et al. (1996).

    “As explained in the appendix A of [16], the bandwidth after chirp multiplication can be doubled, so that we need to double the number of samples to avoid aliassing.”

    From Computation of the fractional Fourier transform (2004) · cites this paper as [16]

  • The matlab routine fracF implements the algorithm described in Ozaktas et al. (1996) and can be found on the book's web page.

    “First there is the matlab routine fracF , implementing the algorithm described in [16] (see also [17, Section 6.7]). It can we found on the web page [12].”

    From Computation of the fractional Fourier transform (2004) · cites this paper as [16]

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 8

  1. [3]3. A. C. McBride and F. H. Kerr, "On Namias's Eractional Fourier transform," IMA J. Applied Math., vol. 39, pp. 159-175, 1987.
  2. [16]16. H. M. Ozaktas and D. Mendlovic, "Fractional Fourier transformations and their optical implementation: Part 11," J. Opt. Soc. Amer. A , vol. 10, pp. 2522-2531, 1993.
  3. [25]25. Seger, "Model building and restoration with applications in confocal microscopy," Ph.D. Dissertation no. 301, Linkoping Univ., Sweeden, 1993.
  4. [26]26. D. Mendlovic, H. M. Ozaktas, and A. W. Lohmann, "Fractional corre- lation," Appl. Opt., vol. 34, pp. 303-309, 1995.
  5. [35]35. - - tion of signals on time-frequency plane," Electron. Lett., vol. 27, pp. 1159-1161, 1991.
  6. [37]37. ' J. Geophys. Res., vol.-97, pp. 17199-17204, 1992.
  7. [42]42. r391 A. Pauoulis. Sznnal Analysis. NewYork McGraw-Hill, 1977
  8. [46]46. N. Dunford and J. T. Schwartz. Linear Operators. New York: Wiley Interscience, 1964.

Cited by

Sorted by citations

Authors
Ozaktas, H. M., Arikan, O., Kutay, M. A., & Bozdagt, G.
Affiliations
Bilkent University (TR)
Venue
IEEE Transactions on Signal Processing
Published
1996-09
Volume
44
Issue
9
Pages
2141-2150
ISSN
  • 1053-587X (ISSN-L)
  • 1941-0476
OpenAlex
W2108710836
Cited by
1,187
References
41
Citations by year
2026: 40 · 2025: 37 · 2024: 71 · 2023: 51 · 2022: 50 · 2021: 45 · 2020: 55 · 2019: 55 · 2018: 58 · 2017: 57 · 2016: 42 · 2015: 47 · 2014: 53 · 2013: 45 · 2012: 61
FWCI
26.76
Type
journal article
Language
en
Open access
Locations
  • IEEE Transactions on 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 › Engineering › Electrical and Electronic Engineering › Advanced Electrical Measurement Techniques
Keywords
fractional Fourier transform, discrete fractional Fourier transform, time-bandwidth product, computational complexity

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