Studies on the Convergence Speed of Over-Sampled Subband Adaptive Digital Filters(Special Section on Digital Signal Processing)
スポンサーリンク
概要
- 論文の詳細を見る
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 tapinput 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.
- 社団法人電子情報通信学会の論文
- 2000-08-25
著者
-
Ohno Shuichi
The Department Of Mathematics And Computer Science Shimane University
-
Sakai Hideaki
The Department Of Systems Science Graduate School Of Informatics Kyoto University
-
Sakai Hideaki
The Department Of Internal Medicine National Nishitaga Hospital
関連論文
- Blind Identification of Multichannel Systems by Exploiting Prior Knowledge of the Channel (Special Section on Digital Signal Processing)
- Studies on the Convergence Speed of Over-Sampled Subband Adaptive Digital Filters(Special Section on Digital Signal Processing)
- The Asymptotic Equipartition Property in Reinforcement Learning and its Relation to Return Maximization
- On the Effects of Domain Size and Complexity in Empirical Distribution of Reinforcement Learning(Artificial Intelligence and Cognitive Science)
- Progressive Multifocal Leukoencephalopathy in a Patient with Acquired Immunodeficiency Syndrome (AIDS) Manifesting Gerstmann's Syndrome