12 results on '"Yu, Yi"'
Search Results
2. Proportionate M-estimate adaptive filtering algorithms: Insights and improvements.
- Author
-
Huang, Zongxin, Yu, Yi, de Lamare, Rodrigo C., Fan, Yongcun, and Li, Ke
- Subjects
- *
ADAPTIVE filters , *KALMAN filtering , *ALGORITHMS , *FILTERS & filtration , *ERROR rates , *COMPUTER simulation , *WATER filters - Abstract
• To analyze the performance of three proportionate algorithms in impulsive noises. • To reveal the ranges and relations of the step-sizes in three proportionate algorithms. • To develop a decorrelation technique based variable step-size scheme to deal with the trade-off between convergence rate and steady-state error. In the literature, the proportionate least mean M-estimate (PLMM) algorithm exhibits good performance when dealing with sparse systems in the presence of impulsive noises. In this paper, the mean and mean-square behaviors of three recursion types of the PLMM algorithm are studied in depth. We derive analytically the stability, transient and steady-state results of these PLMM recursions, and find that they can achieve the same performance when properly choosing the step-size and the proportionate matrix. To improve the filter performance in both convergence rate and steady-state error, we derive a variable step-size (VSS) scheme and then present the VSS-based PLMM algorithms. In addition, based on the adaptive decorrelation strategy aiming at the colored input signals, the VSS adaptive decorrelation PLMM algorithms are developed to further speed up the convergence. Computer simulations have verified our theoretical analyses and the effectiveness of the proposed algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
3. Novel sign subband adaptive filter algorithms with individual weighting factors.
- Author
-
Yu, Yi and Zhao, Haiquan
- Subjects
- *
ADAPTIVE filters , *ALGORITHMS , *COMPARATIVE studies , *ROBUST control , *STOCHASTIC convergence - Abstract
This paper presents a new sign subband adaptive filter (SSAF) algorithm with an individual-weighting-factor (IWF) for each subband, instead of a common weighting factor in the original SSAF algorithm, called the IWF-SSAF. Each individual weighting factor only depends on the corresponding subband input signal power. Compared with the SSAF algorithm, the proposed approach fully utilizes the inherent decorrelating property of subband adaptive filter for colored inputs, leading to a better convergence performance. After that, to further enhance the performance of the IWF-SSAF in a sparse system, an improved proportionate IWF-SSAF (IWF-IPSSAF) algorithm is proposed. The proposed algorithms not only inherit the good robustness of sign algorithm against impulsive interferences, but also obtain a significant improvement in the performance as compared to their counterparts (i.e., SSAF and IPSSAF), in terms of the convergence rate and tracking capability. Besides, the IWF-IPSSAF algorithm has faster convergence rate than the IWF-SSAF algorithm for sparse impulse responses. Finally, the performances of two proposed algorithms are demonstrated in the system identification and the acoustic echo cancellation with double-talk. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
4. Steady-state mean-square-deviation analysis of the sign subband adaptive filter algorithm.
- Author
-
Yu, Yi, Zhao, Haiquan, and Chen, Badong
- Subjects
- *
MEAN square algorithms , *DEVIATION (Statistics) , *ADAPTIVE filters , *ROBUST control , *ENERGY conservation - Abstract
Recently, the sign subband adaptive filter (SSAF) algorithm has obtained great attention, due to its robustness against impulsive noises and decorrelating property for correlated input signals. However, the performance of the algorithm in the steady-state is not analyzed. In this paper, we study the steady-state mean-square-deviation (MSD) behavior of the SSAF algorithm by using energy conservation relation, Price׳s theorem and some reasonable assumptions. Simulation results in different system identification scenarios (including the input signals, tap lengths, impulsive noises, number of subbands, and step sizes) are provided to support our theoretical analysis. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
5. A robust band-dependent variable step size NSAF algorithm against impulsive noises.
- Author
-
Yu, Yi, Zhao, Haiquan, He, Zhengyou, and Chen, Badong
- Subjects
- *
ADAPTIVE filters , *ROBUST control , *ALGORITHMS , *BURST noise , *COMPUTER simulation - Abstract
Proposed is a new subband adaptive filter (SAF) algorithm by minimizing Huber’s cost function that is robust to impulsive noises. Generally, this algorithm works in the mode of the normalized SAF (NSAF) algorithm, while it behaves like the sign SAF (SSAF) algorithm only when the impulsive noises appear. To further improve the robustness of this algorithm against impulsive noises, the subband cutoff parameters are updated in a recursive way. Moreover, the proposed algorithm can be interpreted as a variable step size NSAF algorithm, thus it exhibits faster convergence rate and lower steady-state error than the NSAF. Simulation results, using different colored input signals in both impulsive and free-impulsive noise environments, show that the proposed algorithm works better than some existing algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
6. Sparsity-aware SSAF algorithm with individual weighting factors: Performance analysis and improvements in acoustic echo cancellation.
- Author
-
Yu, Yi, Yang, Tao, Chen, Hongyang, Lamare, Rodrigo C. de, and Li, Yingsong
- Subjects
- *
ECHO , *ALGORITHMS , *FACTOR analysis , *ADAPTIVE filters , *FILTER banks - Abstract
• By incorporating the sparsity-aware technique, we propose the S-IWF-SSAF algorithm, and analyze its performance in-depth in impulsive noise. • The proposed analysis covers the behaviors of the IWF-SSAF algorithm in impulsive noise, with better accuracy than the analysis in [15]. • We devise a joint optimization scheme to automatically choose the step-size and the sparsity penalty parameter for the S-IWF-SSAF algorithm. • To make the proposed algorithms suitable for AEC, we develop delayless implementation of the proposed algorithms. In this paper, we propose and analyze the sparsity-aware sign subband adaptive filtering with individual weighting factors (S-IWF-SSAF) algorithm, and consider its application in acoustic echo cancellation (AEC). Furthermore, we design a joint optimization scheme of the step-size and the sparsity penalty parameter to enhance the S-IWF-SSAF performance in terms of convergence rate and steady-state error. A theoretical analysis shows that the S-IWF-SSAF algorithm outperforms the previous sign subband adaptive filtering with individual weighting factors (IWF-SSAF) algorithm in sparse scenarios. In particular, compared with the existing analysis on the IWF-SSAF algorithm, the proposed analysis does not require the assumptions of large number of subbands, long adaptive filter, and paraunitary analysis filter bank, and matches well the simulated results. Simulations in both system identification and AEC situations have demonstrated our theoretical analysis and the effectiveness of the proposed algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
7. Robust spline adaptive filtering based on accelerated gradient learning: Design and performance analysis.
- Author
-
Yu, Tao, Li, Wenqi, Yu, Yi, and de Lamare, Rodrigo C.
- Subjects
- *
ADAPTIVE filters , *ALGORITHMS , *PIEZOELECTRIC actuators , *SPLINES , *SYSTEM identification , *NONLINEAR systems - Abstract
• This paper provides the robust SAF-LHC-MNAG algorithm for nonlinear system identification in impulsive noise scenarios. • The proposed algorithm can accelerate the convergence under the premise of low steady-state error. • The convergence condition and the mean square performance of the SAF-LHC-MNAG algorithm are given. • The proposed algorithm is implemented to identify the hysteresis model of the piezoelectric actuator. This paper proposes a novel spline adaptive filtering (SAF) algorithm for nonlinear system identification under impulsive noise environments. This algorithm combines the logarithmic hyperbolic cosine (LHC) cost function and the modified Nesterov accelerated gradient (MNAG) learning method, which is called the SAF-LHC-MNAG algorithm. The LHC cost function can reduce the sensitivity of SAF to large outliers and improve the robustness to impulsive noises. Additionally, the MNAG method can further accelerate the convergence under the premise of low steady-state error. Performance analysis of this algorithm is carried out and supported by simulations. Numerical results show that the SAF-LHC-MNAG algorithm has better convergence performance than some existing SAF algorithms. Besides, experimental results confirm the effectiveness of SAF-LHC-MNAG for the accurate identification of nonlinear hysteresis system. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
8. Variable step-size widely linear complex-valued NLMS algorithm and its performance analysis.
- Author
-
Shi, Long, Zhao, Haiquan, Zeng, Xiangping, and Yu, Yi
- Subjects
- *
ALGORITHMS , *RAYLEIGH model , *SYSTEM identification , *LEAST squares , *MATHEMATICAL complexes - Abstract
• The variable step-size widely linear complex-valued NLMS (VSS-WL-CNLMS) algorithm which is applicable to the case of highly correlated input is proposed, where the variable step-size (VSS) is derived by minimizing the mean-square deviation (MSD). • The proposed VSS-WL-CNLMS algorithm is convergent in the mean square sense. • Based on the approximate uncorrelating transform and Rayleigh distribution, the theoretical transient and stead-state behaviors of the VSS-WL-CNLMS algorithm are analyzed in detail. The shrinkage widely linear complex-valued least mean square (SWL-CLMS) algorithm with a variable step-size (VSS) overcomes the tradeoff between fast convergence and low steady-state misalignment, but meanwhile suffers from instability for highly correlated input signals because of the gradient noise amplification problem. To obtain a VSS that is also applicable to the case of highly correlated input signals, in this paper, we propose the VSS widely linear complex-valued normalized least mean square (VSS-WL-CNLMS) algorithm, where the VSS is derived by minimizing the mean-square deviation (MSD). Owing to the normalization, the VSS-WL-CNLMS algorithm is convergent in the mean square sense. By using the Rayleigh distribution, we calculate the mean step-size, which is then combined with the approximate uncorrelating transform to analyze the transient and steady-state mean square error (MSE) behaviors. Simulations for system identification scenario show that the proposed VSS-WL-CNLMS algorithm outperforms some well-known techniques and verify the accuracy of the theoretical analysis. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
9. Robust adaptive filtering algorithm based on maximum correntropy criteria for censored regression.
- Author
-
Wang, Wenyuan, Zhao, Haiquan, Doğançay, Kutluyıl, Yu, Yi, Lu, Lu, and Zheng, Zongsheng
- Subjects
- *
ADAPTIVE filters , *ADAPTIVE signal processing , *FILTERS & filtration , *RANDOM noise theory , *NOISE measurement , *ALGORITHMS - Abstract
Highlights • This paper provides the development of the robust censored adaptive algorithm for the impulsive noise. • This paper gives Consideration of non-Gaussian background noise as different from previous literature which only consider the Gaussian noise. • Theoretical insights into the mean and mean square performance of the CR-MCC algorithm are provided. • Simulation examples to demonstrate the performance of the proposed algorithm in impulsive noise scenarios are given. Abstract Censored observations and impulsive measurement noise are encountered in many practical applications of adaptive signal processing. Traditional adaptive filtering algorithms may fail to work in such cases. This paper proposes a robust adaptive filter algorithm predicated on maximum correntropy criteria (MCC) for censored regression. A detailed performance analysis in terms of mean and mean-square behaviour is provided. Simulations with Gaussian and non-Gaussian noise are presented to verify the theoretical results, and to demonstrate the superior performance of the proposed algorithm over existing algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
10. Frequency domain exponential functional link network filter: Design and implementation.
- Author
-
Yu, Tao, Tan, Shijie, de Lamare, Rodrigo C., and Yu, Yi
- Subjects
- *
ACTIVE noise control , *COMPUTATIONAL complexity , *SYSTEM identification , *FILTER paper , *NONLINEAR systems - Abstract
• This paper provides a FDEFLN-based nonlinear filtering scheme and its filtered-s version in a computationally efficient manner. • The stability, steady-state performance and computational complexity of the proposed frequency domain algorithms are derived and analyzed. • With applications to NSI, NAEC and NANC, the notable computational advantages of the proposed FDEFLN-based algorithms have been verified. The exponential functional link network (EFLN) filter has attracted tremendous interest due to its enhanced nonlinear modeling capability. However, the computational complexity will dramatically increase with the dimension growth of the EFLN-based filter. To improve the computational efficiency, we propose a novel frequency domain exponential functional link network (FDEFLN) filter in this paper. The idea is to organize the samples in blocks of expanded input data, transform them from time domain to frequency domain, and thus execute the filtering and adaptation procedures in frequency domain with the overlap-save method. A FDEFLN-based nonlinear active noise control (NANC) system has also been developed to form the frequency domain exponential filtered-s least mean-square (FDEFsLMS) algorithm. Moreover, the stability, steady-state performance and computational complexity of algorithms are analyzed. Finally, several numerical experiments corroborate the proposed FDEFLN-based algorithms in nonlinear system identification, acoustic echo cancellation and NANC implementations, which demonstrate much better computational efficiency. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
11. A survey on active noise control in the past decade—Part I: Linear systems.
- Author
-
Lu, Lu, Yin, Kai-Li, de Lamare, Rodrigo C., Zheng, Zongsheng, Yu, Yi, Yang, Xiaomin, and Chen, Badong
- Subjects
- *
ACTIVE noise control , *LINEAR systems , *ARTIFICIAL neural networks - Abstract
Active noise control (ANC) is an effective way for reducing the noise level in electroacoustic or electromechanical systems. Since its first introduction in 1936, this approach has been greatly developed. This paper focuses on discussing the development of ANC techniques over the past decade. Linear ANC algorithms, including the celebrated filtered-x least-mean-square (FxLMS)-based algorithms and distributed ANC algorithms, are investigated and evaluated. Nonlinear ANC (NLANC) techniques, such as functional link artificial neural network (FLANN)-based algorithms, are pursued in Part II. Furthermore, some novel methods and applications of ANC emerging in the past decade are summarized. Finally, future research challenges regarding the ANC technique are discussed. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
12. A survey on active noise control in the past decade–Part II: Nonlinear systems.
- Author
-
Lu, Lu, Yin, Kai-Li, de Lamare, Rodrigo C., Zheng, Zongsheng, Yu, Yi, Yang, Xiaomin, and Chen, Badong
- Subjects
- *
ACTIVE noise control , *NONLINEAR systems , *ADAPTIVE filters , *PERSPECTIVE (Art) , *DISTRIBUTED algorithms - Abstract
Part I of this paper reviewed the development of the linear active noise control (ANC) technique in the past decade. However, ANC systems might have to deal with some nonlinear components and the performance of linear ANC techniques may degrade in this scenario. To overcome this limitation, nonlinear ANC (NLANC) algorithms were developed. In Part II, we review the development of NLANC algorithms during the last decade. The contributions of heuristic ANC algorithms are outlined. Moreover, we emphasize recent advances of NLANC algorithms, such as spline ANC algorithms, kernel adaptive filters, and nonlinear distributed ANC algorithms. Then, we present recent applications of ANC technique including linear and nonlinear perspectives. Future research challenges regarding ANC techniques are also discussed. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.