Ghaya Rekaya

Prof. Dr. Ghaya Rekaya


Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
16 June 2020 in Entropy
Verified
Journal Article
Open access
PDF file
SGSamet Gelincik
Samet Gelincik
GRGhaya Rekaya
Ghaya Rekaya
This paper investigates the achievable per-user degrees-of-freedom (DoF) in multi-cloud based sectored hexagonal cellular networks (M-CRAN) at uplink. The network consists of N base stations (BS) and K ≤ N base band unit pools (BBUP), which function as independent cloud centers. The communication between BSs and BBUPs occurs by means of finite-capacity fronthaul links of capacities C F = μ F · 1 2 log ( 1 + P ) with P denoting transmit power. In the system model, BBUPs have limited processing capacity C BBU = μ BBU · 1 2 log ( 1 + P ) . We propose two different achievability schemes based on dividing the network into non-interfering parallelogram and hexagonal clusters, respectively. The minimum number of users in a cluster is determined by the ratio of BBUPs to BSs, r = K / N . Both of the parallelogram and hexagonal schemes are based on practically implementable beamforming and adapt the way of forming clusters to the sectorization of the cells. Proposed coding schemes improve the sum-rate over naive approaches that ignore cell sectorization, both at finite signal-to-noise ratio (SNR) and in the high-SNR limit. We derive a lower bound on per-user DoF which is a function of μ BBU , μ F , and r. We show that cut-set bound are attained for several cases, the achievability gap between lower and cut-set bounds decreases with the inverse of BBUP-BS ratio 1 r for μ F ≤ 2 M irrespective of μ BBU , and that per-user DoF achieved through hexagonal clustering can not exceed the per-user DoF of parallelogram clustering for any value of μ BBU and r as long as μ F ≤ 2 M . Since the achievability gap decreases with inverse of the BBUP-BS ratio for small and moderate fronthaul capacities, the cut-set bound is almost achieved even for small cluster sizes for this range of fronthaul capacities. For higher fronthaul capacities, the achievability gap is not always tight but decreases with processing capacity. However, the cut-set bound, e.g., at 5 M 6 , can be achieved with a moderate clustering size.

29 April 2025 in Annals of Telecommunications
Verified
Journal Article
Closed access
PDF file
HBHatem Boujemaa
Hatem Boujemaa
MAMusaed Alhussein
Musaed Alhussein
GRGhaya Rekaya
Ghaya Rekaya

25 July 2024 in Entropy
Verified
Journal Article
Open access
PDF file
AKAymen Ktari
Aymen Ktari
HGHadi Ghauch
Hadi Ghauch
GRGhaya Rekaya
Ghaya Rekaya
This paper proposes methods for Machine Learning (ML)-based Beam Alignment (BA), using low-complexity ML models, and achieves a small pilot overhead. We assume a single-user massive mmWave MIMO, Uplink, using a fully analog architecture. Assuming large-dimension codebooks of possible beam patterns at UE and BS, this data-driven and model-based approach aims to partially and blindly sound a small subset of beams from these codebooks. The proposed BA is blind (no CSI), based on Received Signal Energies (RSEs), and circumvents the need for exhaustively sounding all possible beams. A sub-sampled subset of beams is then used to train several ML models such as low-rank Matrix Factorization (MF), non-negative MF (NMF), and shallow Multi-Layer Perceptron (MLP). We provide an extensive mathematical description of these models and the algorithms for each of them. Our extensive numerical results show that, by sounding only 10% of the beams from the UE and BS codebooks, the proposed ML tools are able to accurately predict the non-sounded beams through multiple transmitted power regimes. This observation holds as the codebook sizes at UE and BS vary from 128×128 to 1024×1024.

2 May 2025 in arXiv
Verified
Preprint
Open access
PDF file
TCThomas Chêne
Thomas Chêne
OBOumaïma Bounhar
Oumaïma Bounhar
GRGhaya Rekaya
Ghaya Rekaya
ODOussama Damen
Oussama Damen
Reconfigurable Intelligent Surfaces (RIS) appear as a promising solution to combat wireless channel fading and interferences. However, the elements of the RIS need to be properly oriented to boost the data transmission rate. In this work, we propose a new strategy to adaptively configure the RIS without Channel State Information (CSI). Our goal is to minimize the number of RIS configurations to be tested to find the optimal one. We formulate the problem as a stochastic shortest path problem, and use Q-Learning to solve it.

6 December 2024 in Signal, Image and Video Processing
Verified
Journal Article
Closed access
PDF file
HBHatem Boujemaa
Hatem Boujemaa
MAMusaed Alhussein
Musaed Alhussein
GRGhaya Rekaya
Ghaya Rekaya

16 December 2024 in Signal, Image and Video Processing
Verified
Journal Article
Closed access
PDF file
HBHatem Boujemaa
Hatem Boujemaa
MAMusaed Alhussein
Musaed Alhussein
GRGhaya Rekaya
Ghaya Rekaya