Fractional Fourier analysis using the mobius inversion formula
The DOI matches its Crossref record; 47 of the 47 references it cites were found in a registry or an index.
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
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“At present, time-domain equalization, such as decision feedback equalization based on recursive least squares (RLSs), is extensively used in mud communication systems [12].”
From A Fractional Fourier Transform-Based Channel Estimation and Equalization Algorithm for Mud Pulse Telemetry (2025) · cites this paper as [12]
Citations
Cites
The fractional Fourier transform and time-frequency representations
Almeida, L. B. (1994) · IEEE Transactions on Signal Processing · doi:10.1109/78.330368 · Cited by 1,924 · cited 1×
“The detailed and complete list of properties of the FrFT are shown in [34].”
BackgroundDigital computation of the fractional Fourier transform
Ozaktas, H. M., Arikan, O., Kutay, M. A., & Bozdagt, G. (1996) · IEEE Transactions on Signal Processing · doi:10.1109/78.536672 · Cited by 1,187 · cited 4×
“The f(t) in the matched fractional domain, which is implemented by accurate ADFrFT-II algorithm, sampling type algorithm[19] and eigenvector decomposition algorithm [43], is presented in Fig.”
MethodInfluentialClosed-form discrete fractional and affine Fourier transforms
Pei, S.-C., & Ding, J.-J. (2000) · IEEE Transactions on Signal Processing · doi:10.1109/78.839981 · Cited by 345 · cited 3×
“The comparisons of computation complexity of the eigenvector decomposition type, sampling type [20] and the proposed finite ADFrFT-I/II type algorithms are listed in Table III, which displays that the proposed algorithms have the lowest multiplicative complexity.”
MethodDiscrete fractional Fourier-transform based on orthogonal projections
Pei, S.-C., Yeh, M.-H., & Tseng, C.-C. (1999) · IEEE Transactions on Signal Processing · doi:10.1109/78.757221 · Cited by 297 · cited 1×
“Eigenvectors decomposition type algorithms [22]–[27] are derived by properly designing the eigenvectors of discrete Fourier transform matrix, their accuracy depends on how similar the eigenvectors to the continuous Hermite functions.”
MethodA 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
Fresnel diffraction and the fractional-order Fourier transform
Pellat-Finet, P. (1994) · Optics Letters · doi:10.1364/ol.19.001388 · Cited by 233
Martone, M. (2001) · IEEE Transactions on Communications · doi:10.1109/26.930631 · Cited by 231 · cited 3×
“One indirect way to calculate the FrFS can be realized according to amplitude scaling relationship between the DFrFT and the FrFS [17].”
MethodInfluentialImproved discrete fractional Fourier transform
Pei, S.-C., & Yeh, M.-H. (1997) · Optics Letters · doi:10.1364/ol.22.001047 · Cited by 188 · cited 1×
“Other types of algorithms, like linear combination type [31], [32] and group theory type [33] algorithms, have limited applications for the non-orthogonal basis or too many constraints on the signals and parameters.”
BackgroundUnified fractional Fourier transform and sampling theorem
Erseghe, T., Kraniauskas, P., & Carioraro, G. (1999) · IEEE Transactions on Signal Processing · doi:10.1109/78.806089 · Cited by 170 · cited 2×
“Definition 3: A chirp-periodic function of order α [18] is defined for a real function f(t) satisfying f(t− T )e cotα 2 (t−T )(2) = f(t)e cotα 2 t 2 , where the chirp period T is a real number.”
BackgroundMethodPei, S., Yeh, M.-H., & Luo, T.-L. (1999) · IEEE Transactions on Signal Processing · doi:10.1109/78.790671 · Cited by 148 · cited 4×
“INTRODUCTION FRACTIONAL Fourier analysis generalizes the conventional Fourier analysis which can only analyze functions in the frequency domain, it can capture the characteristics of functions in the mixed time and frequency domains, called fractional domain [1].”
BackgroundMethodInfluential
Research works printed but not linked: 1
- aurel, 1945, An Arithmetical Approach to Ordinary Fourier Series
Cited by
UAV Detection and Localization Based on Multi-Dimensional Signal Features
Nie, W., Han, Z.-C., Yi, L., He, W., Xie, L., Yang, X., & Zhou, M. (2021) · IEEE Sensors Journal · doi:10.1109/jsen.2021.3105229 · Cited by 82
Mateo, C., & Talavera, J. A. (2020) · Signal Image and Video Processing · doi:10.1007/s11760-020-01701-8 · Cited by 80
“For example, the fractional Fourier transform (FRFT) is a generalization of the conventional Fourier analysis which aims to capture the characteristics of functions in the mixed time and frequency domains, called fractional domain [13].”
BackgroundDeep Scattering Network With Fractional Wavelet Transform
Shi, J., Zhao, Y., Xiang, W., Monga, V., Liu, X., & Tao, R. (2021) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2021.3098936 · Cited by 66
Self-citationFractional Stockwell transform: Theory and applications
Wei, D., & Zhang, Y. (2021) · Digital Signal Processing · doi:10.1016/j.dsp.2021.103090 · Cited by 58
Feng, S., Zhang, J., Fan, Y., Liu, X., Zhao, C., Li, W., & Tao, R. (2025) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2025.3570466 · Cited by 39
“This makes it particularly suitable for processing non-stationary signals [29].”
Self-citationOptimized sparse fractional Fourier transform: Principle and performance analysis
Zhang, H., Shan, T., Liu, S., & Tao, R. (2020) · Signal Processing · doi:10.1016/j.sigpro.2020.107646 · Cited by 38
Self-citationFeng, S., Lan, T., Fan, Y., Zhang, M., Zhao, C., Li, W., & Tao, R. (2025) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2025.3586714 · Cited by 37
“In addition, it can better handle nonsmooth signals and provide more accurate time–frequency analysis [49], [50].”
Self-citationSparse discrete linear canonical transform and its applications
Wei, D., & Hu, H. (2021) · Signal Processing · doi:10.1016/j.sigpro.2021.108046 · Cited by 34
LFM signal optimization time-fractional-frequency analysis: Principles, method and application
Guo, Y. X., & Yang, L. (2022) · Digital Signal Processing · doi:10.1016/j.dsp.2022.103505 · Cited by 28
Miao, H., Zhang, F., & Tao, R. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2019.2941072 · Cited by 23
“, when A = (0, 1;−1, 0) and A = (cos θ, sin θ;− sin θ, cos θ), θ ∈ [0, 2π), it becomes the FT and the fractional FT [36], respectively.”
Self-citationMa, J., Tao, R., Li, Y., & Kang, X. (2020) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.3007360 · Cited by 19
“For a signal that does not have a finite bandwidth in the Fourier domain, but instead is bandlimited in the fractional Fourier domain with certain fractional orders, the fractional Fourier transform (FrFT) can be employed [18]–[23].”
MethodSelf-citationZhang, Y., & Zhang, Y. (2023) · IEEE Journal on Miniaturization for Air and Space Systems · doi:10.1109/jmass.2023.3304139 · Cited by 15
“4) The principle of fractional Fourier transform (FrFT) [13], [14], [15] is to perform different orders of FrFT on the LFM signal, which will show different energy aggregation in the transform domain, the parameter estimation of the LFM signal can be achieved by peak search.”
BackgroundNear-Field High-Speed User Sensing in Wideband mmWave Communications: Algorithms and Bounds
Miao, H., & Peng, M. (2025) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2025.3535691 · Cited by 15
“The chirp signal is transformed to be a peak signal in the fractional Fourier transform (FrFT) domain with proper parameters [35].”
Self-citationA Novel MuLoRa Modulation Based on Fractional Fourier Transform
Zhang, C., Wang, S., Jiao, L., Shi, J., & Jia, Y. (2021) · IEEE Communications Letters · doi:10.1109/lcomm.2021.3095397 · Cited by 12
Matrix operations in Random Permutation Set
Yang, W., & Deng, Y. (2023) · Information Sciences · doi:10.1016/j.ins.2023.119419 · Cited by 12
Local discrete fractional fourier transform: An algorithm for calculating partial points of DFrFT
Miao, H. (2023) · Signal Processing · doi:10.1016/j.sigpro.2023.109080 · Cited by 9
Self-citationMiao, H. (2024) · Signal Processing · doi:10.1016/j.sigpro.2024.109385 · Cited by 9
Self-citationRange–Doppler Resolution Enhancement of Ground-Based Radar by Data Extrapolation Technique
Zhang, L., Du, Q., Liu, W., Chen, H., & Wang, Y. (2025) · IEEE Transactions on Radar Systems · doi:10.1109/trs.2025.3533496 · Cited by 8
“…work is to analyze the performance of the proposal in nonzero frequency clutter case [43] or apply the technique of data extrapolation and the proposed improvement to other radar systems, such as SAR and ISAR, or other domains, such as time–frequency domain [44] and fractional Fourier domain [45].”
Fractional Fourier Transformation Based XL-MIMO Near-Field Channel Analysis
Jian, M., Tang, A., Chen, Y., & Zhao, Y. (2024) · IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) · doi:10.1109/spawc60668.2024.10694136 · Cited by 7
“Fractional Fourier analysis represents a generalization of conventional Fourier analysis [8].”
MethodVariance‐SNR Based Noise Suppression on Linear Canonical Choi‐Williams Distribution of LFM Signals
ZHANG, Z. (2022) · Chinese Journal of Electronics · doi:10.1049/cje.2020.00.367 · Cited by 6
Cohen's class time-frequency representation in linear canonical domains: definition and properties
Zhang, Z., Luo, M., Deng, K., & Yu, T. (2019) · Asia-Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA ASC) · doi:10.1109/apsipaasc47483.2019.9023300 · Cited by 5
“INTRODUCTION Linear canonical transform (LCT) [1], also known as ABCD transform, general Fresnel transform, Collins formula, general Huygens integral, and Moshinsky and Quesne integrals [2], has three free parameters so that it offers more degrees of freedom than its special cases including the Fourier transform (FT)…”
BackgroundWhen Ramanujan sums meet affine Fourier transform
Miao, H., Zhang, F., Tao, R., & Peng, M. (2022) · Signal Processing · doi:10.1016/j.sigpro.2022.108907 · Cited by 4
Self-citationPolar Linear Canonical Wavelet Transform: Theory and Its Application
Zhao, H., Li, B., & Zhu, H. (2025) · Circuits Systems and Signal Processing · doi:10.1007/s00034-025-03085-x · Cited by 4
“To effectively analyze and characterize signals, researchers have proposed a series of mathematical transforms, such as fractional Fourier transform (FRFT) [13–15, 37 ] , short-time Based on the problem mentioned above, a number of mathematical tools have been proposed, such as the polar wavelet…”
An interpretable convolutional neural network via generalized time–frequency scattering
Liu, X., Gong, C., Shi, J., & Tao, R. (2025) · Signal Processing · doi:10.1016/j.sigpro.2025.110043 · Cited by 3
Self-citationFractional bandwidth extrapolation and its application in fractional domain resolution enhancement
Zhang, L., Zhou, B., Liu, W., & Wang, Y. (2025) · Signal Processing · doi:10.1016/j.sigpro.2025.110202 · Cited by 3
Statistical Analysis of the 2th-Order Chirp Cyclostationary Processes
Miao, H., & Zhang, F. (2023) · IEEE Transactions on Instrumentation and Measurement · doi:10.1109/tim.2023.3342246 · Cited by 3
“Equation (14) can be alternatively explained as follows: a function x ( t ) can be decomposed as the summation of a series of QPP waves The affine Fourier series of a chirp periodic function also exists and is calculated with respect to a chirp period [35].”
BackgroundSelf-citationZhang, J., Sha, Z., Wan, L., Su, Y., Zhu, J., & Qu, F. (2025) · Journal of Marine Science and Engineering · doi:10.3390/jmse13081468 · Cited by 2
A new integral transform: biorthogonal Mellin transform
Zhang, L., Chen, H., Du, Q., & Wang, Y. (2023) · Scientia Sinica Informationis · doi:10.1360/ssi-2022-0463 · Cited by 2
Zhang, L., Zhou, B., Song, R., & Wang, Y. (2024) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2024.3398611 · Cited by 2
“Because of this, various transforms [16], [17], [18], [19] have been designed for the LFM signal, such as the fractional Fourier transform (FRFT), linear canonical transform, chirp Fourier transform (FT), and biorthogonal FT.”
MethodKoç, A., & Özaktaş, H. M. (2022) · Applied Optics · doi:10.1364/ao.472113 · Cited by 2
HSI-FrFRWKV: Fractional Fourier RWKV for Cross-Scene Coastal Wetland Mapping on Hyperspectral Images
Hu, W., Ren, G.-L., Li, H.-C., Zhao, X., Sun, W., & Tao, R. (2026) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2026.3724234 · Cited by 1
“As such, the FT was extended to the fractional FT (FrFT), with the ability to describe frequency characteristics of signals in local space, making it suitable for nonstationary HSIs [33].”
Self-citation2019 Index IEEE Transactions on Signal Processing Vol. 67
(2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.2968163 · Cited by 1
Parameter Etimation of LFM based on AtLSSA-FRFT
Zhang, R., Xiong, M., & Wang, L. (2023) · IEEE International Conference on Cloud Computing and Intelligence Systems (CCIS) · doi:10.1109/ccis59572.2023.10263259
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
- Licence
- 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
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.