The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
적응형 디지털 필터(ADF)와 LMS(최소 평균 제곱) 알고리즘의 수렴 속도를 평가하거나 비교하기 위해 탭 입력 벡터의 상관 행렬의 조건수가 사용되는 경우가 많습니다. 그러나 본 논문에서는 기존의 풀밴드 ADF와 서브밴드 ADF의 조건수에 따른 비교는 유효하지 않음을 보여준다. 어떤 경우에는 오버샘플링된 부분대역 ADF가 전대역 ADF보다 빠르게 수렴하지만 전자의 조건수가 더 큽니다. 위의 현상을 설명하기 위해 서브밴드 ADF의 수렴 거동에 대한 표현과 시뮬레이션 결과가 제공됩니다.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Shuichi OHNO, "Studies on the Convergence Speed of Over-Sampled Subband Adaptive Digital Filters" in IEICE TRANSACTIONS on Fundamentals,
vol. E83-A, no. 8, pp. 1531-1538, August 2000, doi: .
Abstract: To evaluate or compare the convergence speed of adaptive digital filters (ADF) with least mean squared (LMS) algorithm, the condition numbers of correlation matrices of tap-input vectors are often used. In this paper, however, the comparison of the conventional fullband ADF and the subband ADF based on their condition numbers is shown to be invalid. In some cases, the over-sampled subband ADF converges faster than the fullband ADF, although the former has larger condition numbers. To explain the above phenomenon, an expression for the convergence behavior of the subband ADF and simulation results are provided.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e83-a_8_1531/_p
부
@ARTICLE{e83-a_8_1531,
author={Shuichi OHNO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Studies on the Convergence Speed of Over-Sampled Subband Adaptive Digital Filters},
year={2000},
volume={E83-A},
number={8},
pages={1531-1538},
abstract={To evaluate or compare the convergence speed of adaptive digital filters (ADF) with least mean squared (LMS) algorithm, the condition numbers of correlation matrices of tap-input vectors are often used. In this paper, however, the comparison of the conventional fullband ADF and the subband ADF based on their condition numbers is shown to be invalid. In some cases, the over-sampled subband ADF converges faster than the fullband ADF, although the former has larger condition numbers. To explain the above phenomenon, an expression for the convergence behavior of the subband ADF and simulation results are provided.},
keywords={},
doi={},
ISSN={},
month={August},}
부
TY - JOUR
TI - Studies on the Convergence Speed of Over-Sampled Subband Adaptive Digital Filters
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1531
EP - 1538
AU - Shuichi OHNO
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E83-A
IS - 8
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - August 2000
AB - To evaluate or compare the convergence speed of adaptive digital filters (ADF) with least mean squared (LMS) algorithm, the condition numbers of correlation matrices of tap-input vectors are often used. In this paper, however, the comparison of the conventional fullband ADF and the subband ADF based on their condition numbers is shown to be invalid. In some cases, the over-sampled subband ADF converges faster than the fullband ADF, although the former has larger condition numbers. To explain the above phenomenon, an expression for the convergence behavior of the subband ADF and simulation results are provided.
ER -