Analysis on the Convergence Property of Quantized-x NLMS Algorithm

概要

論文の詳細を見る
The adaptive system design by 16-bit fixed point processing enables to employ an inexpensive digital signal processor (DSP). The narrow dynamic range of such 16 bits, how-ever, does not guarantee the same performance that is confirmed beforehand by computer simulations. A cause of degrading the performance originates in the operation halving the word length doubled by multiplication. This operation rounds off small signals staying in the lower half of the doubled word length to zero. This problem can be solved by limiting the multiplier to only its sign (±) like the signed regressor algorithm, named 'bi-quantized-x' algorithm in this paper, for the convenience mentioned below. This paper first derives the equation describing the convergence property provided by a type of signed regressor algorithms, the bi-quantized-x normalized least mean square (NLMS) algorithm, and then formulates its convergence condition and the step size maximizing the convergence rate. This paper second presents a technique to improve the convergence property. The bi-qiantized-x NLMS algorithm quantizes the reference signal to ±1 according to the sign of the reference signal, whereas the technique moreover assigns zero to the reference signal whose amplitude is less than a predetermined level. This paper explains the principle that the 'tri-qunatized-x' NLMS algorithm employing the technique can improve the convergence property, and confirms the improvement effect by computer simulations.
社団法人電子情報通信学会の論文
2001-08-01

Analysis on the Convergence Property of Quantized-x NLMS Algorithm

スポンサーリンク

概要

著者

関連論文

スポンサーリンク