首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献，搜索用时 21 毫秒
1.
In this paper, a novel augmented complex-valued normalized subband adaptive filter (ACNSAF) algorithm is proposed for processing the noncircular complex-valued signals. Based on the augmented statistics, the proposed algorithm is derived by computing a constraint cost function. Due to contain all second-order statistical properties, the ACNSAF algorithm can process the circular and noncircular complex-valued signals simultaneously. Moreover, the stability and mean square steady-state analysis of the proposed algorithm is derived by using the energy conservation principle. Computer simulation experiments on complex-valued system identification, prediction and noise cancelling show that the proposed algorithm achieves the improved mean square deviation and prediction gain compared to the ACNLMS algorithm. And the simulation results are consistent with the analysis results.  相似文献   

2.
《Journal of The Franklin Institute》2022,359(17):10172-10205
Recently, the sparsity-aware sign subband adaptive filter algorithm with individual-weighting-factors (S-IWF-SSAF) was devised. To accomplish performance enhancement, the variable parameter S-IWF-SSAF (VP-S-IWF-SSAF) algorithm was developed through optimizing the step-size and penalty factor, respectively. Different from the optimization scheme, we devise a family of variable step-size strategy S-IWF-SSAF (VSS-S-IWF-SSAF) algorithms based on the transient model of algorithms via minimizing the mean-square deviation (MSD) on each iteration with some reasonable and frequently adopted assumptions and Price's theorem. And in order to enhance the tracking capability, an effective reset mechanism is also incorporated into the proposed algorithms. It is worth mentioning that the presented algorithms could acquire lower computational requirements and exhibit higher steady-state estimation accuracy obviously and acceptable tracking characteristic in comparison to the VP-S-IWF-SSAF algorithm. In addition, the stable step-size range in the mean and mean square sense and steady-state performance are concluded. And the computational requirements are exhibited as well. Monte-Carlo simulations for system identification and adaptive echo cancellation applications certify the proposed algorithms acquire superior performance in contrast to other related algorithms within various system inputs under impulsive interference environments.  相似文献   

3.
The conventional logarithm cost-based adaptive filters, e.g., the least mean logarithmic square (LMLS) algorithm, cannot combat impulsive noises at the filtering process. To address this issue, we present a novel robust least mean logarithmic square (RLMLS) algorithm by using a generalized logarithmic cost function. The proposed RLMLS algorithm can provide robustness against impulsive noises with the improvement of filtering accuracy. For theoretical analysis, the mean square analysis of RLMLS is provided in terms of the mean square deviation (MSD) and excess mean-square error (EMSE) with a white Gaussian reference. For further performance improvement in different noises, the variable step-size RLMLS (VSSRLMLS) based on the statistics of error is proposed to improve the convergence rate and steady-state mean square error, simultaneously. Analytical results and superiorities of RLMLS and VSSRLMLS in the context of system identification are supported by simulations from the aspects of filtering accuracy and robustness in Gaussian and impulse noises.  相似文献   

4.
In this paper, the concept of proportionate adaptation is extended to the normalized subband adaptive filter (NSAF), and seven proportionate normalized subband adaptive filter algorithms are established. The proposed algorithms are proportionate normalized subband adaptive filter (PNSAF), μ‐law PNSAF (MPNSAF), improved PNSAF (IPNSAF), the improved IPNSAF (IIPNSAF), the set-membership IPNSAF (SM-IPNSAF), the selective partial update IPNSAF (SPU-IPNSAF), and SM-SPU-IPNSAF which are suitable for sparse system identification in network echo cancellation. When the impulse response of the echo path is sparse, the PNSAF has initial faster convergence than NSAF but slows down dramatically after initial convergence. The MPNSAF algorithm has fast convergence speed during the whole adaptation. The IPNSAF algorithm is suitable for both sparse and dispersive impulse responses. The SM-IPNSAF exhibits good performance with significant reduction in the overall computational complexity compared with the ordinary IPNSAF. In SPU-IPNSAF, the filter coefficients are partially updated rather than the entire filter at every adaptation. In SM-SPU-IPNSAF algorithm, the concepts of SM and SPU are combined which leads to a reduction in computational complexity. The simulation results show good performance of the proposed algorithms.  相似文献   

