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

A blind equalization with the sign algorithm for broadband access

IEEE COMMUNICATIONS LETTERS 2001年第2期5卷 70-72页

作者： Im, GH Park, CJ Won, HC POSTECH Dept Elect Engn Pohang 790784 Kyungbuk South Korea

This paper presents an optimal reduced constellation point of sign reduced constellation algorithm (SRCA) for square and nonsquare carrierless amplitude and phase (CAP)/QAM signal constellations. Convergence character... 详细信息

关键词： ATM-LAN and xDSL environments blind equalization FTTC sign algorithm

来源：评论

学校读者我要写书评

暂无评论

A Rayleigh weighted variable step-size sign algorithm for robust adaptive filtering in impulsive noises

引用

DIGITAL signAL PROCESSING 2017年 68卷 102-111页

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

The sign algorithm with a fixed step-size is incapable of addressing the conflicting requirements between fast convergence speed and low steady-state misadjustments. In order to deal with this problem, a Rayleigh weighted gradient vector based variable step-size sign algorithm is proposed in this paper. In the new algorithm, the variable step-size is updated by the squared norm of a Rayleigh weighted sign gradient vector. The proposed algorithm can improve the convergence speed and tracking capability while maintaining the similar steady-state misadjustments in the presence of impulsive noises. A complex valued energy conservation relation based convergence analysis is carried out to evaluate the convergence performance of the new algorithm. Simulation results are presented to verify the theoretical analysis and to demonstrate the desirable performance of the proposed algorithm. (C) 2017 Elsevier Inc. All rights reserved.

关键词： Gradient vector Variable step-size sign algorithm Adaptive filtering algorithm

来源：评论

学校读者我要写书评

暂无评论

Steady-State Analysis of Sparsity-Aware Affine Projection sign algorithm for Impulsive Environment

引用

CIRCUITS SYSTEMS AND signAL PROCESSING 2017年第5期36卷 1934-1947页

作者： Radhika, S. Sivabalan, Arumugam Sathyabama Univ Fac Elect & Elect Engn Madras Tamil Nadu India NEC Mobile Networks Excellence Ctr Madras Tamil Nadu India

A novel zero attraction affine projection sign algorithm (ZA-APSA) for strong impulsive and sparse environment is proposed in this paper. Here norm penalty is introduced to original cost function of APSA which provides zero attraction to the filter weights. The APSA provides lower computational complexity and is robust against impulsive noise, whereas the ZA-APA works well in sparse environment with improved convergence and lower steady-state error. The proposed ZA-APSA combines the feature of APSA and ZA-APA, and hence, it provides faster convergence and lesser steady-state error with high robustness to impulsive interference with low computational complexity than the conventional ones. The stability condition for the convergence in the mean and mean square error sense is derived. Theoretical analysis is made to prove that the proposed algorithm can achieve lesser steady-state mean square error than APSA. Simulations are performed to validate the analysis made and to prove the suitability of the proposed algorithm for sparse and impulsive system identification.

关键词： Affine projection algorithm Convergence Impulsive interference sign algorithm Steady-state mean square error Zero attraction

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of the sign algorithm for a constrained adaptive IIR notch filter

引用

IEEE TRANSACTIONS ON signAL PROCESSING 2003年第7期51卷 1846-1858页

作者： Xiao, YG Ward, RK Ikuta, A Univ British Columbia Inst Comp Informat & Cognit Syst Vancouver BC V6T 1Z4 Canada Hiroshima Prefectural Womens Univ Fac Human Life & Environm Sci Hiroshima 7348558 Japan

