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

Recep Gül

dblp:220/3239 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
1since 2021 · last 2022
0000-0001-9942-9699ORCID · corroborated

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

Computer networks · 1Theory of computation · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

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.

Theoretical computer science
1 paper
Information theory · 75% Coding theory · 25%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › code construction
codebook design
0.612022
Canonical Conditions for K/2 Degrees of Freedom · IEEE Trans. Inf. Theory 2022
Information theory
degrees of freedom
0.612022
Canonical Conditions for K/2 Degrees of Freedom · IEEE Trans. Inf. Theory 2022
Information theory › network information theory › interference channel
interference alignment
0.612022
Canonical Conditions for K/2 Degrees of Freedom · IEEE Trans. Inf. Theory 2022
Information theory › network information theory
interference channel
0.612022
Canonical Conditions for K/2 Degrees of Freedom · IEEE Trans. Inf. Theory 2022
YearPublicationVenuePosition
2022 Canonical Conditions for K/2 Degrees of Freedom
abstract
We present a condition for 1/2 degree of freedom for each user in constant$K$-user single-antenna interference channels. This condition is sufficient for all and necessary for almost all channel matrices. Moreover, it applies to all channel topologies, i.e., to fully-connected channels as well as channels that have individual links absent, reflected by corresponding zeros in the channel matrix. Moreover, it captures the essence of interference alignment by virtue of being expressed in terms of a generic injectivity condition that guarantees separability of signal and interference. Finally, we provide codebook constructions achieving 1/2 degree of freedom for each user for all channel matrices satisfying the condition we identified.
Recep Gül, David Stotz, Syed Ali Jafar, Helmut Bölcskei, Shlomo Shamai
IEEE Trans. Inf. Theory1
2019 QoS-Constrained Semi-Persistent Scheduling of Machine-Type Communications in Cellular Networks
abstract
The dramatic growth of machine-to-machine (M2M) communication in cellular networks brings the challenge of satisfying the quality of service (QoS) requirements of a large number of M2M devices with limited radio resources. In this paper, we propose an optimization framework for the semi-persistent scheduling of M2M transmissions based on the exploitation of their periodicity with the goal of reducing the overhead of the signaling required for connection initiation and scheduling. The goal of the optimization problem is to minimize the number of frequency bands used by the M2M devices to allow fair resource allocation of newly joining M2M and human-to-human communications. The constraints of the problem are delay and periodicity requirements of the M2M devices. We first prove that the optimization problem is NP-hard and then propose a polynomial-time heuristic algorithm employing a fixed priority assignment according to the QoS characteristics of the devices. We show that this heuristic algorithm provides an asymptotic approximation ratio of 2.33 to the optimal solution for the case where the delay tolerances of the devices are equal to their periods. Through extensive simulations, we demonstrate that the proposed algorithm performs better than the existing algorithms in terms of frequency band usage and schedulability.
Goksu Karadag, Recep Gül, Yalcin Sadi, Sinem Coleri Ergen
IEEE Trans. Wirel. Commun.2
2018 Necessary Conditions for K/2 Degrees of Freedom
abstract
Stotz et al., 2016, reported a sufficient (injectivity) condition for each user in a$K$-user single-antenna constant interference channel to achieve 1/2 degree of freedom. The present paper proves that this condition is necessary as well and hence provides an equivalence characterization of interference channel matrices allowing full degrees of freedom.
Recep Gül, Helmut Bölcskei, Shlomo Shamai
ISIT1