Fractional Fourier Transform Frequency Estimation Based on Improved Particle Swarm Optimization
Open accessThe DOI matches its Crossref record; 10 of the 11 references it cites were found in a registry or an index; 1 of the 13 sources its claims cite were checked for support.
Abstract
The fractional Fourier transform (FRFT) frequency estimation is a frequently utilized frequency estimation approach for linear frequency modulation (LFM) signals. The search for the optimal order is a crucial element influencing the frequency estimation effect, and fixed-step search is typically adopted. Nevertheless, this algorithm is inefficient and time-consuming, thereby affecting the application of the fractional Fourier transform. To address this deficiency, the particle swarm optimization (PSO) algorithm was incorporated during the search for the optimal order. Based on this, this paper extends the conventional PSO to a PSO algorithm with adaptive inertia weights. This paper discusses and analysis the impact of different PSO algorithms on the FRFT frequency estimation effect. The simulation results present that the performance of the FRFT frequency estimation based on the two PSO algorithms is better than that based on the fixed-step FRFT. Among them, the FRFT frequency estimation based on the PSO algorithm with adaptive inertia weights is more efficient and precise than that based on the fixed-step algorithm.
Overview
CoChat Summary
TL;DR
The paper applies particle swarm optimization (PSO) and an adaptive-inertia-weight PSO (PSO-AIW) to search for the optimal fractional Fourier transform (FRFT) order in LFM signal frequency estimation. Simulations show both PSO-based methods outperform fixed-step FRFT, and PSO-AIW reaches comparable accuracy with fewer iterations than standard PSO.
Key findings
- In simulations with initial frequency \(f_0=4200\) Hz, bandwidth \(B=2000\) Hz, SNR from \(-30\) dB to \(10\) dB in \(2.5\) dB steps, and 500 Monte Carlo runs per SNR, the NMSE of PSO-FRFT frequency estimation was notably lower than that of fixed-step FRFT; at low SNR, PSO-AIW-FRFT differed only slightly from PSO-FRFT, while for SNR \(>0\), PSO-FRFT had lower NMSE.
- With 25 particles and 10 iterations, the NMSE of both PSO-FRFT and PSO-AIW-FRFT rose compared with 50 particles, but PSO-AIW-FRFT remained lower than PSO-FRFT.
- When PSO-FRFT used 25 particles and 20 iterations while PSO-AIW-FRFT used 25 particles and 10 iterations, their NMSEs were approximately the same, indicating PSO-AIW requires fewer iterations to reach the same estimation effect and improves calculation efficiency.
- The paper concludes that both PSO-based FRFT methods outperform fixed-step FRFT, and that PSO-AIW gives better efficiency and precision than standard PSO for FRFT frequency estimation.
Methods
- The optimal FRFT order search is performed with PSO and PSO-AIW instead of fixed-step search; PSO-AIW sets inertia weight to zero for particles whose fitness decreased and keeps it unchanged for particles whose fitness improved.
- Simulated LFM signals are used. One FRFT-modulus example assumes \(f_0=12\) Hz, pulse width \(T=0.1\) s, and \(B=2000\) Hz; the frequency-estimation simulation assumes \(f_0=4200\) Hz and \(B=2000\) Hz, with coarse FRFT search over order \([0,2]\) at fixed step \(\Delta p=0.01\), then PSO/PSO-AIW search in \([p_0-0.005, p_0+0.005]\).
- Performance is assessed by normalized mean square error (NMSE) of the estimated initial frequency, comparing FRFT, PSO-FRFT, and PSO-AIW-FRFT across SNR levels from \(-30\) dB to \(10\) dB in \(2.5\) dB increments with 500 Monte Carlo simulations per SNR.
Limitations
- The paper states no explicit limitations.
- Evident from the text: evaluation is simulation-only; no real radar, sonar, or communication data or field validation is reported.
- Evident from the text: some simulation details are incomplete or inconsistent—the pulse width is blank in the simulation section, and the introduction says PSO-AIW uses half the particles of PSO while the simulation describes both algorithms with 50 particles and later both with 25.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
0 Valid · 2 Not valid · 8 Not checked · 16 Own results and interpretations
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The simulation results are presented in Figure 5, the NMSE of PSO-FRFT and PSO-AIW-FRFT are approximately the same.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The simulation results present that the performance of the FRFT frequency estimation based on the two PSO algorithms is better than that based on the fixed-step FRFT.”
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“yet the NMSE of PSO-AIW-FRFT remains lower than that of PSO-FRFT.”
plainstates an association- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The PSO algorithm is applied to the search for the optimal order of the FRFT, enhancing the accuracy of FRFT frequency estimation.”
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Rests on an assumption not shown here.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“It can be known from the figure that the FRFT modulus of the LFM signal in a certain fractional order has energy aggregation.”
plainstates an association- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
5 more claims
Create a free account to see all 26 claims and every source verdict.
- Probably not a substantial claim. 8
- It may state two separate claims as one. 9
- The quote only partly states this claim. 2
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ FRFT Frequency Estimation based on PSO-AIW
“3 If algorithm converged successfully, execute step 8; otherwise, execute step 3.”
§ FRFT Frequency Estimation based on PSO-AIW
“7 Update the positions and velocities of the particle swarm, calculate the fitness values of each particle, store t best p and t best g , and execute 3.”
Citations
Cites
Ant colony system: a cooperative learning approach to the traveling salesman problem
Dorigo, M., & Gambardella, L. M. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585892 · Cited by 8,081 · cited 2×
“…introduced to enhance the accuracy of frequency estimation in FRFT. Heuristic global search techniques encompass intelligent optimization methods [2-4], such as Genetic Algorithm (GA) featuring crossover and mutation operator [3], Continuous ant Colony algorithm (CACA), which are appropriate for…”
Evolutionary computation: Comments on the history and current state
Back, T., Hammel, U., & Schwefel, H.-P. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585888 · Cited by 1,536 · cited 1×
“…introduced to enhance the accuracy of frequency estimation in FRFT. Heuristic global search techniques encompass intelligent optimization methods [2-4], such as Genetic Algorithm (GA) featuring crossover and mutation operator [3], Continuous ant Colony algorithm (CACA), which are appropriate for…”
Digital 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
QI, L. (2004) · Science in China Series F · doi:10.1360/02yf0456 · Cited by 257
Genetic algorithms for generation of class boundaries
Pal, S. K., Bandyopadhyay, S., & Murthy, C. A. (1998) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/3477.735391 · Cited by 75
Fractional Fourier transform for sonar signal processing
Barbu, M., Kaminsky, E. J., & Trahan, R. E. (2005) · Proceedings of OCEANS 2005 MTS/IEEE · doi:10.1109/oceans.2005.1639989 · Cited by 27 · cited 1×
“The detection and parameter estimation of LFM signals are typically accomplished by leveraging the aggregation property of the signal in the fractional domain after undergoing fixed-step fractional Fourier transformation [1].”
Improved Particle Swarm Optimization with Adaptive Inertia Weight
Hu, Y.-J. (2012) · Jisuanji fangzhen · Cited by 9
Improved Particle Swarm Optimization with Adaptive Inertia Weight
Yong-ca, A. (2014) · Dianzi Ke-ji Daxue xuebao · Cited by 7
LFM Signal Parameter Estimation Based on Particle Swarm Optimization Algorithm
Chao-xuan, S. (2012) · Jisuanji gongcheng · Cited by 1
Multi-object Particle Swarm Optimization Algorithm Based on Group Distance
Mai, X. (2010) · Jisuanji gongcheng · Cited by 1
Metadata
- Authors
- Liu, T., Yang, B., Liu, Y., & Xiong, C.
- Affiliations
- Chinese Academy of Sciences (CN)
- Corresponding author
- Liu, Tianli
- Liu, Yeyao
- Venue
- Journal of Physics, Conference Series
- Publisher
- IOP Publishing
- Published
- 2025-05-01
- Volume
- 3004
- Issue
- 1
- Pages
- 012032
- ISSN
- 1742-6588 (ISSN-L)
- 1742-6596
- OpenAlex
- W4410153526
- Cited by
- 0
- References
- 11
- FWCI
- 0.00
- Type
- conference paper
- Language
- en
- Open access
- diamond
- doi.org
- Licence
- cc-by
- creativecommons.org/licenses/by/4.0/ (vor)
- iopscience.iop.org/info/page/text-and-data-mining (tdm)
- Locations
- Journal of Physics Conference Series (publishedVersion, cc-by)
- Topics
- Physical Sciences › Engineering › Aerospace Engineering › Radar Systems and Signal Processing
- Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced Electrical Measurement Techniques
- Physical Sciences › Mathematics › Applied Mathematics › Mathematical Analysis and Transform Methods
- Keywords
- fractional Fourier transform, frequency estimation, linear frequency modulation signals, particle swarm optimization, adaptive inertia weight
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.
The claim verdicts this report counts are experimental: their accuracy is not yet measured.
A language model drew the claims from the paper on 2026-09-28, under version 3 of the claim definition (prompt extract-v3).
A second model labelled each claim on 2026-09-28 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
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 Transform Frequency Estimation Based on Improved Particle Swarm Optimization. https://app.cochat.ai/papers/10.1088/1742-6596/3004/1/012032
- The paper
- Liu, T., Yang, B., Liu, Y., & Xiong, C. (2025). Fractional Fourier Transform Frequency Estimation Based on Improved Particle Swarm Optimization. Journal of Physics, Conference Series. https://doi.org/10.1088/1742-6596/3004/1/012032
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.