检索结果-内蒙古大学图书馆

A correntropy inspired variable step-size sign algorithm against impulsive noises

signAL PROCESSING 2017年 141卷 168-175页

作者： Wang, Weihua Zhao, Jihong Qu, Hua Chen, Badong Xi An Jiao Tong Univ Sch Elect & Informat Engn Xian 710049 Shaanxi Peoples R China

The adaptive variable step-size technique is an effective way to improve the convergence rate of an adaptive filtering algorithm. However, for most existing variable step-size sign algorithm against impulsive noise, either the performance is not good enough, or the calculation is complex. In this paper, a correntropy inspired variable step-size method for sign algorithm is proposed. The new variable step-size method is computationally simple and robust to impulsive noises. Theoretical analysis and simulation results demonstrate that the proposed algorithm can achieve desirable performance with low computational complexity in presence of impulsive noises. (C) 2017 Elsevier B.V. All rights reserved.

关键词： Correntropy Variable step-size sign algorithm

来源：评论

学校读者我要写书评

暂无评论

Variable step-size affine projection sign algorithm using selective input vectors

引用

signAL PROCESSING 2015年 115卷 151-156页

作者： Kim, Seung Hun Jeong, Jae Jin Choi, Jong Hyun Kim, Sang Woo Pohang Univ Sci & Technol Dept Elect Engn Pohang 790784 South Korea Pohang Univ Sci & Technol Dept Creat IT Excellence Engn Pohang 790784 South Korea Pohang Univ Sci & Technol Future IT Innovat Lab Pohang 790784 South Korea

Affine projection sign algorithm (APSA) is a useful adaptive filter for a highly correlated input signal in the presence of impulsive noise. In this study, a novel variable step-size APSA is proposed using selective input vectors to achieve both fast convergence rate and low steady-state mean-square deviation (MSD) with low computational cost. The selective input vectors and step size are chosen so as to maximize the theoretical MSD difference derived using Price's theorem. The simulation results show that the proposed algorithm has the fastest convergence rate and lowest steady-state MSD when compared with recent variable step-size APSAs. Moreover, it effectively reduces computational cost. (C) 2015 Elsevier B.V. All rights reserved.

关键词： Adaptive filter Affine projection algorithm sign algorithm Projection order Mean-square deviation

来源：评论

学校读者我要写书评

暂无评论

Diffusion Sparse sign algorithm with Variable Step-Size

引用

CIRCUITS SYSTEMS AND signAL PROCESSING 2019年第4期38卷 1736-1750页

作者： Chen, Feng Liu, Xiaoxia Duan, Shukai Wang, Lidan Wu, Jiagui Southwest Univ Coll Elect & Informat Engn Chongqing 400715 Peoples R China Southwest Univ Sch Math & Stat Chongqing 400715 Peoples R China Key Lab Nonlinear Circuits & Intelligent Informat Chongqing 400715 Peoples R China Chongqing Collaborat Innovat Ctr Brain Sci Chongqing 400715 Peoples R China

In this paper, we propose the diffusion sparse sign algorithm with variable step-size for distributed estimation in sparse and impulsive interference environments. Firstly, we address the problem of in-network distributed estimation for sparse vectors under the impulsive noise environment. In order to exploit the sparsity of the vector of interest, we incorporate the sparse norms (l1-norm and RWl1-norm) into the cost function of the standard diffusion sign algorithm, which accelerates the convergence speed of zero or near-zero components. In addition, we propose the adaptive variable step-size to further improve the convergence rate of the proposed algorithm. The variable step-size is derived by the correlation entropy, which contains a modified Gaussian kernel function and is robust to impulsive noise. In this paper, every node combines its correlation entropy function with the information of its neighborhood to drive the variable step-size at each iteration. Simulation results show that the proposed algorithm outperforms the standard diffusion SA in the sparse and impulsive system and the convergence rate of the proposed algorithm is faster than constant step-size algorithms.

关键词： Diffusion Sparsity Variable step-size Impulsive noise sign algorithm

来源：评论