Adaptive infinite impulse response (IIR) notch filters are very attractive in terms of their reasonable performances and low computational requirements. Generally, it is very difficult to assess their performances analytically due to their IIR nature. This paper analyzes in detail the steady-state performance of the sign algorithm (SA) for a well-known adaptive IIR notch filter with constrained poles and zeros. Slow adaptation and Gaussianity of the notch filter output are assumed for the sake of analysis. Two difference equations are first established for the convergences in the mean and mean square in the vicinity of the steady state of the algorithm. Steady-state estimation error or bias and mean square error (MSE) of the SA are then derived in closed forms. A coarse stability bound is also derived for the algorithm. Theory-based comparison between the algorithm and the plain gradient (PG) algorithm is done in some detail. Extensive simulations are conducted to demonstrate the validity of the analytical results for both slow and relatively fast adaptations.

关键词： adaptive notch filtering constrained IIR notch filter estimation bias estimation mean mean square error (NISE) sign algorithm steady-state performance

来源：评论

学校读者我要写书评

暂无评论

Tracking of the sign algorithm with a central dead zone in the noise distribution

引用

signAL PROCESSING 2004年第2期84卷 379-386页

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

The paper analyzes the tracking performance 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 time-varying plant with a Gaussian input. A random-walk model of the plant variation is assumed. 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 bounds hold for all values of the algorithm step size. The minima of the bounds are derived. It is found that the tracking performance of the algorithm is poor in comparison with that in the case of a Gaussian noise. The wider the dead zone in the noise distribution, the worse the performance. It is also found that the tracking performance is strongly dependent on the width of the dead zone and weakly dependent on the degree of non-stationarity of the plant. The analytical results of the paper are supported by simulations. (C) 2003 Elsevier B.V. All rights reserved.

关键词： adaptive signal processing adaptive filtering sign algorithm

来源：评论

学校读者我要写书评

暂无评论

A VARIABLE STEP-SIZE NORMALIZED sign algorithm FOR ACOUSTIC ECHO CANCELATION

A VARIABLE STEP-SIZE NORMALIZED SIGN ALGORITHM FOR ACOUSTIC ...

引用

2010 IEEE International Conference on Acoustics, Speech, and signal Processing

作者： Shao, Tiange Zheng, Yahong Rosa Benesty, Jacob Missouri Univ Sci & Technol Dept Elect & Comp Engn Rolla MO 65409 USA Univ Quebec Montreal PQ H5A 1K6 Canada

ISBN: (纸本)9781424442966

A variable step size normalized sign algorithm (VSS-NSA) is proposed, for acoustic echo cancelation, which adjusts its step size automatically by matching the L1 norm of the a posteriori error to that of the background noise plus near-end signal. Simulation results show that the new algorithm combined with double-talk detection outperforms the dual sign algorithm (DSA) and the normalized triple-state sign algorithm (NTSSA) in terms of convergence rate and stability.

关键词： echo canceler double talk robust adaptive filter variable step size sign algorithm

来源：评论

学校读者我要写书评

暂无评论

Improving Convergence Rate of sign algorithm using Natural Gradient Method 29

Improving Convergence Rate of Sign Algorithm using Natural G...

引用

29th European signal Processing Conference (EUSIPCO)

作者： Mineo, Taiyo Shouno, Hayaru Univ Electrocommun Grad Sch Informat & Engn Tokyo Japan

ISBN: (纸本)9789082797060

In lossless audio compression, it is essential for predictive residuals to remain sparse when applying entropy codings. Hence, developing an accurate predictive method is crucial. The sign algorithm (SA) is a conventional method for minimizing the magnitude of residuals;however, it exhibits poor convergence performance compared with the least mean square (LMS) algorithm. To overcome the convergence performance degradation, we proposed novel adaptive algorithms based on a natural gradient: the natural gradient sign algorithm (NGSA) and normalized NGSA (NNGSA). We also propose an efficient update method for the natural gradient based on the AR(p) model. It requires O(p) multiply-add operations at every adaptation step. Through experiments conducted using toy data and real music data, we showed that the proposed algorithms achieve better convergence performance than the SA does. The NNGSA suggested having good compression ability in lossless audio coding.

关键词： Lossless audio coding adaptive algorithm sign algorithm natural gradient method autoregressive model

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of Orthogonal Gradient sign algorithm Using Spline-based Hammerstein Model for Smart Application

