An Extended Version of the Proportional Adaptive Algorithm Based on Kernel Methods for Channel Identification with Binary Measurements

Abstract

In recent years, kernel methods have provided an important alternative solution, as they offer a simple way of expanding linear algorithms to cover the non-linear mode as well. In this paper, we propose a novel recursive kernel approach allowing to identify the finite impulse response (FIR) in non-linear systems, with binary value output observations. This approach employs a kernel function to perform implicit data mapping. The transformation is performed by changing the basis of the data In a high-dimensional feature space in which the relations between the different variables become linearized. To assess the performance of the proposed approach, we have compared it with two other algorithms, such as proportionate normalized least-meansquare (PNLMS) and improved PNLMS (IPNLMS). For this purpose, we used three measurable frequency-selective fading radio channels, known as the broadband radio access Network (BRAN C, BRAN D, and BRAN E), which are standardized by the European Telecommunications Standards Institute (ETSI), and one theoretical frequency selective channel, known as the Macchi’s channel. Simulation results show that the proposed algorithm offers better results, even in high noise environments, and generates a lower mean square error (MSE) compared with PNLMS and IPNLMS.