学校读者我要写书评

暂无评论

Tracking performance of a quantized adaptive filter equipped with the sign algorithm

引用

signAL PROCESSING 1998年第2期69卷 157-162页

作者： Eweda, E Younis, WM El-Ramly, SH Mil Tech Coll Cairo Egypt

The paper is concerned with analyzing the effect of finite wordlength on the tracking performance of a sign algorithm when used in the adaptive identification of a time-varying plant. Rounding quantization is assumed. Expressions of the steady-state mean-square error, steady-state mean-square weight deviation, and the corresponding optimum step sizes are derived. It is found that the mean-square error, mean-square weight deviation, and the optimum step sizes increase as the filter weight wordlength decreases. The effect of filter weight wordlength is found to be equivalent to an increase of the degree of nonstationarity of the plant. Conditions at which the effect of finite wordlength dominates (or is dominated by) the effect of plant nonstationarity are derived. The theoretical results of the paper are validated by computer simulations. (C) 1998 Elsevier Science B.V. All rights reserved.

关键词： nonstationary adaptive filtering round off error analysis sign algorithm

来源：评论

学校读者我要写书评

暂无评论

A variable step-size sign algorithm for channel estimation

引用

signAL PROCESSING 2014年 102卷 304-312页

作者： Li, Yuan-Ping Lee, Ta-Sung Wu, Bing-Fei Natl Chiao Tung Univ Dept Elect & Comp Engn Hsinchu 30010 Taiwan

This paper proposes a new variable step-size sign algorithm (VSSA) for unknown channel estimation or system identification, and applies this algorithm to an environment containing two-component Gaussian mixture observation noise. The step size is adjusted using the gradient-based weighted average of the sign algorithm. The proposed scheme exhibits a fast convergence rate and low misadjustment error, and provides robustness in environments with heavy-tailed impulsive interference. (C) 2014 Elsevier B.V. All rights reserved.

关键词： Adaptive filters Channel estimation Impulsive noise Least mean square sign algorithm System identification

来源：评论

学校读者我要写书评

暂无评论

Convergence analysis of the sign algorithm without the independence and Gaussian assumptions

引用

IEEE TRANSACTIONS ON signAL PROCESSING 2000年第9期48卷 2535-2544页

作者： Eweda, E Mil Tech Coll Dept Elect Engn Cairo Egypt

The paper is concerned with rigorous convergence analysis of the sign algorithm (SA) in the context of adaptive plant identification. Asymptotic time-averaged convergence for the mean absolute weight misalignment is proved for all values of the algorithm step size and initial weight vector. The paper has three main contributions with respect to available convergence results of the SA. The first is the deletion of the Gaussian assumption, which is important when covering the case of discrete valued data. No assumption about the distribution of the regressor sequence is used, except for the usual assumption of positive definite covariance matrix, The assumptions used about the noise allow nonexistence, unboundedness, and vanishing of the noise probability density function for arguments strictly different from zero, The second contribution is the deletion of the assumption of independent successive regressors, This deletion is important since, in applications, two successive regressors usually share all their components except two. Hence, they are strongly dependent, even for white plant input. The case of colored noise is also analyzed. Finally, the third contribution is the extension of the above results to the nonstationary case. The used assumptions allow nonstationarity of the plant input, plant noise, and plant parameters.

关键词： adaptive filtering adaptive signal processing algorithms sign algorithm

来源：评论

学校读者我要写书评

暂无评论

Convergence analysis of the sign algorithm with badly behaved noise

引用

signAL PROCESSING 2003年第1期83卷 57-65页

作者： Eweda, E Ajman Univ Sci & Technol Fac Engn Abu Dhabi U Arab Emirates