引用

Journal of Mobile Multimedia 2022年第4期18卷 1211-1230页

作者： Sitjongsataporn, Suchada Prongnuch, Sethakarn Department of Electronic Engineering Mahanakorn Institute of Innovation (MII) Faculty of Engineering and Technology Mahanakorn University of Technology 140 Cheumsamphan Rd. Nongchok Bangkok Thailand Department of Robotics Engineering Faculty of Industrial Technology Suan Sunandha Rajabhat University 1 U-Thong Nok Rd.Dusit Bangkok Thailand

This paper presents a spline-based Hammerstein model for adaptive filtering based on a sign algorithm with the normalised orthogonal gradient algorithm. Spline-based Hammerstein architecture consists of an interpolation splinebased adaptive lookup table in the part of nonlinear filter and an adaptive finite impulse response filter used in the part of linear filter. Hammerstein spline adaptive filter (HSAF) is a nonlinear filter for the nonlinear systems among the advantages in the low computational cost and high performance. An adaptive lookup table and spline control points are determined and derived with the orthogonal gradient-based mechanism. Performance analysis in terms of convergence properties and mean square analysis based on the mean square error (MSE) constraint are proven by using the Taylor series expansion of the estimation error in the form of the excess MSE. Experimental results indicate the robust performance of the proposed algorithm can provide the better performance than the other models based on the conventional least mean square Hammerstein spline adaptive filtering algorithm. © 2022 River Publishers.

关键词： Hammerstein model nonlinear systems orthogonal gradient adaptive algorithm sign algorithm spline adaptive filtering

来源：评论

学校读者我要写书评

暂无评论

Adaptive Graph Normalized sign algorithm 2

Adaptive Graph Normalized Sign Algorithm

引用

2nd IEEE Conference on Artificial Intelligence (CAI)

作者： Peng, Changran Yan, Yi Kuruoglu, Ercan E. Tsinghua Univ Tsinghua Berkeley Shenzhen Inst Shenzhen Peoples R China Tsinghua Shenzhen Int Grad Sch Inst Data & Informat Shenzhen Peoples R China

ISBN: (纸本)9798350354102;9798350354096

Efficient and robust prediction of graph signals is challenging when the signals are under impulsive noise and have missing data. Exploiting graph signal processing (GSP) and leveraging the simplicity of the classical adaptive sign algorithm, we propose an adaptive algorithm on graphs named the Graph Normalized sign (GNS). GNS approximated a normalization term into the update, therefore achieving faster convergence and lower error compared to previous adaptive GSP algorithms. In the task of the online prediction of multivariate temperature data under impulsive noise, GNS outputs fast and robust predictions.

关键词： adaptive filter sign algorithm online estimation graph signal processing

来源：评论

学校读者我要写书评

暂无评论

Variable step-size weighted zero-attracting sign algorithm

引用

signAL PROCESSING 2020年 172卷 107542-107542页

作者： Chen, Xu Ni, Jingen Soochow Univ Sch Elect & Informat Engn Suzhou 215006 Peoples R China

The classical sign algorithm (SA) has been widely used in adaptive filters due to its low computational complexity and robustness against impulsive noise. In some applications the system to be estimated may be sparse. To improve the convergence rate of the SA for sparse system estimation, this paper incorporates a weighted l(1)-norm into the cost function built for the SA to develop a weighted zero-attracting SA (WZA-SA). Since the WZA-SA uses a constant step-size, it requires to take a tradeoff between fast convergence rate and small steady-state misalignment. To address this problem, we present a variable step-size (VSS) for the WZA-SA based on the mean-squared deviation (MSD) model-driven method. Simulation results are provided to verify its good performance for white or not highly correlated input signals. (C) 2020 Elsevier B.V. All rights reserved.

关键词： sign algorithm Zero-attraction Weighted l(1)-norm Variable step-size Mean-square deviation Model-driven method

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：