scholarly journals A Normalized Adaptive Filtering Algorithm Based On Geometric Algebra

IEEE Access ◽  
2020 ◽  
pp. 1-1
Author(s):  
Rui Wang ◽  
Meixiang Liang ◽  
Yinmei He ◽  
Xiangyang Wang ◽  
Wenming Cao
Keyword(s):  
Adaptive Filtering ◽  
Geometric Algebra ◽  
Filtering Algorithm

scholarly journals A Novel Least-Mean Kurtosis Adaptive Filtering Algorithm Based on Geometric Algebra

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 78298-78310 ◽  
Author(s):  
Rui Wang ◽  
Yinmei He ◽  
Chenyang Huang ◽  
Xiangyang Wang ◽  
Wenming Cao
Keyword(s):  
Adaptive Filtering ◽  
Geometric Algebra ◽  
Filtering Algorithm

scholarly journals Unscented Particle Filter Algorithm Based on Divide-and-Conquer Sampling for Target Tracking

Sensors ◽  
2021 ◽  
Vol 21 (6) ◽  
pp. 2236
Author(s):  
Sichun Du ◽  
Qing Deng
Keyword(s):  
Particle Filter ◽  
State Space ◽  
Adaptive Filtering ◽  
Divide And Conquer ◽  
Particle Swarm Algorithm ◽  
Tracking Accuracy ◽  
Filtering Algorithm ◽  
Maneuvering Target ◽  
Unscented Particle Filter ◽  
Particle Filter Algorithm

Unscented particle filter (UPF) struggles to completely cover the target state space when handling the maneuvering target tracing problem, and the tracking performance can be affected by the low sample diversity and algorithm redundancy. In order to solve this problem, the method of divide-and-conquer sampling is applied to the UPF tracking algorithm. By decomposing the state space, the descending dimension processing of the target maneuver is realized. When dealing with the maneuvering target, particles are sampled separately in each subspace, which directly prevents particles from degeneracy. Experiments and a comparative analysis were carried out to comprehensively analyze the performance of the divide-and-conquer sampling unscented particle filter (DCS-UPF). The simulation result demonstrates that the proposed algorithm can improve the diversity of particles and obtain higher tracking accuracy in less time than the particle swarm algorithm and intelligent adaptive filtering algorithm. This algorithm can be used in complex maneuvering conditions.

scholarly journals Robust Adaptive Filtering Algorithm for Self-Interference Cancellation with Impulsive Noise

Electronics ◽  
2021 ◽  
Vol 10 (2) ◽  
pp. 196
Author(s):  
Jun Lu ◽  
Qunfei Zhang ◽  
Wentao Shi ◽  
Lingling Zhang ◽  
Juan Shi
Keyword(s):  
Adaptive Filtering ◽  
Interference Cancellation ◽  
Impulsive Noise ◽  
Weight Vector ◽  
Filtering Algorithm ◽  
Convergence Performance ◽  
Simulation Results ◽  
Robust Adaptive ◽  
Arctangent Cost Function ◽  
Simultaneous Transmission

Self-interference (SI) is usually generated by the simultaneous transmission and reception in the same system, and the variable SI channel and impulsive noise make it difficult to eliminate. Therefore, this paper proposes an adaptive digital SI cancellation algorithm, which is an improved normalized sub-band adaptive filtering (NSAF) algorithm based on the sparsity of the SI channel and the arctangent cost function. The weight vector is hardly updated when the impulsive noise occurs, and the iteration error resulting from impulsive noise is significantly reduced. Another major factor affecting the performance of SI cancellation is the variable SI channel. To solve this problem, the sparsity of the SI channel is estimated with the estimation of the weight vector at each iteration, and it is used to adjust the weight vector. Then, the convergence performance and calculation complexity are analyzed theoretically. Simulation results indicate that the proposed algorithm has better performance than the referenced algorithms.

Sign in / Sign up

Export Citation Format

Share Document