Cited by 89Mathematical Analysis and Transform MethodsDigital Filter Design and ImplementationFractional Differential Equations Solutions

Multiplicity of fractional Fourier transforms and their relationships

Cariolaro, G., Erseghe, T., Kraniauskas, P., Laurenti, N.·2000·IEEE Transactions on Signal Processing

Abstract

The multiplicity of the fractional Fourier transform (FRT), which is intrinsic in any fractional operator, has been claimed by several authors, but never systematically developed. The paper starts with a general FRT definition, based on eigenfunctions and eigenvalues of the ordinary Fourier transform, which allows us to generate all possible definitions. The multiplicity is due to different choices of both the eigenfunction and the eigenvalue classes. A main result, obtained by a generalized form of the sampling theorem, gives explicit relationships between the different FRTs.

Integrity signals

Registry

Crossref · 10.1109/78.815493

Cites

21 of 21 references verified0 citation errors · 0 not checkable

Statistics

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

Claims the paper makes

This paper’s full text isn’t openly available, 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 definition in [38] and [39] corresponds to a completely distinct definition of the fractional Fourier transform.

    “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 [40]

  • Many other definitions of the discrete fractional Fourier transform exist, but they have several theoretical disadvantages; for example, the fast approximate fractional Fourier transform is not a unitary operator like the discrete transform defined in the paper.

    “Many other definitions of the discrete fractional Fourier transform do exist [2,21,22,5], but they have several theoretical disadvantages. For example the fast approximate fractional Fourier transform that we have discussed before is not a unitary operator like the discrete transform as defined above is.”

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

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Cariolaro, G., Erseghe, T., Kraniauskas, P., & Laurenti, N.
Affiliations
University of Padua (IT)
Venue
IEEE Transactions on Signal Processing
Published
2000
Volume
48
Issue
1
Pages
227-241
ISSN
1053-587X (ISSN-L)
OpenAlex
W2166959930
Cited by
89
References
21
Citations by year
2026: 1 · 2025: 1 · 2024: 2 · 2023: 1 · 2022: 1 · 2021: 1 · 2020: 5 · 2019: 3 · 2018: 4 · 2017: 2 · 2016: 3 · 2015: 3 · 2014: 3 · 2013: 5 · 2012: 4
FWCI
5.03
Type
journal article
Language
en
Open access
closed
Locations
  • IEEE Transactions on Signal Processing (publishedVersion)
  • Padua Research Archive (University of Padova) (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 › Modeling and Simulation › Fractional Differential Equations Solutions
Keywords
fractional Fourier transform, eigenvalues, generalized sampling theorem

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