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].”
BackgroundMethodInfluentialSparse Discrete Fractional Fourier Transform and Its Applications
Liu, S., Shan, T., Tao, R., Zhang, Y. D., Zhang, G., Zhang, F., & Wang, Y. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2366719 · Cited by 143 · cited 1×
“Sampling type algorithms [19]–[21], which are obtained by sampling the FrFT kernel function skillfully, have lower computational cost with the help of fast Fourier transform (FFT) algorithm.”
MethodSelf-citationOzaktas, H. M., & Aytür, O. (1995) · Signal Processing · doi:10.1016/0165-1684(95)00076-p · Cited by 141 · cited 1×
“the symmetry and the periodicity properties of the FrFT illustrated in [35].”
BackgroundZhang, Y., Chen, S.-F., Wang, S., Yang, J.-F., & Phillips, P. (2015) · International Journal of Imaging Systems and Technology · doi:10.1002/ima.22144 · Cited by 134 · cited 1×
“2912878 and some application aspects, saying parameters measurement of synthetic aperture radar (SAR) echo, anti-multipath and antieavesdropping communication, optical signal processing, object recognition by machine learning [9]–[16], are based on the FrFT.”
BackgroundModel-based estimation of ultrasonic echoes. Part II: Nondestructive evaluation applications
Demirli, R., & Saniie, J. (2001) · IEEE Transactions on Ultrasonics Ferroelectrics and Frequency Control · doi:10.1109/58.920714 · Cited by 125 · cited 1×
“To present the efficiency of the fractional convolution in separating a LFM signal from other kinds of signals, a signal model constituted by the summation of a Gaussian signal and a LFM signal by the ADFrFT algorithms, which can match the ultrasonic echo model [40]–[42] or be used to analyze the performance of the DF…”
MethodDetection and Imaging of Ground Moving Targets With Real SAR Data
Yang, J., Liu, C., & Wang, Y. (2014) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2014.2330456 · Cited by 121 · cited 1×
“The side looking airborne SAR echo with transmitting LFM signal to a moving target with constant relative radial acceleration are modeled as 2D LFM signals, and the echo are summation of LFM signals for multiple targets [44]–[46].”
A successive parameter estimation algorithm for chirplet signal decomposition
Lu, Y., Demirli, R., Cardoso, G., & Saniie, J. (2006) · IEEE Transactions on Ultrasonics Ferroelectrics and Frequency Control · doi:10.1109/tuffc.2006.152 · Cited by 121 · cited 1×
“To present the efficiency of the fractional convolution in separating a LFM signal from other kinds of signals, a signal model constituted by the summation of a Gaussian signal and a LFM signal by the ADFrFT algorithms, which can match the ultrasonic echo model [40]–[42] or be used to analyze the performance of the DF…”
MethodWei, D., & Li, Y. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2560148 · Cited by 114 · cited 1×
“PRELIMINARIES Definition 1: The FrFT Fα(u) of a function f(t) with a real parameter α is defined as [4]”
BackgroundDiscrete Fractional Fourier Transform Based on New Nearly Tridiagonal Commuting Matrices
Pei, S., Hsue, W.-L., & Ding, J. (2006) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2006.879313 · Cited by 103
Vessel Refocusing and Velocity Estimation on SAR Imagery Using the Fractional Fourier Transform
Pelich, R., Longépé, N., Mercier, G., Hajduch, G., & Garello, R. (2015) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2015.2487378 · Cited by 95 · cited 1×
“2912878 and some application aspects, saying parameters measurement of synthetic aperture radar (SAR) echo, anti-multipath and antieavesdropping communication, optical signal processing, object recognition by machine learning [9]–[16], are based on the FrFT.”
BackgroundMultiplicity of fractional Fourier transforms and their relationships
Cariolaro, G., Erseghe, T., Kraniauskas, P., & Laurenti, N. (2000) · IEEE Transactions on Signal Processing · doi:10.1109/78.815493 · Cited by 89 · 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.”
BackgroundNumerical implementation of matching pursuit for the analysis of complex ultrasonic signals
Lu, Y., & Michaels, J. E. (2008) · IEEE Transactions on Ultrasonics Ferroelectrics and Frequency Control · doi:10.1109/tuffc.2008.626 · Cited by 79
Fourier analysis and signal processing by use of the Mobius inversion formula
Reed, I. S., Tufts, D. W., Yu, X., Truong, T. K., Shih, M. T., & Yin, X. G. (1990) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/29.106864 · Cited by 77 · cited 8×
“Therefore the error in (94) is σ(2) gn(t0)−ĝn(t0)/ √ T , of which the bound is σ(2) εα [ lnN ( 1 3 lnN + 2 3 + a ) + aγ ] / √ T (equation (32) in [36]).”
BackgroundMethodInfluentialThe discrete harmonic oscillator, Harper's equation, and the discrete fractional Fourier transform
Barker, L., Candan, Ç., Hakioglu, T., Kutay, M. A., & Ozaktas, H. M. (2000) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/33/11/304 · Cited by 76
Barshan, B., & Ayrulu, B. (2002) · Neural Networks · doi:10.1016/s0893-6080(01)00120-4 · Cited by 62
Yang, J., & Zhang, Y. (2015) · IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing · doi:10.1109/jstars.2015.2426504 · Cited by 59
The discrete fractional Fourier transform
Candan, C., Kutay, M. A., & Ozaktas, H. M. (1999) · 1999 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings. ICASSP99 (Cat. No.99CH36258) · doi:10.1109/icassp.1999.756324 · Cited by 52 · cited 2×
“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.”
MethodResearch progress on discretization of fractional Fourier transform
Tao, R., Zhang, F., & Wang, Y. (2008) · Science in China Series F Information Sciences · doi:10.1007/s11432-008-0069-2 · Cited by 50 · cited 1×
“Just as the Fourier analysis, there are four transformation schemes [2], i.”
MethodSelf-citationDiscrete Fractional Fourier Transforms Based on Closed-Form Hermite–Gaussian-Like DFT Eigenvectors
Neto, J. R. D. O., & Lima, J. B. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2750105 · Cited by 47 · cited 2×
“To present the efficiency of the fractional convolution in separating a LFM signal from other kinds of signals, a signal model constituted by the summation of a Gaussian signal and a LFM signal by the ADFrFT algorithms, which can match the ultrasonic echo model [40]–[42] or be used to analyze the performance of the DF…”
MethodThe discrete fractional Fourier transform based on the DFT matrix
Serbes, A., & Durak-Ata, L. (2010) · Signal Processing · doi:10.1016/j.sigpro.2010.05.007 · Cited by 38
A Comprehensive Survey on Fractional Fourier Transform
Zhang, Y., Wang, S., Yang, J.-F., Zhang, Z., Phillips, P., Sun, P., & Yan, J. (2017) · Fundamenta Informaticae · doi:10.3233/fi-2017-1477 · Cited by 33 · cited 1×
“Some theoretical aspects, such as sampling, filtering, multi-domain analysis in fractional domains [3]–[8],”
BackgroundA fast algorithm for multi-component LFM signal analysis exploiting segmented DPT and SDFrFT
Liu, S., Shan, T., Zhang, Y. D., Tao, R., & Feng, Y. (2015) · IEEE Radar Conference (RadarConf) · doi:10.1109/radar.2015.7131165 · Cited by 33 · cited 1×
“Some theoretical aspects, such as sampling, filtering, multi-domain analysis in fractional domains [3]–[8],”
BackgroundSelf-citationA VLSI architecture for simplified arithmetic Fourier transform algorithm
Reed, I. S., Shih, M. T., Truong, T. K., Hendon, E., & Tufts, D. W. (1992) · IEEE Transactions on Signal Processing · doi:10.1109/78.134475 · Cited by 32
The discrete fractional Fourier transformation
Arıkan, O., Kutay, M. A., Özaktaş, H. M., & Akdemir, O. K. (2002) · IEEE-SP International Symposium on Time-Frequency and Time-Scale Analysis · doi:10.1109/tfsa.1996.547217 · Cited by 28 · 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.”
BackgroundRandomized nonuniform sampling and reconstruction in fractional Fourier domain
Xu, L., Zhang, F., & Tao, R. (2015) · Signal Processing · doi:10.1016/j.sigpro.2015.09.016 · Cited by 28
Self-citationImproved FRFT-based method for estimating the physical parameters from Newton’s rings
Wu, J.-M., Lu, M.-F., Tao, R., Zhang, F., & Li, Y. (2016) · Optics and Lasers in Engineering · doi:10.1016/j.optlaseng.2016.11.021 · Cited by 27
Self-citationAutomatic human fall detection in fractional fourier domain for assisted living
Liu, S., Zeng, Z., Zhang, Y. D., Fan, T., Shan, T., & Tao, R. (2016) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2016.7471785 · Cited by 23
Self-citationFractional Spectral Analysis of Randomly Sampled Signals and Applications
Xu, L., Zhang, F., & Tao, R. (2017) · IEEE Transactions on Instrumentation and Measurement · doi:10.1109/tim.2017.2728438 · Cited by 20 · cited 1×
“The wide band target echo signal is adopted to analyze the parameters of the target in highresolution radar [7], of which the echo model with transmitting wide band LFM signal is”
MethodSelf-citationA novel method for discrete fractional Fourier transform computation
Pei, S., & Yeh, M.-H. (2002) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas.2001.921138 · Cited by 18
Clutter suppression and GMTI for hypersonic vehicle borne SAR system with MIMO antenna
Wang, Y., Cao, Y., Peng, Z., & Su, H. (2017) · IET Signal Processing · doi:10.1049/iet-spr.2017.0193 · Cited by 16 · cited 1×
“The side looking airborne SAR echo with transmitting LFM signal to a moving target with constant relative radial acceleration are modeled as 2D LFM signals, and the echo are summation of LFM signals for multiple targets [44]–[46].”
Security-Coded OFDM System Based on Multiorder Fractional Fourier Transform
Wang, T., Huan, H., Tao, R., & Wang, Y. (2016) · IEEE Communications Letters · doi:10.1109/lcomm.2016.2611498 · Cited by 15
Self-citationA generalized sampling model in shift-invariant spaces associated with fractional Fourier transform
Zhao, H., Qiao, L., Fu, N., & Huang, G. (2017) · Signal Processing · doi:10.1016/j.sigpro.2017.11.009 · Cited by 11
A generalized Mobius transform and arithmetic Fourier transforms
Knockaert, L. F. (1994) · IEEE Transactions on Signal Processing · doi:10.1109/78.330357 · Cited by 8 · cited 1×
“Lemma 1: Möbius inversion formula for infinite series (Theorem 1 in [37]): Let {f(n)|n = 1, 2, .”
BackgroundOn the Angular Decomposition Technique for Computing the Discrete Fractional Fourier Transform
Hanna, M. T. (2007) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas.2007.378674 · Cited by 3
Fractional Fourier transformation and its application on optical communication
Ming, T., Yang, A., & Xin, X. (2016) · Keji daobao · Cited by 3
Discrete fractional Fourier transform based on the eigenvectors of Grünbaum tridiagonal matrix
Hanna, M. T., Seif, N. P. A., & Ahmed, W. (2008) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas.2008.4541629 · Cited by 2
Implementation of fast algorithm of discrete fractional Fourier transform on DSP
Ma, X. (2007) · Journal of Applied Optics · Cited by 1
Fractional Fourier transformation and its application on optical communication
Ming, T., Yang, A., & Xin, X. (2016) · Keji daobao · Cited by 1
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-citation
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.