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.
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.
Copy
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
Copy
@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},}
Copy
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 -