Efficient recursive least-squares algorithms for the identification of bilinear forms

Due to its fast convergence rate, the recursive least-squares (RLS) algorithm is very popular in many applications of adaptive filtering, including system identification scenarios. However, the computational complexity of this algorithm represents a major limitation in applications that involve long filters. Moreover, when the parameter space becomes large, the system identification problem is more challenging and the adaptive filters should be able to cope with this aspect. In this paper, we focus on the identification of bilinear forms, where the bilinear term is defined with respect to the impulse responses of a spatiotemporal model. From this perspective, the solution requires a multidimensional adaptive filtering technique. Recently, the RLS algorithm tailored for bilinear forms (namely RLS-BF) was developed for this purpose. In this framework, the contribution of this paper is mainly twofold. First, in order to reduce the computational complexity of the RLS-BF algorithm, two versions based on the dichotomous coordinate descent (DCD) method are proposed; due to its arithmetic features, the DCD algorithm represents one of the most attractive alternatives to solve the normal equations. However, in the bilinear context, we need to consider the particular structure of the input data and the additional related challenges. Second, in order to improve the robustness of the RLS-BF algorithm in noisy environments, a regularized version is developed, together with a method to find the regularization parameters, which are related to the signal-to-noise ratio (SNR). Furthermore, using a proper estimation of the SNR, a variable-regularized RLS-BF algorithm is designed and two DCD-based low-complexity versions are proposed. Due to their nature, these variable-regularized algorithms have good robustness features against additive noise, which make them behave well in different noisy condition scenarios. Simulation results indicate the good performance of the proposed low-complexity RLS-BF algorithms, with appealing features for practical implementations. (C) 2018 Elsevier Inc. All rights reserved.