Channel Identification Based on Cumulants, Binary Measurements, and Kernels

• Main Authors: Hicham Oualla, Rachid Fateh, Anouar Darif, Said Safi, Mathieu Pouliquen, Miloud Frikel
• Format: Article
• Language: English
• Published: MDPI AG 2021-06-01
• Series: Systems
• Subjects: channel identification; binary measurement; higher-order cumulants; reproducing kernel; broadband radio access network (BRAN)
• Online Access: https://www.mdpi.com/2079-8954/9/2/46

In this paper, we discuss the problem of channel identification by using eight algorithms. The first three algorithms are based on higher-order cumulants, the next three algorithms are based on binary output measurement, and the last two algorithms are based on reproducing kernels. The principal objective of this paper is to study the performance of the presented algorithms in different situations, such as with different sizes of the data input or different signal-to-noise ratios. The presented algorithms are applied to the estimation of the channel parameters of the broadband radio access network (BRAN). The simulation results confirm that the presented algorithms are able to estimate the channel parameters with different accuracies, and each algorithm has its advantages and disadvantages for a given situation, such as for a given <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>S</mi><mi>N</mi><mi>R</mi></mrow></semantics></math></inline-formula> and data input. Finally, this study provides an idea of which algorithms can be selected in a given situation. The study presented in this paper demonstrates that the cumulant-based algorithms are more adequate if the data inputs are not available (blind identification), but the kernel- and binary-measurement-based methods are more adequate if the noise is not important (<inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>S</mi><mi>N</mi><mi>R</mi><mo>≥</mo><mn>16</mn></mrow></semantics></math></inline-formula> dB).