12 June 2026 in IEEE Sensors Journal
Affine frequency division multiplexing (AFDM) is widely adopted in the dual-function radar communication (DFRC) research since its multipath separation capability can alleviate inter-carrier interference. However, current symbol detection algorithms designed for AFDM systems exhibit a relatively high bit error rate (BER) under low signal-to-noise ratio (SNR) conditions. To address this issue, a joint maximum ratio combining (MRC) and message passing (MP) symbol detection algorithm called JMP is proposed, which leverages the rule constraints of index modulation and the feedback characteristics of MP in combination with MRC. In the design of radar signal processing, an algorithm termed constant false alarm rate and orthogonal matching pursuit (CFAR-OMP) is developed, utilizing CFAR threshold decisions as prior guidance to avoid constructing the massive dictionary matrix required by the conventional OMP algorithm. Simulation results show that, compared to conventional algorithms, the proposed JMP algorithm achieves significantly improved communication BER performance at low SNR levels while maintaining low computational complexity. Simultaneously, the CFAR-OMP algorithm ensures reliable radar target parameter estimation performance within a localized parameter search framework.
2 April 2026 in IEEE Sensors Journal
To address the problem of aliasing caused by pulse data streams from multiple dense signal sources, traditional density-based clustering algorithms often exhibit degraded clustering performance, strong reliance on manually tuned parameters, and limited effectiveness of conventional association methods. This paper proposes a sorting algorithm based on adaptive root particle swarm optimization (PSO) and an association algorithm using Cauchy distribution matching. First, the K-mutual nearest neighbor algorithm is combined with DBSCAN to avoid misjudging core points through strict mutual neighbor determination and to prevent cross-cluster expansion using a proportional factor. Then, the optimal parameters of the K-mutual nearest neighbor DBSCAN are obtained through the adaptive root PSO algorithm, the adaptive root PSO algorithm incorporates an adaptive root growth mechanism. By dynamically adjusting inertia weights and individual and population factors, and by employing Levy flight and opposing learning strategies, it enhances search diversity and the ability to escape local optima. Compared to traditional PSO algorithms, it can more effectively address complex optimization problems. Finally, the Cauchy distribution matching algorithm is applied to associate the sorting results of two consecutive observation frames. Through simulation verification, under Dataset 1 conditions, when 20% interference pulses are added, the proposed algorithm achieves a 19.94% improvement in sorting accuracy compared to DBSCAN and attains an association accuracy of 83.875% in inter-frame association experiments.