5.
A full performance analysis of complex normalized subband adaptive filter (CNSAF) algorithm will provide guidelines for designing the adaptive filter. However, because of the noncircular characteristic of complex-value signal, the complementary mean-square performance analysis of the CNSAF algorithm has not been presented in the literature. In order to give the detailed theoretical expressions of the CNSAF algorithm, the present study first analyzes the mean-square deviation (MSD) with the energy-conservation method, and then the complementary mean-square derivation (CMSD) behavior is given using pseudo-energy-conservation method. Analytical expressions are obtained for the transient MSD and CMSD of the CNSAF algorithm. Also, the steady-state MSD and CMSD are predicted based on the closed-form expressions. Besides, the analysis results are not constrained by the distribution of input signals. Finally, simulation results obtained for diffferent inputs present a good consistence with the analytical results.  相似文献   

6.
This article proposes an affine-projection-like maximum correntropy (APLMC) algorithm for robust adaptive filtering. The proposed APLMC algorithm is derived by using the objective function based on the maximum correntropy criterion (MCC), which can availably suppress the bad effects of impulsive noise on filter weight updates. But the overall performance of the APLMC algorithm may be decreased when the input signal is polluted by noise. To compensate for the deviation of the APLMC algorithm in the input noise interference environment, the bias compensation (BC) method is introduced. Therefore, the bias-compensated APLMC (BC-APLMC) algorithm is presented. Besides, the convergence of the BC-APLMC algorithm in the mean and the mean square sense is studied, which provides a constraint range for the step-size. Computer simulation results show that the APLMC, and BC-APLMC algorithms are valid in acoustic echo cancellation and system identification applications. It also shows that the proposed algorithms are robust in the presence of input noise and impulse noise.  相似文献   

7.
本文提出一种新的基于α稳定分布噪声环境下的自适应滤波算法,这种算法针对变步长自适应滤波算法收敛速度和稳态误差相矛盾的不足,建立了步长μ(n)与误差信号e(n)之间的新的非线性函数关系。该函数能够削弱输入端不相关α稳定分布噪声对步长调整的影响,更好地解决稳态误差与收敛时间之间的矛盾。通过系统辨识仿真结果表明,新的算法α对稳定分布下的尖峰脉冲噪声有较强的韧性,比传统的NLMP算法有更快的参数辨识速度和更小的稳态误差,同时还具有很好地跟踪多时变系统的能力。  相似文献   

8.
This paper surveys the identification of observer canonical state space systems affected by colored noise. By means of the filtering technique, a filtering based recursive generalized extended least squares algorithm is proposed for enhancing the parameter identification accuracy. To ease the computational burden, the filtered regressive model is separated into two fictitious sub-models, and then a filtering based two-stage recursive generalized extended least squares algorithm is developed on the basis of the hierarchical identification. The stochastic martingale theory is applied to analyze the convergence of the proposed algorithms. An experimental example is provided to validate the proposed algorithms.  相似文献   

9.
In this paper, we propose an adapt-then-combine (ATC) diffusion normalized Huber adaptive filtering (ATC-DNHuber) algorithm for distributed estimation in impulsive interference environments. Firstly, a normalized Huber adaptive filter (NHuber) is developed to reduce the effect of the eigenvalue spread of the input signal. Then we extend the NHuber to develop an ATC diffusion algorithm by applying the NHuber algorithm at all agents. In addition, the mean stability performance and computational complexity are analyzed theoretically. In addition, Furthermore, simulation results demonstrate that the ATC-DNHuber algorithm can perform better in identifying the unknown coefficients under the complex and changeable impulsive interference environments.  相似文献   

10.
The performance of the current state estimation will degrade in the existence of slow-varying noise statistics. To solve the aforementioned issues, an improved strong tracking maximum correntropy criterion variational-Bayesian adaptive Kalman filter is presented in this paper. First of all, the inverse-Wishart distribution, as the conjugate-prior, is adopted to model the unknown and time-varying measurement and process noise covariances, then the noise covariances and system state are estimated via the variational Bayesian method. Secondly, the multiple fading-factors are obtained and evaluated to modify the prediction error covariance matrix to address the problems associated with inaccurate error estimation. Finally, the maximum correntropy criterion is employed to correct the filtering gain, which improves the filtering performance of the proposed algorithm. Simulation results show that the proposed filter exhibits better accuracy and convergence performance compared to other existing algorithms.  相似文献   

