Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 47 of the 47 references it cites were found in a registry or an index.

Fractional Fourier analysis using the mobius inversion formula

Miao, Hongxia, Zhang, Feng, Tao, Ran · 2019 · IEEE Transactions on Signal Processing

Abstract

Compared with the Fourier analysis, the fractional Fourier analysis is more suitable to process linear frequency modulation type non-stationary functions. To the best of our knowledge, the theoretical framework of the fractional Fourier analysis has not well established yet, especially for the fractional Fourier series (FrFS) and the discrete fractional Fourier transform (DFrFT) algorithms. To tackle with these problems, the efficient FrFS and DFrFT algorithms based on the Möbius function are proposed. First, the existence and applicability of the FrFS are analyzed basing on the Möbius inversion formula. Second, two kinds of fast algorithms for the infinite/finite FrFS are proposed. Then, based on the amplitude scaling relationship between the FrFS and samples of the FrFT, two efficient DFrFT algorithms are obtained, which are noted as the arithmetic discrete fractional Fourier transform (ADFrFT)-I and the ADFrFT-II. Importantly, the multiplication complexity of the two proposed ADFrFT algorithms is reduced to O(M), which is less than that of the state-of-the-art DFrFT algorithms. The parallel butterfly structure of the ADFrFT-II algorithm is suitable for the very large scale integration implementation. Finally, the simulations justify the efficiency of the ADFrFT algorithms in filtering and parameter evaluation of radar and optical signals.

Overview

Integrity signals

Registry

Crossref · 10.1109/tsp.2019.2912878

Cites

47 of 47 references verified0 citation errors · 0 not checkable

Statistics

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

Verification

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?

Citations

Cites

Show all 46 references

Research works printed but not linked: 1

  1. aurel, 1945, An Arithmetical Approach to Ordinary Fourier Series

Cited by

See all 33

Metadata

Authors
Miao, H., Zhang, F., & Tao, R.
Affiliations
Beijing Institute of Technology (CN)
Venue
IEEE Transactions on Signal Processing
Published
2019-06-15
Volume
67
Issue
12
Pages
3181-3196
ISSN
  • 1053-587X (ISSN-L)
  • 1941-0476
OpenAlex
W2941724526
Cited by
32
References
46
Citations by year
2026: 1 · 2025: 8 · 2024: 3 · 2023: 6 · 2022: 4 · 2021: 5 · 2020: 3 · 2019: 2
FWCI
4.57
Type
journal article
Language
en
Open access
closed
Locations
IEEE Transactions on Signal Processing (publishedVersion)
Funders
National Natural Science Foundation of China (61571042, 61331021, 61421001)
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, Möbius inversion, Möbius function, discrete fractional Fourier transform, fast algorithms, linear frequency modulation, non-stationary signals, butterfly structure, VLSI implementation, radar signal processing, optical signal processing

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: Fractional Fourier analysis using the mobius inversion formula. https://app.cochat.ai/papers/10.1109/tsp.2019.2912878
The paper
Miao, H., Zhang, F., & Tao, R. (2019). Fractional Fourier analysis using the mobius inversion formula. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2019.2912878

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.