Simple and robust analytically derived variable step-size least mean squares algorithm for channel estimation

被引:8
|
作者
Filho, A. M. A. [1 ]
Pinto, E. L. [1 ]
Galdino, J. F. [1 ]
机构
[1] Inst Mil Engn, Dept Elect Engn, Rio De Janeiro, Brazil
关键词
LMS ALGORITHM;
D O I
10.1049/iet-com.2009.0038
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
A new variable step-size least mean squares (VSS-LMS) algorithm for the estimation of frequency-selective communications channels is herein presented. In contrast to previous works, in which the step-size adaptation is based on the instantaneous samples of the error signal, this algorithm is derived on the basis of analytical minimisation of the ensemble-averaged mean-square weight error. A very simple rule for step-size adaptation is obtained, using a small number of communication system parameters. This is another significant difference from other proposals, in which a large number of control parameters should be tuned for proper use. The algorithm here proposed is shown to be applicable to both time-varying and time-invariant scenarios. While the lack of a termination rule for step-size adaptation is a common characteristic of other schemes, the algorithm here presented adopts a criterion for stopping the step-size adaptation that assures optimal steady-state performance and leads to large computational savings. A simulation-based performance comparison with other VSS-LMS schemes is provided, including their application to maximum likelihood sequence estimation receivers using per survivor processing (MLSE/PSP). The results show that the algorithm proposed in this work has good performance characteristics and a very low computational cost, specially in the application to MLSE/PSP receivers. Besides, this algorithm is shown to be robust to changes in the signal-to-noise ratio (SNR).
引用
收藏
页码:1832 / 1842
页数:11
相关论文
共 50 条
  • [11] A new robust variable step-size NLMS algorithm
    Vega, Leonardo Rey
    Rey, Hernan
    Benesty, Jacob
    Tressens, Sara
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2008, 56 (05) : 1878 - 1893
  • [12] A robust variable step-size affine projection algorithm
    Vega, Leonardo Rey
    Rey, Hernan
    Benesty, Jacob
    SIGNAL PROCESSING, 2010, 90 (09) : 2806 - 2810
  • [13] An implementation of variable step-size least-mean-square based control algorithm for DSTATCOM
    Badoni, Manoj
    Singh, Alka
    Singh, Bhim
    INTERNATIONAL TRANSACTIONS ON ELECTRICAL ENERGY SYSTEMS, 2016, 26 (07): : 1540 - 1554
  • [14] Variable step-size Block Least Mean Square adaptive filters
    Abadi, M. S. E.
    Mousavi, S. Z.
    Hadei, A.
    2006 INTERNATIONAL CONFERENCE ON INDUSTRIAL AND INFORMATION SYSTEMS, VOLS 1 AND 2, 2006, : 593 - +
  • [15] Robust Variable Step-Size Decorrelation Normalized Least-Mean-Square Algorithm and its Application to Acoustic Echo Cancellation
    Zhang, Sheng
    Zhang, Jiashu
    Han, Hongyu
    IEEE-ACM TRANSACTIONS ON AUDIO SPEECH AND LANGUAGE PROCESSING, 2016, 24 (12) : 2368 - 2376
  • [16] Iteration-Promoting Variable Step Size Least Mean Square Algorithm for Accelerating Adaptive Channel Estimation
    Liu, Beiyi
    Gui, Guan
    Xu, Li
    Shimoi, Nobuhiro
    2015 54TH ANNUAL CONFERENCE OF THE SOCIETY OF INSTRUMENT AND CONTROL ENGINEERS OF JAPAN (SICE), 2015, : 75 - 80
  • [17] Transform domain Variable Step-size Griffiths Least Mean Square adaptive algorithm and its applications
    Roopa, S.
    Narasimhan, S. V.
    COMPUTERS & ELECTRICAL ENGINEERING, 2014, 40 (04) : 1028 - 1041
  • [18] Robust pseudo affine projection algorithm with variable step-size
    Lee, J.
    Park, Y. -C.
    Youn, D. -H.
    ELECTRONICS LETTERS, 2008, 44 (03) : 250 - 251
  • [19] A variable step-size filtered-x least mean square algorithm for continuously varying noise
    Puri, Amrita
    Modak, Subodh V.
    Gupta, Kshitij
    NOISE CONTROL ENGINEERING JOURNAL, 2016, 64 (04) : 469 - 484
  • [20] A NEWLY DERIVED VARIABLE DEGREE VARIABLE STEP-SIZE LMS ALGORITHM
    KHASAWNEH, MA
    MAYYAS, KA
    INTERNATIONAL JOURNAL OF ELECTRONICS, 1995, 79 (03) : 255 - 264