11.
The conjugate gradient (CG) method exhibits fast convergence speed than the steepest descent, which has received considerable attention. In this work, we propose two CG-based methods for nonlinear active noise control (NLANC). The proposed filtered-s Bessel CG (FsBCG)-I algorithm implements the functional link artificial neural network (FLANN) as a controller, and it is derived from the Matérn kernel to achieve enhanced performance in various environments. On the basis of the FsBCG-I algorithm, we further develop the FsBCG-II algorithm, which utilizes the Bessel function of the first kind to constrain outliers. As an alternative, the FsBCG-II algorithm has reduced computational complexity and similar performance as compared to the FsBCG-I algorithm. Moreover, the convergence property of the algorithms is analyzed. The proposed algorithms are compared with some highly cited previous works. Extensive simulation results demonstrate that the proposed algorithms can achieve robust performance when the noise source is impulsive, Gaussian, logistic, and time-varying.  相似文献   

12.
基于二维高阶累积量的自适应谱线增强算法的迭代步长很容易受到噪声干扰的影响，本文分析了基于二维高阶累积量的自适应谱线增强算法的特点，在此基础上提出了一种改进的基于二维高阶累积量的自适应谱线增强算法。计算机仿真结果表明，本文提出的算法对高斯白噪声和高斯色噪声都有很好的抑制作用，可以改善高斯噪声背景中小空间范围的二维信号信噪比。  相似文献   

13.
This work studies the problem of kernel adaptive filtering (KAF) for nonlinear signal processing under non-Gaussian noise environments. A new KAF algorithm, called kernel recursive generalized mixed norm (KRGMN), is derived by minimizing the generalized mixed norm (GMN) cost instead of the well-known mean square error (MSE). A single error norm such as lp error norm can be used as a cost function in KAF to deal with non-Gaussian noises but it may exhibit slow convergence speed and poor misadjustments in some situations. To improve the convergence performance, the GMN cost is formed as a convex mixture of lp and lq norms to increase the convergence rate and substantially reduce the steady-state errors. The proposed KRGMN algorithm can solve efficiently the problems such as nonlinear channel equalization and system identification in non-Gaussian noises. Simulation results confirm the desirable performance of the new algorithm.  相似文献   

14.
Error entropy is a well-known learning criterion in information theoretic learning (ITL), and it has been successfully applied in robust signal processing and machine learning. To date, many robust learning algorithms have been devised based on the minimum error entropy (MEE) criterion, and the Gaussian kernel function is always utilized as the default kernel function in these algorithms, which is not always the best option. To further improve learning performance, two concepts using a mixture of two Gaussian functions as kernel functions, called mixture error entropy and mixture quantized error entropy, are proposed in this paper. We further propose two new recursive least-squares algorithms based on mixture minimum error entropy (MMEE) and mixture quantized minimum error entropy (MQMEE) optimization criteria. The convergence analysis, steady-state mean-square performance, and computational complexity of the two proposed algorithms are investigated. In addition, the reason why the mixture mechanism (mixture correntropy and mixture error entropy) can improve the performance of adaptive filtering algorithms is explained. Simulation results show that the proposed new recursive least-squares algorithms outperform other RLS-type algorithms, and the practicality of the proposed algorithms is verified by the electro-encephalography application.  相似文献   

15.
The complex-valued flow matrix Drazin inverse has recently attracted considerable interest from researchers due to its great academic value. In this paper, a fixed-time convergence integral-enhanced zeroing neural network (FTCIEZNN) model is proposed and investigated for calculating the Drazin inverse of complex-valued flow matrix. Since the FTCIEZNN model possesses fixed-time convergence, its upper limit of convergence time is irrelevant to initial conditions and can be adjusted by specified system parameters. Meanwhile, by adopting the newly designed reformed nonlinear activation function (RNAF) and variable parameters, the FTCIEZNN model converges rapidly in a relatively fast fixed-time and its robustness is dramatically strengthened. In addition, the upper limit of the convergence time in the absence of noise and the upper limit of the steady-state error in the presence of time-varying bounded noise are given by a scrupulous mathematical logic calculation. Furthermore, the outcomes of the numerical simulations demonstrate that the FTCIEZNN model outshines existing zeroing neural network models in calculating complex-valued flow matrix Drazin inverse. Finally, an application based on the FTCIEZNN model in image encryption fully illustrates the practical value of the FCIEZNN model.  相似文献   

