Earticle

초록

영어

We extend the use of the least squares method to develop a recursive algorithm for the design of adaptive transversal filters such that, given the least-square estimate of a vector of a filter at iteration, we may compute the updated estimate of this vector at iteration upon the arrival of new data. In this paper, we propose a new tap-weight-updated RLS algorithm for an adaptive transversal filter with data-recycling buffer structure. We prove that the convergence speed of the learning curve of an RLS algorithm with a data-recycling buffer is faster than existing RLS algorithms at mean square error versus iteration number. Also, the resulting rate of convergence is typically an order of magnitude faster than the simple LMS algorithm. We show that the number of desired samples should be increased to converge the specified value from the three-dimensional simulation results of mean square error according to the degree of channel amplitude distortion and data-recycle buffer number. This improvement of the convergence performance is achieved at B times the convergence speed of the mean square error increase in the data recycle buffer number with new proposed RLS algorithm.

목차

Abstract
 1. Introduction
 2. Recycling Buffer RLS Algorithm
 3. Proposed Data Recycling Filter Structure
 4. Tap weight updating algorithm with data recycling RLS algorithm
 5. Computer Simulation Results and Analysis
 6. Conclusion
 Acknowledgements
 References

키워드

저자

• Gwang Jun Kim [ Department of Computer Engineering, Chonnam National University ]
• Chang Soo Jang [ Department of Computer Engineering, Chonnam National University ]
• Chan Ho Yoon [ Department of Computer Engineering, Chonnam National University ]
• Seung Jin Jang [ Department of Computer Engineering, Chonnam National University ]
• Jin Woo Lee [ Department of Computer Engineering, Chonnam National University ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Software Engineering and Its Applications

• 간기

  월간

• pISSN

  1738-9984

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605