Quantized augmented complex least-mean square algorithm: Derivation and performance analysis

被引:21
|
作者
Khalili, Azam [1 ]
Rastegarnia, Amir [1 ]
Sanei, Saeid [2 ]
机构
[1] Malayer Univ, Dept Elect Engn, Malayer, Iran
[2] Univ Surrey, Dept Comp, Surrey GU2 7XH, England
关键词
Adaptive networks; Complex signal; Distributed estimation; Incremental; Quantized augmented least mean-square; INCREMENTAL LMS ALGORITHM; RANDOM VECTORS; NETWORKS; SIGNALS;
D O I
10.1016/j.sigpro.2015.10.034
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Augmented adaptive filters provide superior performance over their conventional counterparts when dealing with noncircular complex signals. However, the performance of such filters may change considerably when they are implemented in finite-precision arithmetic due to round-off errors. In this paper, we study the performance of recently introduced augmented complex least mean-square (ACLMS) algorithm when it is implemented in finite-precision arithmetic. To this aim, we first derive a model for the finite precision ACLMS updating equations. Then, using the established energy conservation argument, we derive a closed-form expression, in terms of the excess mean-square error (EMSE) metric which explains how the quantized ACLMS (QACLMS) algorithm performs in the steady-state. We further derive the required conditions for mean stability of the QACLMS algorithm. The derived expression, supported by simulations, reveals that unlike the infinite-precision case, the EMSE curve for QACLMS is not monotonically increasing function of the step-size parameter. We use this observation to optimize the step-size learning parameter. Simulation results illustrate the theoretical findings. (C) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码:54 / 59
页数:6
相关论文
共 50 条
  • [31] Power system frequency estimation using least-mean square technique
    Pradhan, AK
    Routray, A
    Basak, A
    [J]. IEEE TRANSACTIONS ON POWER DELIVERY, 2005, 20 (03) : 1812 - 1816
  • [32] The Generalized Complex Kernel Least-Mean-Square Algorithm
    Boloix-Tortosa, Rafael
    Jose Murillo-Fuentes, Juan
    Tsaftaris, Sotirios A.
    [J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2019, 67 (20) : 5213 - 5222
  • [33] Quasi-Newton Least-Mean Fourth Adaptive Algorithm
    bin Mansoor, Umair
    Mayyala, Qadri
    Moinuddin, Muhammad
    Zerguine, Azzedine
    [J]. 2017 25TH EUROPEAN SIGNAL PROCESSING CONFERENCE (EUSIPCO), 2017, : 2639 - 2643
  • [34] Diffusion least-mean squares over adaptive networks: Formulation and performance analysis
    Lopes, Cassio G.
    Sayed, Ali H.
    [J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2008, 56 (07) : 3122 - 3136
  • [35] A modified quantized kernel least mean square algorithm for prediction of chaotic time series
    Zheng, Yunfei
    Wang, Shiyuan
    Feng, Jiuchao
    Tse, Chi K.
    [J]. DIGITAL SIGNAL PROCESSING, 2016, 48 : 130 - 136
  • [36] STEADY-STATE MEAN SQUARE PERFORMANCE OF A SPARSIFIED KERNEL LEAST MEAN SQUARE ALGORITHM
    Chen, Badong
    Qin, Zhengda
    Sun, Lei
    [J]. 2017 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2017, : 2701 - 2705
  • [37] Design and Analysis of the Fractional-Order Complex Least Mean Square (FoCLMS) Algorithm
    Ahmad, Jawwad
    Zubair, Muhammad
    Rizvi, Syed Sajjad Hussain
    Shaikh, Muhammad Shafique
    [J]. CIRCUITS SYSTEMS AND SIGNAL PROCESSING, 2021, 40 (10) : 5152 - 5181
  • [38] Design and Analysis of the Fractional-Order Complex Least Mean Square (FoCLMS) Algorithm
    Jawwad Ahmad
    Muhammad Zubair
    Syed Sajjad Hussain Rizvi
    Muhammad Shafique Shaikh
    [J]. Circuits, Systems, and Signal Processing, 2021, 40 : 5152 - 5181
  • [39] Performance Analysis l0 of Norm Constraint Least Mean Square Algorithm
    Su, Guolong
    Jin, Jian
    Gu, Yuantao
    Wang, Jian
    [J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2012, 60 (05) : 2223 - 2235
  • [40] Diffusion Leaky Zero Attracting Least Mean Square Algorithm and Its Performance Analysis
    Shi, Long
    Zhao, Haiquan
    [J]. IEEE ACCESS, 2018, 6 : 56911 - 56923