SearcharxivSearch

arXiv subjects

Tugce Kobal

Publications and source records attributed to Tugce Kobal.

2 recordsLinked to original sources

Weighted Sum Rate Maximization for ITS-Aided Arrays in Multi-User MIMO

This work explores the potential of integrating an Intelligent Transmissive Surface (ITS) into an antenna array to improve beamforming performance. We show that integrating a moderate number of passive refractive elements into a small antenna array can significantly improve the Weighted Sum Rate (WSR). We investigate the optimization of the WSR under two distinct operational constraints: a Radiated Power (RP) constraint and a Transmitted Power (TP) constraint. Our analysis reveals that the choice between these constraints significantly impacts the design parameters of the ITS-aided array. By contrasting these approaches, we explore critical design and material parameters, including the array geometry, surface loss, and illumination strategies.

eess.SP

Learning-Based Multiuser Scheduling in MIMO-OFDM Systems with Hybrid Beamforming

We investigate the multiuser scheduling problem in multiple-input multiple-output (MIMO) systems using orthogonal frequency division multiplexing (OFDM) and hybrid beamforming in which a base station (BS) communicates with multiple users over millimeter wave (mmWave) channels in the downlink. Improved scheduling is critical for enhancing spectral efficiency and the long-term performance of the system from the perspective of proportional fairness (PF) metric in hybrid beamforming systems due to its limited multiplexing gain. Our objective is to maximize PF by properly designing the analog and digital precoders within the hybrid beamforming and selecting the users subject to the number of radio frequency (RF) chains. Leveraging the characteristics of mmWave channels, we apply a two-timescale protocol. On a long timescale, we assign an analog beam to each user. Scheduling the users and designing the digital precoder are done accordingly on a short timescale. To conduct scheduling, we propose combinatorial solutions, such as greedy and sorting algorithms, followed by a machine learning (ML) approach. Our numerical results highlight the trade-off between the performance and complexity of the proposed approaches. Consequently, we show that the choice of approach depends on the specific criteria within a given scenario.

cs.IT