Summary
|
For Full-Text 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. |
|
Convergence Performance Analyses of Fast Data-Reusing Normalized Least Mean Squared Algorithm Heng-Chou CHEN Oscal T.-C. CHEN Publication IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Vol.E90-A No.1 pp.249-256 Publication Date: 2007/01/01 Online ISSN: 1745-1337 DOI: 10.1093/ietfec/e90-a.1.249 Print ISSN: 0916-8508 Type of Manuscript: PAPER Category: Digital Signal Processing Keyword: LMS, NLMS, data-reusing LMS, data-reusing NLMS, fast data-reusing NLMS, Full Text: PDF(397.9KB)>>
Summary: As hardware platforms increase in computation capability, multiple filter coefficient adaptations between two neighboring input signals can be realized to achieve a high convergence rate. This study explores the data-reusing scheme based on the Normalized Least Mean Squared (NLMS) algorithm. Moreover, the impacts of the reusing times and input signal vector's variance to the convergence rate and misadjustment of an adaptive filter are theoretically derived and analyzed. A large number of reusing times was found to raise the convergence rate but also increase misadjustament, while a high variance of an input vector was found to lower misadjustment and expedite the convergence rate. To reduce computational complexity of the data-reusing scheme, this study develops the Fast Data-Reusing NLMS (FDRNLMS) algorithm. The proposed FDRNLMS requires minimal computation for the adaptation scaling factor, and only requires two more multiplication operations than NLMS in calculating each filter output. Additionally, the computation complexity of this FDRNLMS is independent of the number of reusing times. Therefore, the FDRNLMS proposed herein is superior to the NLMS and Least Mean Squared (LMS) algorithms using conventional data-reusing schemes which have computation complexity proportional to the number of reusing times. | ||||||||||
| ||||||||||
