적응 Lattice 필터의 수검특성 개선에 관한 연구

A Study on the Improvement of the convergence Properties of the Adaptive Lattice Filters

본 논문에서는 적응 lattice 필터에서 반사계교를 구하는 일반적인 알고리즘인 Burg 알고리즘의 수염구성을 해석하였으며, μ알고리즘을 Burg 알고리즘에 적용하여 Burg 알고리즘보다 수산동도가 더 큰 새로운 적응 lattice μ알고리즘을 얻었다. 특히 Burg 알고리즘의 수잡속도가 낮을 때 본 논장에서 조안한 적응 lattice 친알고리즘의 수검속도가 상대적으로 커짐을 컴퓨터 시뮬레이션을 통하여 확인하였다.

The convergence properties of Burg algorithm, which is commonly used to calculate the reflection coefficients in the adaptive lattice filters, are studied in this paper. Applying the $\mu$ algorithm to Burg algorithm, a new adaptive lattice $\mu$ algorithm is derived and it shows that the convergence speed of this algorithm is higher than that of Burg algorithm. As a result of theoretical analysis and computer simulation, it is proved that the con-vergence speed of the proposed algorithm is remarkably higher than that of Burg algorithm when the convergence speed of Burg alsorithm is low.