16.
《Journal of The Franklin Institute》2022,359(18):10688-10725
In this paper, we propose the full-rank and reduced-rank relaxed gradient-based iterative algorithms for solving the generalized coupled Sylvester-transpose matrix equations. We provide analytically the necessary and sufficient condition for the convergence of the proposed iterative algorithm and give explicitly the optimal step size such that the convergence rate of the algorithm is maximized. Some numerical examples are examined to confirm the feasibility and efficiency of the proposed algorithms.  相似文献   

17.
This paper discusses the parameter estimation for a class of bilinear-in-parameter systems with colored noise. By utilizing the filtering technique, we derive the relationship between the filtered output and the measurement output and obtain two linear regressive sub-models. A filtering based multi-innovation stochastic gradient algorithm is derived for interactively identifying each sub-model. The proposed algorithm avoids the estimation of correlated noise and improves the parameter estimation accuracy by making full use of the measurement data. The numerical simulation results indicate that the proposed algorithm has higher estimation accuracy than the hierarchical multi-innovation stochastic gradient algorithm.  相似文献   

18.
For the multi-input single-output (MISO) system corrupted by colored noise, we transform the original system model into a new MISO output error model with white noise through data filtering technology. Based on the newly obtained model and the bias compensation principle, a novel data filtering-based bias compensation recursive least squares (BCRLS) identification algorithm is developed for identifying the parameters of the MISO system with colored noise disturbance. Unlike the exiting BCRLS method for the MISO system (see, in Section 3), without computing the complicated noise correlation functions, still the proposed method can achieve the unbiased parameters estimation of the MISO system in the case of colored process noises. The proposed algorithm simplifies the implementation of and further expands the application scope of the existing BCRLS method. Three numerical examples clearly illustrate the validity of and the good performances of the proposed method, including its superiority over the BCRLS method and so on.  相似文献   

19.
Orthogonal frequency division multiplexing (OFDM) has been widely adopted in radar and communication systems. High sensitivity to carrier frequency offset (CFO) is one of the major drawbacks of OFDM. CFO estimation for OFDM systems had been extensively studied and various algorithms had been proposed. However, the established algorithms may be compromised by the adoption of direct-conversion architecture and multi-mode low noise amplifier in the OFDM receiver, which introduces time-varying direct current offset (TV-DCO) into the system. In our previous study, we developed an eigen-decomposition based estimation algorithm, which is robust to TV-DCO but suffers from performance degradation under low to medium signal-to-noise ratio and requires high computation efforts. To address those issues, we in this paper propose a novel blind CFO estimation algorithm. By making use of the second order differential filtering and subspace method, the proposed algorithm achieves great performance improvement with reduced complexity. The performance of the proposed algorithm is demonstrated by simulations.  相似文献   

20.
A novel finite-time complex-valued zeroing neural network (FTCVZNN) for solving time-varying Sylvester equation is proposed and investigated. Asymptotic stability analysis of this network is examined with any general activation function satisfying a condition or with an odd monotonically increasing activation function. So far, finite-time model studies have been investigated for the upper bound time of convergence using a linear activation function with design formula for the derivative of the error or with variations of sign-bi-power activation functions to zeroing neural networks. A function adaptive coefficient for sign-bi-power activation function (FA-CSBP) is introduced and examined for faster convergence. An upper bound on convergence time is derived with the two components in the function adaptive coefficients of sign-bi-power activation function. Numerical simulation results demonstrate that the FTCVZNN with function adaptive coefficient for sign-bi-power activation function is faster than applying a sign-bi-power activation function to the zeroing neural network (ZNN) and the other finite-time complex-valued models for the selected example problems.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号