WEKO3
インデックスリンク
アイテム
Analysis of the Convergence Condition of LMS Adaptive Digital Filter Using Distributed Arithmetic
https://iwate-u.repo.nii.ac.jp/records/9736
https://iwate-u.repo.nii.ac.jp/records/9736be4c491d-ff27-4680-b6f1-c391760bede8
名前 / ファイル | ライセンス | アクション |
---|---|---|
itfeccs-ve85-an6p1249-1256.pdf (815.0 kB)
|
|
Item type | 学術雑誌論文 / Journal Article(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2009-03-17 | |||||
タイトル | ||||||
タイトル | Analysis of the Convergence Condition of LMS Adaptive Digital Filter Using Distributed Arithmetic | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | distributed arithmetic | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | LMS algorithm | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | adaptive function space | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | convergence condition | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | offset bias | |||||
資源タイプ | ||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||
資源タイプ | journal article | |||||
著者 |
TAKAHASHI, Kyo
× TAKAHASHI, Kyo× TSUNEKAWA, Yoshitaka× TAYAMA, Norio× SEKI, Kyoushirou |
|||||
著者(機関) | ||||||
値 | Iwate Industrial Technology Junior College | |||||
著者(機関) | ||||||
値 | Faculty of Engineering, Iwate University | |||||
著者(機関) | ||||||
値 | Faculty of Engineering, Iwate University | |||||
著者(機関) | ||||||
値 | Faculty of Engineering, Iwate University | |||||
登録日 | ||||||
日付 | 2009-03-17 | |||||
書誌情報 |
IEICE transactions on fundamentals of electronics, communications and computer sciences 巻 E85-A, 号 6, p. 1249-1256, 発行日 2002-01-01 |
|||||
ISSN | ||||||
収録物識別子タイプ | ISSN | |||||
収録物識別子 | 0916-8508 | |||||
Abstract | ||||||
内容記述タイプ | Other | |||||
内容記述 | An LMS adaptive digital filter using distributed arithmetic (DA-ADF) 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) [3], [5], [10]. However, we indicated that a convergence speed of this DA adaptive algorithm degraded extremely by our computer simulations [6]. To overcome these problems, we have proposed the DA adaptive algorithm generalized with two's complement representation and effective architectures. Our DA-ADF has performances of a high speed, small output latency, a good convergence speed, small-scale 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 [8], [9]. From this analysis, we indicate that the convergence speed is depended on a distribution of eigenvalues of an auto-correlation matrix of an extended input signal vector [8], [9]. Furthermore, we obtain the eigenvalues theoretically. As a result, we clearly show that our DA-ADF has an advantage of the conventional DA-ADF in the convergence speed. | |||||
出版者 | ||||||
出版者 | 社団法人電子情報通信学会 | |||||
権利 | ||||||
権利情報 | copyright©2002 IEICE | |||||
著者版フラグ | ||||||
出版タイプ | VoR | |||||
出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 |