| Summary: | In linear system identification problems, it is important to reveal and exploit any specific intrinsic characteristic of the impulse responses, in order to improve the overall performance, especially in terms of the accuracy and complexity of the solution. In this paper, we focus on the nearest Kronecker product decomposition of the impulse responses, together with low-rank approximations. Such an approach is suitable for the identification of a wide range of real-world systems. Most importantly, we reformulate the system identification problem by using a particular symmetric filter within the development, which allows us to efficiently design two (iterative/recursive) algorithms. First, an iterative Wiener filter is proposed, with improved performance as compared to the conventional Wiener filter, especially in challenging conditions (e.g., small amount of available data and/or noisy environments). Second, an even more practical solution is developed, in the form of a recursive least-squares adaptive algorithm, which could represent an appealing choice in real-time applications. Overall, based on the proposed approach, a system identification problem that can be conventionally solved by using a system of <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>L</mi><mo>=</mo><msub><mi>L</mi><mn>1</mn></msub><msub><mi>L</mi><mn>2</mn></msub></mrow></semantics></math></inline-formula> equations (with <i>L</i> unknown parameters) is reformulated as a combination of two systems of <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>P</mi><msub><mi>L</mi><mn>1</mn></msub></mrow></semantics></math></inline-formula> and <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>P</mi><msub><mi>L</mi><mn>2</mn></msub></mrow></semantics></math></inline-formula> equations, respectively, where usually <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>P</mi><mo>≪</mo><msub><mi>L</mi><mn>2</mn></msub></mrow></semantics></math></inline-formula> (i.e., a total of <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>P</mi><msub><mi>L</mi><mn>1</mn></msub><mo>+</mo><mi>P</mi><msub><mi>L</mi><mn>2</mn></msub></mrow></semantics></math></inline-formula> parameters). This could lead to important advantages, in terms of both performance and complexity. Simulation results are provided in the framework of network and acoustic echo cancellation, supporting the performance gain and the practical features of the proposed algorithms.
|
|---|