Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yassine Mouchtak

dblp:186/8818 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
1since 2021 · last 2022
0000-0001-8967-6039ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 2 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Physical-layer communications · 100%
Theoretical computer science
1 paper
Coding theory · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Physical-layer communications
fading channels
0.412019
Tight Analytical and Asymptotic Upper Bound for the BER and FER of Linear Codes Over Exponentially Correlated Generalized-Fading Channels · IEEE Trans. Commun. 2019
Physical-layer communications › fading channels › fading models
generalized fading channel
0.412019
Tight Analytical and Asymptotic Upper Bound for the BER and FER of Linear Codes Over Exponentially Correlated Generalized-Fading Channels · IEEE Trans. Commun. 2019
Coding theory › error-correcting codes › error probability analysis
bit error probability bounds
0.412019
Tight Analytical and Asymptotic Upper Bound for the BER and FER of Linear Codes Over Exponentially Correlated Generalized-Fading Channels · IEEE Trans. Commun. 2019
Coding theory › error-correcting codes
error probability analysis
0.412019
Tight Analytical and Asymptotic Upper Bound for the BER and FER of Linear Codes Over Exponentially Correlated Generalized-Fading Channels · IEEE Trans. Commun. 2019

Methods — techniques the papers use, named apart from their topics

pairwise error probability · 0.8maximum-likelihood decoding · 0.8
YearPublicationVenuePosition
2022 Performance Analysis of I/Q Imbalance With Hardware Impairments Over Hyper Fox's H-Fading Channels
abstract
Impairments baseband model in-phase and quadrature-phase Imbalance (IQI) and Residual hardware impairments (RHI) are two key factors degrading the performance of wireless communication systems (WCSs), particularly when high-frequency bands are employed, as in 5G systems and beyond. The impact of either IQI or RHI on the performance of various WCSs has been investigated exclusively in a separate way. To fill this gap, in this paper, the joint effect of both IQI and RHI on the performance of a WCS subject to Hyper Fox’s H-fading (HFHF) channel, is investigated. Such a fading model generalizes most, if not all, of well-known fading and turbulence models. To this end, closed-form expressions for the outage probability (OP), Average channel capacity (ACC) under constant power with optimum rate adaptation (ORA) policy, and average symbol error probability (ASEP) for both coherent and non-coherent modulation schemes are derived. Specifically, all the analytical expressions are derived for three different scenarios: (i) ideal Tx and Rx impaired, (ii) Tx impaired and ideal Rx, and (iii) both Tx and Rx are impaired. Further, asymptotic expressions for OP, ACC under ORA policy, and ASEP are obtained, based on which, insightful discussions on the IQI and RHI impacts are made.$\alpha -\mu $and Málaga$\mathcal {M}$turbulence with pointing error distribution models have been considered as particular cases of the HFHF distribution. The analytical derivations, endorsed by simulation results, demonstrate that the RF impairments’ effects should be seriously taken into account in the design of next-generation wireless technologies.
Yassine Mouchtak, Faissal El Bouanani, Khalid A. Qaraqe
IEEE Trans. Wirel. Commun.1
2019 Tight Analytical and Asymptotic Upper Bound for the BER and FER of Linear Codes Over Exponentially Correlated Generalized-Fading Channels
abstract
In this paper, the upper bound and asymptotical approximation for the bit error rate (BER) as well as for the frame error rate of linear block codes under maximum-likelihood decoding operating over exponentially correlated (EC) generalized-fading channels are proposed. Particularly, our analysis takes the convolutional codes as an example and three different fading scenarios are considered, namely Rice, Nakagami-m, and Weibull fading. Such scenarios have a common property that is spherically invariant random process (SIRP). Our analysis relies on the derivation of new lower bounds per each eigenvalue since the BER as well as the FER expressions are written in terms of the pairwise error probability, which by its turn depends on the eigenvalues of the channel covariance matrix. Based on that, the upper bounds and asymptotic expressions of the considered metrics subject to the three above fading models are derived, which show to be tighter than the previous results published elsewhere in the literature, especially for the high signal-to-noise ratio regions.
Yassine Mouchtak, Faissal El Bouanani, Daniel B. da Costa 0001
IEEE Trans. Commun.1
2018 A Tighter Upper Bound for the BER of Convolutional Codes Over Exponentially Correlated Nakagami-m Fading
abstract
In this paper, a tighter upper bound for the bit error rate (BER) of convolutional codes operating under exponentially correlated Nakagami- m fading is proposed. Our analysis relies on the derivation of new lower bounds per each eigenvalue since the BER expression is written in terms of the pairwise error probability, which by its turn depends on the eigenvalues of the channel covariance matrix. In comparison to previous results published elsewhere in the literature, the proposed bounds are shown to be tighter, specially for high signal-to-noise ratio regions, being therefore of great importance and usefulness for the forthcoming researches in the field. Moreover, this result can be generalized to all linear block codes as well as other fading models as the proposed eigenvalues' upperbounds are the main key of this work.
Yassine Mouchtak, Faissal El Bouanani, Daniel B. da Costa 0001
PIMRC1
2016 New tighter upper bounds on the performance of convolutional code over exponentially correlated Rayleigh fading channel
abstract
This paper presents tighter bounds on the pairwise error-event probability and therefore very tighter upper bounds of bit error rate(BER) for communication systems employing convolutional code over Rayleigh fading channel with exponential correlation coefficient. To obtain our bound, we start by proposing a closed form upper bound for Gaussian Q-function and as well as deriving a new lower bound of each channel covariance matrix eigenvalue. The simulation results show that our proposed bound is tighter than those previously developed, especially when the covariance parameter q increases. A gain of over 6.5dB was achieved for q = 0.95 at BER=10-5from the better previous bound, whereas for the lower values of q we reach the simulated curve.
Yassine Mouchtak, Faissal El Bouanani
IWCMC1