Frequency-Domain RLS Algorithm Based on the Block Processing Technique

블록 프로세싱 기법을 이용한 주파수 영역에서의 회귀 최소 자승 알고리듬

  • 박부견 (포항공과대학교 전자컴퓨터공학부) ;
  • 김동규 (포항공과대학교 전자컴퓨터공학부) ;
  • 박원석 ((주)한화/정보통신 이동통신기기 연구소)
  • Published : 2000.10.01

Abstract

This paper presents two algorithms based on the concept of the frequency domain adaptive filter(FDAF). First the frequency domain recursive least squares(FRLS) algorithm with the overlap-save filtering technique is introduced. This minimizes the sum of exponentially weighted square errors in the frequency domain. To eliminate discrepancies between the linear convolution and the circular convolution, the overlap-save method is utilized. Second, the sliding method of data blocks is studied Co overcome processing delays and complexity roads of the FRLS algorithm. The size of the extended data block is twice as long as the filter tap length. It is possible to slide the data block variously by the adjustable hopping index. By selecting the hopping index appropriately, we can take a trade-off between the convergence rate and the computational complexity. When the input signal is highly correlated and the length of the target FIR filter is huge, the FRLS algorithm based on the block processing technique has good performances in the convergence rate and the computational complexity.

Keywords