
For FullText PDF, please login, if you are a member of IEICE,
or go to Pay Per View on menu list, if you are a nonmember of IEICE.

Analysis of the Convergence Condition of LMS Adaptive Digital Filter Using Distributed Arithmetic
Kyo TAKAHASHI Yoshitaka TSUNEKAWA Norio TAYAMA Kyoushirou SEKI
Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Vol.E85A
No.6
pp.12491256 Publication Date: 2002/06/01 Online ISSN:
DOI: Print ISSN: 09168508 Type of Manuscript: Special Section PAPER (Special Section on Papers Selected from 2001 International Technical Conference on Circuits/Systems, Computers and Communications (ITCCSCC 2001)) Category: Keyword: distributed arithmetic, LMS algorithm, adaptive function space, convergence condition, offset bias,
Full Text: PDF>>
Summary:
An LMS adaptive digital filter using distributed arithmetic (DAADF) has been proposed. Cowan and others proposed the DA adaptive algorithm with offset binary coding for the simple derivation of an algorithm and the use of an oddsymmetry property of adaptive function space (AFS). However, we indicated that a convergence speed of this DA adaptive algorithm degraded extremely by our computer simulations. To overcome these problems, we have proposed the DA adaptive algorithm generalized with two's complement representation and effective architectures. Our DAADF has performances of a high speed, small output latency, a good convergence speed, smallscale hardware and lower power dissipation for higher order, simultaneously. In this paper, we analyze a convergence condition of DA adaptive algorithm that has never been considered theoretically. From this analysis, we indicate that the convergence speed is depended on a distribution of eigenvalues of an autocorrelation matrix of an extended input signal vector . Furthermore, we obtain the eigenvalues theoretically. As a result, we clearly show that our DAADF has an advantage of the conventional DAADF in the convergence speed.


