DOI QR코드

DOI QR Code

기울기 평균 벡터를 사용한 가변 스텝 최소 자승 알고리즘과 시변 망각 인자를 사용한 시변 음향 채널 추정

An time-varying acoustic channel estimation using least squares algorithm with an average gradient vector based a self-adjusted step size and variable forgetting factor

  • 임준석 (세종대학교 전자정보통신공학과)
  • Lim, Jun-Seok (Department of Electrical Engineering, Sejong University)
  • 투고 : 2019.03.08
  • 심사 : 2019.04.15
  • 발행 : 2019.05.31

초록

RLS(Recursive-least-squares) 알고리즘은 수렴성이 좋고, 수렴 후 오차 수준도 우수한 것으로 알려져 있다. 그러나 알고리즘 내에 역행렬 계산이 포함되어 수치적 불안정성을 나타내는 단점도 있다. 본 논문에서는 언급한 불안정성을 회피하기 위해서 역행렬이 없지만 수렴성이 유사한 알고리즘을 제안한다. 이를 위해서 기울기 평균 벡터를 사용한 가변 스텝 최소 자승 알고리즘을 사용한다. 또 시변 채널 추정에 우수한 성능을 내기 위해서 계산량이 적은 가변 망각인자를 도입한다. 시뮬레이션을 통해서 기존 RLS와의 성능을 비교하고 그 유사성을 보인다. 또 시변 채널에서 가변 망각인자의 우수성도 보인다.

RLS (Recursive-least-squares) algorithm is known to have good convergence and excellent error level after convergence. However, there is a disadvantage that numerical instability is included in the algorithm due to inverse matrix calculation. In this paper, we propose an algorithm with no matrix inversion to avoid the instability aforementioned. The proposed algorithm still keeps the same convergence performance. In the proposed algorithm, we adopt an averaged gradient-based step size as a self-adjusted step size. In addition, a variable forgetting factor is introduced to provide superior performance for time-varying channel estimation. Through simulations, we compare performance with conventional RLS and show its equivalency. It also shows the merit of the variable forgetting factor in time-varying channels.

키워드

GOHHBH_2019_v38n3_283_f0001.png 이미지

Fig. 1. A structure of adaptive filtering system.

GOHHBH_2019_v38n3_283_f0002.png 이미지

Fig. 2. Convergence performance comparison in the time invariant channel (a) mean square error comparison (-○-: RLS, -△-: proposed algorithm with fixed forgetting factor, -◇-: proposed algorithm with variable forgetting factor method 1, -×-: proposed algorithm with variable forgetting factor method 2) (b) comparison between two variable forgetting factor methods.

GOHHBH_2019_v38n3_283_f0003.png 이미지

Fig. 3. Convergence performance comparison in the time invariant channel (a) mean square error comparison (-○-: RLS, -△-: proposed algorithm with fixed forgetting factor, -◇-: proposed algorithm with variable forgetting factor method 1, -×-: proposed algorithm with variable forgetting factor method 2) (b) comparison between two variable forgetting factor methods.

Table 1. Summary of the proposed algorithm.

GOHHBH_2019_v38n3_283_t0001.png 이미지

참고문헌

  1. A. H. Sayed, Adaptive Filters (IEEE Press, Wiley-Interscience, New York, 2008), Chap. 12.
  2. J. Lim and Y. Pyeon, "Kernel RLS algorithm using variable forgetting factor" (in Korean), J-KICS, 40, 1793-1801 (2015). https://doi.org/10.7840/kics.2015.40.9.1793
  3. M. Choi and S. Lee, "Comparison study of channel estimation algorithm for 4S maritime communications" (in Korean), J-KICS, 38, 288-293 (2013).
  4. P. S. R. Diniz, Adaptive Filtering Algorithms and Practical Implementation, 3rd Ed. (Springer, LLC, NY, 2008), Chap. 5.
  5. B. Xi and Y. Liu, "Iterative wiener filter," IEEE Electronics Letters, 49, 343-344 (2013). https://doi.org/10.1049/el.2013.0009
  6. M. S. Ahmad, O. Kukrera, and A. Hocanin, "Recursive inverse adaptive filtering algorithm," Digital Signal Processing, 21, 491-496 (2011). https://doi.org/10.1016/j.dsp.2011.03.001
  7. T. R. Gwadabe, M. S. Salman, and H. Abuhilal, "A comparison study between recursive inverse and iterative wiener filter algorithms," Proc. EEECEGC 2013, 101-106 (2013).
  8. V. Malenovsky, Z. Smekal, and I. Koula, "Optimal step-size LMS algorithm using exponentially averaged gradient vector," Proc. EUROCON 2005, 1554-1557 (2005).
  9. D. J. Park, "Fast tracking RLS algrithm using novel variable forgetting factor with unity zone," Electronics Letters, 27, 2150-2151 (1991). https://doi.org/10.1049/el:19911331
  10. S. W. Lee, J. S. Lim, S. J. Baek, and K. M. Sung, "Time-varying signal frequency estimation by VFF Kalman filtering," Signal Processing, 77, 343-347 (1999). https://doi.org/10.1016/S0165-1684(99)00085-7