Linear System Identification Based on a Kronecker Product Decomposition

被引:88
作者
Paleologu, Constantin [1 ]
Benesty, Jacob [2 ]
Ciochina, Silviu [1 ]
机构
[1] Univ Politehn Bucuresti, Bucharest 060042, Romania
[2] Univ Quebec, INRS EMT, Montreal, PQ H5A 1K6, Canada
关键词
System identification; impulse response decomposition; nearest Kronecker product; Wiener filter; iterative algorithm; echo cancellation; AFFINE PROJECTION ALGORITHM; COORDINATE DESCENT ITERATIONS; ECHO CANCELLATION; BILINEAR-FORMS; ADAPTATION; TENSORS;
D O I
10.1109/TASLP.2018.2842146
中图分类号
O42 [声学];
学科分类号
070206 ; 082403 ;
摘要
Linear system identification is a key problem in many important applications, among which echo cancelation is a very challenging one. Due to the long length impulse responses (i.e., echo paths) to he identified, there is always room (and needs) to improve the performance of the echo cancelers, especially in terms of complexity, convergence rate, robustness, and accuracy. In this paper, we propose a new way to address the system identification problem (from the echo cancelation perspective), by exploiting an optimal approximation of the impulse response based on the nearest Kroneeker product decomposition. Also, we make a first step toward this direction, by developing an iterative Wiener filter based on this approach. As compared to the conventional Wiener filter, the proposed solution is much more attractive since its gain is twofold. First, the matrices to be inverted (or, preferably, linear systems to be solved) are smaller as compared to the conventional approach. Second, as a consequence, the iterative Wiener filter leads to a good estimate of the impulse response, even when a small amount of data is available for the estimation of the statistics. Simulation results support the theoretical findings and indicate the good results of the proposed approach, for the identification of different network and acoustic impulse responses.
引用
收藏
页码:1793 / 1808
页数:16
相关论文
共 50 条
[21]   Impedance Spectroscopy Based on Linear System Identification [J].
Ivanisevic, Nikola ;
Rodriguez, Saul ;
Rusu, Ana .
IEEE TRANSACTIONS ON BIOMEDICAL CIRCUITS AND SYSTEMS, 2019, 13 (02) :396-402
[22]   Kronecker Product-Based Space-Time Block Codes [J].
Fazal-E-Asim ;
De Almeida, Andre L. F. ;
Antreich, Felix ;
Haardt, Martin ;
Cavalcante, Charles C. .
IEEE WIRELESS COMMUNICATIONS LETTERS, 2022, 11 (02) :386-390
[23]   Nonparametric identification of Kronecker networks [J].
Zorzi, Mattia .
AUTOMATICA, 2022, 145
[24]   Sound Zone Control Based on a Kronecker Second-Order Tensor Decomposition [J].
Mao, Zhien ;
Zhang, Wen .
MAN-MACHINE SPEECH COMMUNICATION, NCMMSC 2024, 2025, 2312 :153-167
[25]   Non-linear model-order reduction based on tensor decomposition and matrix product [J].
Li, Zhen ;
Jiang, Yaolin ;
Xu, Kangli .
IET CONTROL THEORY AND APPLICATIONS, 2018, 12 (16) :2253-2262
[26]   Robust SAR STAP via Kronecker Decomposition [J].
Greenewald, Kristjan ;
Zelnio, Edmund ;
Hero, Alfred, III .
IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS, 2016, 52 (06) :2612-2625
[27]   Direct and Parallel QR Based Subspace Decomposition Methods for System Identification [J].
Raza, Syed A. ;
Tayem, Nizar .
2014 INTERNATIONAL CONFERENCE ON INDUSTRIAL AUTOMATION, INFORMATION AND COMMUNICATIONS TECHNOLOGY (IAICT), 2014, :46-51
[28]   The Information-State Based Approach to Linear System Identification [J].
Mohamed, Naveed Gul Mohamed ;
Goyal, Raman ;
Chakravorty, Suman ;
Wang, Ran .
2023 AMERICAN CONTROL CONFERENCE, ACC, 2023, :301-306
[29]   Hierarchical Kronecker tensor-product approximations [J].
Hackbusch, W. ;
Khoromskij, B.N. ;
Tyrtyshnikov, E.E. .
Journal of Numerical Mathematics, 2005, 13 (02) :119-156
[30]   A compact neuromorphic architecture with dynamic multiplexing to efficiently compute a nearest Kronecker product decomposition based RLS-NLMS algorithm for active noise control headphones [J].
Vazquez, Angel ;
Garcia, Luis ;
Toscano, Karina ;
Sanchez, Juan -Carlos ;
Duchen, Gonzalo ;
Perez, Hector ;
Avalos, Juan -Gerardo ;
Sanchez, Giovanny .
NEUROCOMPUTING, 2022, 503 :1-16