The paper analyzes the convergence of the sign algorithm when the noise distribution has a dead zone that includes the origin. The analysis is done in the context of the identification of a plant with a stationary Gaussian input. Upper bounds of the time-averaged mean absolute excess estimation error and the time-averaged mean norm of the weight misalignment vector are derived. The former bound does not depend on the data correlation while the latter one does. The bounds hold for all values of the algorithm step size p. Both bounds tend to zero as mu tends to zero. The bounds are significantly dependent on the width of the dead zone while they are weakly dependent on mu when mu is less than some threshold. The threshold is proportional to the width of the dead zone. The speed-accuracy trade-off of the algorithm is found to be poor in comparison with that in the case of a Gaussian noise. The wider is the dead zone, the worse is the trade-off. The theoretical results of the paper are supported by simulations. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： adaptive filtering adaptive signal processing sign algorithm

来源：评论

学校读者我要写书评

暂无评论

Tracking analysis of the sign algorithm without the gaussian constraint

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-ANALOG AND DIGITAL signAL PROCESSING 1998年第1期45卷 115-122页

作者： Eweda, E Mil Tech Coll Dept Elect Engn Cairo Egypt

This paper is concerned with the analysis of the sign algorithm (SA) when used to adapt a finite impulse response (FIR:) filter with randomly time-varying target weights, The analysis is done under the assumption that positive and negative polarities of the noise are equally probable and that the noise probability density function at the origin exists and is strictly positive, This assumption fits many noise distributions encountered in applications, Expressions of the excess mean square error xi and the mean square weight misalignment II are derived, It is found that both xi and eta are independent of the type of distribution of the filter input, Both xi and eta are proportional to the reciprocal of the noise probability density function at the origin. The step sizes that minimize xi and eta are found to be independent of both the variance and the type of distribution of the noise, Given the sum of the mean square target weight fluctuations, it is found that xi(resp. eta) is independent (resp, dependent) on both. the mean squares of individual target weight fluctuations and the mutual correlation among them, The tracking properties of the SA are found to be strongly related to the ones of the LMS algorithm, It is shown that the charts of xi and eta versus the step size of the SA can be obtained from the corresponding ones of the LMS algorithm via a simple linear transformation that depends only on the noise distribution, The above results hold for both continuous and discrete distributions of the input of the filter.

关键词： adaptive filtering adaptive signal processing sign algorithm

来源：评论

学校读者我要写书评

暂无评论

Efficient Implementation of the Affine Projection sign algorithm

引用

IEEE signAL PROCESSING LETTERS 2012年第1期19卷 24-26页

作者： Ni, Jingen Li, Feng Soochow Univ Sch Elect & Informat Engn Suzhou 215006 Peoples R China Fudan Univ Dept Elect Engn Shanghai 200433 Peoples R China

L-1-norm optimization-based sign algorithms (SAs) are more robust against impulsive interference than L-2-norm optimization-based adaptive filtering algorithms. However, most SAs suffer from slow convergence rate, especially for highly correlated input signals. In order to overcome this problem, recently, an affine projection SA (APSA) has been proposed [6], which exhibits fast convergence rate. In this letter, we first analyze the computational complexity of the APSA in detail and then apply a recursive approach proposed for the affine projection algorithm (APA) to the APSA to reduce its computational complexity. Analysis results show that the computational complexity of the APSA with the efficient implementation method is even lower than that of the classical fast affine projection (FAP) algorithm.

关键词： Adaptive filtering affine projection efficient implementation sign algorithm

来源：评论

学校读者我要写书评

暂无评论

A new sign algorithm for interference suppression in DS-CDMA systems

引用

IEEE COMMUNICATIONS LETTERS 2003年第5期7卷 233-235页

作者： Sun, LP Hu, GR Shanghai Jiao Tong Univ Dept Elect Engn Shanghai 200030 Peoples R China

A blind adaptive step-size, averaging blind sign algorithm (AS-asign) for,suppression of multiple access interference. (MAI) in direct-sequence/code-division multiple access (DS/CDMA) systems is proposed. It combines the sign-regressor algorithm and the concept of variable step-size, uses a second least mean square algorithm for the step size of blind averaging sign-regressor algorithm. Simulations indicate that this algorithm yields improvements over similar adaptive step-size algorithm in dynamic environments.

关键词： averaging code division multiple access (CDMA) multiple access interference (MAI) sign algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：