Elie Sfeir has a total of 3 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • A Random Fourier Feature Based Receiver Detection for Enhanced BER Performance in Nonlinear PD-NOMA

    by Elie Sfeir, Rangeet Mitra, Georges Kaddoum

    Non-orthogonal multiple access (NOMA) has been proposed as a potential enabler for massive connectivity. Among the different NOMA schemes, power-domain (PD-NOMA) is particularly appealing as it improves user fairness while enhancing spectral efficiency. However, the practical implementation of NOMA faces several challenges, including radio frequency impairments, such as power-amplifier (PA) nonlinearity, which can limit its performance. In this paper, we study the impact of PA nonlinearity on the detection performance of PD-NOMA, and propose a random Fourier feature (RFF) based solution to mitigate the effects of such imperfections. Computer simulations carried out assuming different PA nonlinearity types demonstrate that the proposed RFF based algorithm considerably improves the BER performance and achieves results that are close to the ideal case. Lastly, the analytical proof of our proposed algorithm's performance is provided to support our simulation results.


  • Open Access

    Comparative Analytical Study of SCMA Detection Methods for PA Nonlinearity Mitigation

    by Elie Sfeir, Rangeet Mitra, Georges Kaddoum, Vimal Bhatia

    Non-orthogonal multiple access (NOMA) has emerged as a promising technology that allows for multiplexing several users over limited time-frequency resources. Among existing NOMA methods, sparse code multiple access (SCMA) is especially attractive; not only for its coding gain using suitable codebook design methodologies, but also for the guarantee of optimal detection using message passing algorithm (MPA). Despite SCMA’s benefits, the bit error rate (BER) performance of SCMA systems is known to degrade due to nonlinear power amplifiers at the transmitter. To mitigate this degradation, two types of detectors have recently emerged, namely, the Bussgang-based approaches and the reproducing kernel Hilbert space (RKHS)-based approaches. This paper presents analytical results on the error-floor of the Bussgang-based MPA, and compares it with a universally optimal RKHS-based MPA using random Fourier features (RFF). Although the Bussgang-based MPA is computationally simpler, it attains a higher BER floor compared to its RKHS-based counterpart. This error floor and the BER’s performance gap are quantified analytically and validated via computer simulations.


  • Performance Analysis of Maximum-Correntropy Based Detection for SCMA

    by Elie Sfeir, Rangeet Mitra, Georges Kaddoum, Vimal Bhatia

    Non-orthogonal multiple access (NOMA) has emerged as a promising multiple-access technique capable of accommodating many users over limited time-frequency resources. Among several NOMA techniques, sparse code multiple access (SCMA) has emerged as viable due to its promise of high coding-gain by appropriate codebook-design and simplistic detection using message-passing algorithm (MPA). However, the performance of classic SCMA based systems are severely impaired by impulsive noise (IN), which causes outages and therefore non-negligible degradations to the bit-error-rate (BER) performance. Exploiting the robustness of the maximum correntropy criterion (MCC) to non-Gaussian noise processes, an MPA based detector is formulated with message-functions derived from the MCC criterion. Based on the said MCC criterion, concurrent-adaptation of the MCC’s spread-parameter is proposed in this paper. Lastly, analytical results for the proposed approach’s BER performance are presented with corresponding validation by computer-simulations.


  • RFF Based Detection for SCMA in Presence of PA Nonlinearity

    by Elie Sfeir, Rangeet Mitra, Georges Kaddoum, Vimal Bhatia

    The next-generation of communication systems must be capable of serving a significantly higher traffic generated by a large number of devices. To support massive connectivity over limited time-frequency resources, several non-orthogonal multiple access (NOMA) paradigms have emerged. In this context, sparse code multiple access (SCMA) based NOMA is particularly attractive due to its robustness to error-propagation, and its potentially high coding-gain with appropriate codebook design. However, the performance of SCMA based systems is severely degraded by distortions introduced by nonideal hardware, e.g. power-amplifier (PA) nonlinearity. To mitigate such artefacts, in this paper, a random Fourier feature (RFF) based hybrid message passing algorithm (MPA) is proposed, and validated through computer simulations. Lastly, an analytical proof is presented that indicates that the use of RFFs significantly improves the convergence of the MPA in the presence of impairments, and renders error-rate performance equivalent to that of a linear Gaussian channel under approximate MPA.