Miloud Frikel

Miloud Frikel

Auto-generated profile, based on publicly available information

Miloud Frikel

Normandie Univ, UNICAEN, ENSICAEN, LIS, Caen, France

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
18 June 2021 in Systems
Verified
Journal Article
Open access
PDF file
HOHicham Oualla
Hicham Oualla
RFRachid FATEH
Rachid FATEH
ADAnouar Darif
Anouar Darif
SSSaid SAFI
Said SAFI
Mathieu PouliquenMathieu Pouliquen
Mathieu Pouliquen
MFMiloud Frikel
Miloud Frikel
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 SNR 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 (SNR≥16 dB).

1 January 2013 in IFAC Proceedings Volumes
Verified
Journal Article
Closed access
PDF file
SSSaid SAFI
Said SAFI
MFM. Frikel
M. Frikel
MPM. Pouliquen
M. Pouliquen
IBI. Badi
I. Badi
YKY. Khmou
Y. Khmou
MBM. Boutalline
M. Boutalline


29 June 2023 in Journal of Telecommunications and Information Technology
Verified
Journal Article
Open access
PDF file
RFRachid FATEH
Rachid FATEH
ADAnouar Darif
Anouar Darif
ABAhmed BOUMEZZOUGH
Ahmed BOUMEZZOUGH
SSSaid SAFI
Said SAFI
MFMiloud Frikel
Miloud Frikel
Over the last few years, kernel adaptive filters have gained in importance as the kernel trick started to be used in classic linear adaptive filters in order to address various regression and time-series prediction issues in nonlinear environments.In this paper, we study a recursive method for identifying finite impulse response (FIR) nonlinear systems based on binary-value observation systems. We also apply the kernel trick to the recursive projection (RP) algorithm, yielding a novel recursive algorithm based on a positive definite kernel. For purposes, our approach is compared with the recursive projection (RP) algorithm in the process of identifying the parameters of two channels, with the first of them being a frequency-selective fading channel, called a broadband radio access network (BRAN B) channel, and the other being a a theoretical frequency-selective channel, known as the Macchi channel. Monte Carlo simulation results are presented to show the performance of the proposed algorithm.

31 May 2024 in International Journal of Speech Technology
Verified
Journal Article
Closed access
PDF file
AOAbdelkbir Ouisaadane
Abdelkbir Ouisaadane
SSSaid SAFI
Said SAFI
MFMiloud Frikel
Miloud Frikel

17 May 2022
Verified
Conference Paper
Closed access
HOHicham Oualla
Hicham Oualla
Mathieu PouliquenMathieu Pouliquen
Mathieu Pouliquen
MFMiloud Frikel
Miloud Frikel
SSSaid SAFI
Said SAFI
AMAli Mestrah
Ali Mestrah
In this paper we propose a first identification algorithm of system operating in closed-loop based on binary measurements both on the input and the output. The proposed approach in the paper is based on the estimation of the correlation function of the input and output from binary data. Some simulation results are then given in order to illustrate the performance of the proposed algorithm.