The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Product and Convolution Theorems for the Fractional Fourier Transform
Abstract
The fractional Fourier transform (FRFT) is a generalization of the classical Fourier transform (FT). It has recently found applications in several areas, including signal processing and optics. Many properties of this transform are already known, but an extension of the FT's convolution theorem is still missing. The purpose of this paper is to introduce extensions of this theorem, dealing with the FRFT of a product and of a convolution of two functions.
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
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
Immersion of the Fourier transform in a continuous group of functional transformations
Condon, E. U. (1937) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.23.3.158 · Cited by 174
Hermitian polynomials and Fourier analysis
Wiener, N. (1929) · Journal of Mathematics and Physics · doi:10.1002/sapm19298170 · Cited by 142
Research works printed but not linked: 8
- 10.1524/zkri.1959.112.1-6.22 · doi:10.1524/zkri.1959.112.1-6.22
- 10.1093/imamat/25.3.241 · DOI · Paper page
- seger, 1993, Model building and restoration with applications in confocal microscopy
- 10.1002/cpa.3160140303 · DOI · Paper page
- 10.1109/78.330368 · DOI · Paper page
- 10.1109/ICASSP.1993.319481 · DOI
- 10.1364/JOSAA.10.002181 · DOI · Paper page
- 10.1007/BF02055756 · DOI · Paper page
Cited by
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
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
Relations between fractional operations and time-frequency distributions, and their applications
Pei, S.-C., & Ding, J.-J. (2001) · IEEE Transactions on Signal Processing · doi:10.1109/78.934134 · Cited by 318
A convolution and product theorem for the fractional Fourier transform
Zayed, A. I. (1998) · IEEE Signal Processing Letters · doi:10.1109/97.664179 · Cited by 239
Time delay estimation using fractional Fourier transform
Sharma, K. K., & Joshi, S. D. (2007) · Signal Processing · doi:10.1016/j.sigpro.2006.08.007 · Cited by 62
Metadata
- Authors
- Almeida, L. B.
- Venue
- IEEE Signal Processing Letters
- Published
- 1997-01
- Volume
- 4
- Issue
- 1
- Pages
- 15-17
- ISSN
- 1070-9908 (ISSN-L)
- 1558-2361
- OpenAlex
- W2059551206
- Cited by
- 168
- References
- 3
- FWCI
- 9.09
- 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: Product and Convolution Theorems for the Fractional Fourier Transform. https://app.cochat.ai/papers/10.1109/97.551689
- The paper
- Almeida, L. B. (1997). Product and Convolution Theorems for the Fractional Fourier Transform. IEEE Signal Processing Letters. https://doi.org/10.1109/97.551689
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.