MPMylene Pischella

Mylene Pischella

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Mylene Pischella has a total of 23 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Geodesic Stiefel-Manifold Interpolation for Limited-Feedback MIMO-OFDM Precoding

    by Juan Carlos O. Medeiros, Diego A. Sousa, Mylene Pischella, Didier Le Ruyet, Joao M. Cesar Mota

  • Performance Analysis of Uplink NOMA-Relevant Strategy Under Statistical Delay QoS Constraints

    by Mylene Pischella, Arsenia Chorti, Inbar Fijalkow

    A new multiple access (MA) strategy, referred to as non orthogonal multiple access -Relevant (NOMA-R), allows selecting NOMA when this increases all individual rates, i.e., it is beneficial for both strong(er) and weak(er) individual users. This letter provides a performance analysis of the NOMA-R strategy in uplink networks with statistical delay constraints. Closed-form expressions of the effective capacity (EC) are provided in two-users networks, showing that the strong user always achieves a higher EC with NOMA-R. Regarding the networks sum EC, there are distinctive gains with NOMA-R, particularly under stringent delay constraints.


  • Open Access

    Performance Analysis of Uplink NOMA-Relevant Strategy Under Statistical Delay QoS Constraints

    by Mylene Pischella, Arsenia Chorti, Inbar Fijalkow

    A new multiple access (MA) strategy, referred to as non orthogonal multiple access - Relevant (NOMA-R), allows selecting NOMA when this increases all individual rates, i.e., it is beneficial for both strong(er) and weak(er) individual users. This letter provides a performance analysis of the NOMA-R strategy in uplink networks with statistical delay constraints. Closed-form expressions of the effective capacity (EC) are provided in two-users networks, showing that the strong user always achieves a higher EC with NOMA-R. Regarding the network's sum EC, there are distinctive gains with NOMA-R, particularly under stringent delay constraints.

  • Open Access

    Performance Analysis of Uplink Adaptive NOMA Depending on Channel Knowledge

    by Mylene Pischella, Ivan Stupia, Luc Vandendorpe

    Non Orthogonal Multiple Access (NOMA) is a key technique to satisfy large users densities in future wireless networks. However, NOMA may provide poor performance compared to Orthogonal Multiple Access (OMA) due to inter-user interference. In this paper, we obtain closed-form expressions of the uplink NOMA and OMA throughputs when no Channel State Information at Transmitter (CSIT) is available, and of the average data rates assuming that instantaneous rates should be larger than a minimum threshold when full CSIT is available. Analytical comparisons of OMA and NOMA prove that there is no global dominant strategy valid in all situations. Based on this conclusion, we propose a new multiple-access (MA) strategy called NOMA-Adaptive (NOMA-A) that selects the best MA technique between OMA and NOMA. NOMA-A aims at maximizing the sum throughput in the no CSIT case, and the probability that both users are active in the full CSIT case. NOMA-A is shown to outperform the other strategies in terms of sum throughput and rate.

  • Open Access

    Energy Efficient Resource Allocation for Underlaying Multi-D2D Enabled Multiple-Antennas Communications

    by Berna Ozbek, Mylene Pischella, Didier Le Ruyet

    Energy efficiency has a significant importance to optimize the wireless communications systems by providing high data rates. In order to develop energy efficient systems, one of the promising method is to employ multiple device-to-device (D2D) underlaying multiple antenna cellular systems. The interference from cellular users to D2D pairs, the interference between D2D pairs and the interference at the base station (BS) caused by D2D pairs occur in these communications systems. In this paper, we propose energy efficient resource allocation algorithms for underlaying multi-D2D enabled multiple-antennas communications by employing different multiple antenna processing techniques at the BS. A joint method based on Dinkelbach algorithm and Message Passing Algorithm (MPA) and an approach based on deep learning with multi-layer artificial neural network are proposed to maximize the global energy efficiency (GEE) while satisfying the data rate requirements of both cellular users and D2D pairs. In MPA, the factor graph of the D2D pairs is constructed by taking into account the interference among the D2D pairs and the interference level at the BS to avoid any interruption in the cellular transmission. By relying on the training based on the proposed joint algorithm, a deep neural network approach is presented for off-line implementation. The performance results of the proposed energy efficient resource allocation algorithms are illustrated the superiority of multi-D2D communications over standard single-D2D communications.


  • Open Access

    Performance Evaluation of Low-Complexity Algorithms for Orthogonal Time-Frequency Space Modulation

    by Dayse Gonçalves Correia Bandeira, Didier Le Ruyet, Mylene Pischella, João Cesar Moura Mota

    Data transmission in wireless systems brings numerous challenges, especially when it involves propagating in a multipath scenario over rapidly time-varying channels. In this context, Orthogonal Time-Frequency Space (OTFS) modulation has been recently proposed to work with time-frequency selective channels with high Doppler. In this modulation, the symbols are first multiplexed in a delay-Doppler domain rather than in the time-frequency domain used by Orthogonal Frequency Division Multiplexing (OFDM). The studies point out advantages of OTFS performance over OFDM in many aspects, such as data rate increase in high mobility. Another advantage is the sparsity of the channel produced by OTFS that allows using low-complexity algorithms for the detection of the data. In this paper, the performance of OTFS modulation in a doubly dispersive channel is evaluated with several low-complexity variants of the message passing algorithm (MPA) in terms of complexity and Bit Error Rate (BER) performance. The results show that MPA and Approximate Message Passing simplified by Expectation Propagation (AMP-EP) algorithms achieve higher performance. However, when taking into account both complexity and BER performance, AMP simplified by First-Order (AMP-FO) achieves the best performance complexity tradeoff.


  • A Moment-Based Estimation Strategy for Underdetermined Single-Sensor Blind Source Separation

    by Stanley Smith, Mylene Pischella, Michel Terre

    We investigate the blind identification and separation of underdetermined linear instantaneous mixtures with a single sensor and an arbitrary known number of sources with finite known support and uniform distribution. We propose channel estimators based on the high-order statistics of the received signal and on the rotational symmetries of the source constellations. Explicit expressions for distinct and equal rotation orders are derived. The proposed estimators are used as initializers for the iterative least squares with enumeration algorithm to enhance its convergence properties. Simulation results on several high interference two-user wireless communication scenarios show that our initialization strategy achieves a substantial performance gain compared to other traditional initializers.


  • Open Access

    Resource Allocation with Successive Coding for OFDM-Based Cognitive System Subject to Statistical CSI

    by Marwa Chami, Mylene Pischella, Didier Le Ruyet

    This paper investigates the resource allocation problem for a multicarrier underlay cognitive radio system, under the assumption that only statistical Channel State Information (CSI) about the primary channels is available at the secondary user. More specifically, we maximize the system utility under primary and secondary user outage constraints and the total power constraint. The secondary user transmission is also constrained by the interference threshold imposed by the primary user. Moreover, the secondary receiver adapts its decoding strategy, which is either treating interference as noise or using successive interference cancellation or superposition coding. This leads to a nonconvex optimization problem, with either perfect or statistical CSI. Consequently, we propose a sequential-based algorithm to efficiently obtain a solution to the problem. The simulation results show that the sequential algorithm is convergent and that our global proposed scheme achieves larger secondary and sum rates than other algorithms where the decoding strategy is not adapted.

  • Outage-Constrained Resource Allocation for Asynchronous Cognitive Radio Networks With FBMC/OFDM

    by Juwendo Denis, Mylene Pischella, Didier Le Ruyet, Rostom Zakaria

    We consider the downlink resource allocation for a multi-carrier-based asynchronous cognitive radio network with statistical knowledge of the channel state information (CSI) of both primary and secondary systems available at the secondary base station. The problem of secondary utility maximization is investigated under primary and secondary user outage constraints and total power constraint. Analyses are provided for cases where both primary and secondary systems are utilizing either orthogonal frequency-division multiplexing (OFDM) or filter-bank based multi-carrier (FBMC) modulations. The highly complex yet challenging and non-convex joint power-subcarrier allocation problem is tackled by leveraging the principle of alternating optimization (AO) techniques. A per-carrier outagebased solution is provided for the subcarrier allocation stage. In the second stage, we introduce an upper bound to the outage constraints to ensure tractability. We propose an efficient convex approximation method to obtain near-optimal solutions of the centralized power control problem. Furthermore, to reduce computational complexity, a distributed implementation based on dual decomposition method is designed. Extensive simulation results are further provided to corroborate the validity of the theoretical findings and demonstrate the effectiveness of the proposed algorithms.