Wenyuanwang Wang

Dr. Wenyuanwang Wang


Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 March 2024 in IEEE Signal Processing Magazine
Verified
Journal Article
Closed access
WWWenyuanwang Wang
Wenyuanwang Wang
KDKutluyil Dogancay
Kutluyil Dogancay
In this article, we present a powerful unifying framework for widely linear (WL) adaptive filters building on the concept of geometric algebra (GA), including recently proposed complex-valued (CV), quaternion-valued, and GA WL adaptive filters (WLAFs). We also consider and review WL adaptive filtering methods that feature robustness against impulsive noise, noisy input measurements, partial coefficient updates, subband structures, censoring, and composite structures under the unified framework. Furthermore, we propose innovative WL adaptive filtering algorithms for functional link polynomial (FLP) nonlinear filters, infinite-impulse response (IIR) systems, and kernel-based nonlinear system identification, showcasing the advantages of the unified framework. The article also investigates the relationship among WLAFs, graph filters, and Cayley–Dickson (CD)-valued adaptive filters, offering new insights into how the unified framework can be extended to graph signals and CD numbers. Finally, the article motivates future work on WL adaptive filtering based on GA and its special cases.


29 March 2021 in IEEE Transactions on Circuits and Systems II: Express Briefs
Verified
Journal Article
Closed access
WWWenyuanwang Wang
Wenyuanwang Wang
KDKutluyil Dogancay
Kutluyil Dogancay
Recently, a new class of multivector-valued adaptive filters, called geometric-algebra adaptive filters (GA-AFs), have been proposed and applied to 3D registration of point clouds, rotation estimation in computer vision, and so on. To offer a complete theoretical foundation for GA-AFs, we present a transient behavior evaluation of the geometric algebra least mean square (GA-LMS) algorithm. Specifically, the transient mean square deviation (MSD) is obtained by using the results of the mean square theoretical behavior of the GA-LMS. Furthermore, the transient excess mean square error (EMSE) is also given by using the results of MSD. The analytical results rely on the independence theory which has been commonly used in the convergence analysis of real-valued adaptive filter. Considering the non-commutative geometric algebra, the conventional method of analysis is not suitable for the GA-LMS algorithm. Therefore, we propose a novel method to analyze the GA-LMS algorithm under white noise assumption by separating the weight-error array. The obtained theoretical results can be used to accurately predict the transient performance of the GA-LMS. Moreover, the stability condition and steady-state performance are also analyzed. Our proposed steady-state model is more accurate than the previous model. Finally, numerical experiments are presented to confirm the accuracy of the theoretical analysis results.

21 February 2022 in Symmetry
Verified
Journal Article
Open access
PDF file
WWWenyuanwang Wang
Wenyuanwang Wang
QSQiang Sun
Qiang Sun
This paper considers the problem of adaptive estimation of graph signals under the impulsive noise environment. The existing least mean squares (LMS) approach suffers from severe performance degradation under an impulsive environment that widely occurs in various practical applications. We present a novel adaptive estimation over graphs based on Welsch loss (WL-G) to handle the problems related to impulsive interference. The proposed WL-G algorithm can efficiently reconstruct graph signals from the observations with impulsive noises by formulating the reconstruction problem as an optimization based on Welsch loss. An analysis on the performance of the WL-G is presented to develop effective sampling strategies for graph signals. A novel graph sampling approach is also proposed and used in conjunction with the WL-G to tackle the time-varying case. The performance advantages of the proposed WL-G over the existing LMS regarding graph signal reconstruction under impulsive noise environment are demonstrated.

20 October 2023 in IEEE Transactions on Circuits and Systems II: Express Briefs
Verified
Journal Article
Closed access
YXYilin Xiao
Yilin Xiao
WYWenxu Yan
Wenxu Yan
HNHongyu Ni
Hongyu Ni
BCBin Chen
Bin Chen
WWWenyuanwang Wang
Wenyuanwang Wang
To enhance the robustness and reduce the steady-state error under impulsive noise environment, this paper proposes an augmented complex generalized modified Blake-Zisserman (ACGMBZ) algorithm to estimate the fundamental frequency of three-phase power system adaptively. First, based on Clarke’s αβ transformation, the widely linear (WL) model is introduced to form a complex three-phase voltage for capturing more information than strictly linear (SL) model in unbalanced conditions. Then, by employing the generalized modified Blake-Zisserman (GMBZ) cost function, the ACGMBZ algorithm is derived using CR calculus which provides a mathematical framework for computing the Jacobians, Hessians, and gradients of cost functions of complex variables Mandic2009.. In addition, the steady-state analysis of the proposed algorithm is presented, as well as convergence analysis in both mean and mean-squared senses. Finally, some typical operations of the three-phase power system are considered as numerical simulation examples to demonstrate the improved performance of the proposed ACGMBZ algorithm by both synthetic and real grid data.

20 April 2021 in IEEE Signal Processing Letters
Verified
Journal Article
Closed access
WWWenyuanwang Wang
Wenyuanwang Wang
KDKutluyil Dogancay
Kutluyil Dogancay
The computational complexity of adaptive filtering algorithms increases with the number of filter coefficients. In applications where a long adaptive filter is required, the complexity can become prohibitively large due to scarce digital signal processing (DSP) resources such as the available DSP slices on a field programmable gate array (FPGA). Several partial-update least mean square (PU-LMS) algorithms have been proposed to address this problem. Among these algorithms, the sequential PU-LMS alleviates the computational complexity by updating a small subset of adaptive filter coefficients in a round-robin fashion at each iteration. Being data independent, it has no complexity overheads associated with coefficient selection. However, a major problem with the sequential PU-LMS is its vulnerability to poor convergence for cyclostationary input signals encountered in many practical applications. This letter presents a detailed analysis of the convergence issues with the sequential PU-LMS algorithm for cyclostationary white Gaussian input signals. The convergence analysis predicts when poor convergence is likely to occur based on a relationship between partial update and cyclostationary input signal parameters. The insights gained through this analysis can be used to adjust the sequential partial update parameters in order to avoid convergence difficulties. Simulation examples are presented to confirm the validity of the convergence analysis conducted.