Wiener Filter Using the Conjugate Gradient Method and a Third-Order Tensor Decomposition

• Published in: Applied sciences 2024-03, Vol.14 (6), p.2430
• Main Authors: Benesty, Jacob, Paleologu, Constantin, Stanciu, Cristian-Lucian, Costea, Ruxandra-Liana, Dogariu, Laura-Maria, Ciochină, Silviu
• Format: Article
• Language: English
• Subjects: Accuracy; Algorithms; Approximation; conjugate gradient method; Decomposition; Estimates; Identification; Kronecker product; low-rank approximation; Methods; Noise control; system identification; tensor decomposition; Wiener filter
• ISSN: 2076-3417; 2076-3417
• DOI: 10.3390/app14062430

In linear system identification problems, the Wiener filter represents a popular tool and stands as an important benchmark. Nevertheless, it faces significant challenges when identifying long-length impulse responses. In order to address the related shortcomings, the solution presented in this paper is based on a third-order tensor decomposition technique, while the resulting sets of Wiener–Hopf equations are solved with the conjugate gradient (CG) method. Due to the decomposition-based approach, the number of coefficients (i.e., the parameter space of the filter) is greatly reduced, which results in operating with smaller data structures within the algorithm. As a result, improved robustness and accuracy can be achieved, especially in harsh scenarios (e.g., limited/incomplete sets of data and/or noisy conditions). Besides, the CG-based solution avoids matrix inversion operations, together with the related numerical and complexity issues. The simulation results are obtained in a network echo cancellation scenario and support the performance gain. In this context, the proposed iterative Wiener filter outperforms the conventional benchmark and also some previously developed counterparts that use matrix inversion or second-order tensor decompositions.