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

Azam Khalili

doi:10.1016/j.sigpro.2015.10.034

Return

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

2016-04-01

PRE

Azam Khalili *

Amir Rastegarnia

Saeid Sanei

DOI：10.1016/j.sigpro.2015.10.034

Original

Original request for help

Save

Abstract

En 中文

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.

Keywords:

Adaptive networks

Complex signal

Distributed estimation

Incremental

Quantized augmented least mean-square

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.