activity
20242026
collaborators

6 papers

cs.IT2026

Minimum Energy per Bit of Unsourced Multiple Access with Location-Based Codebook Partitioning

Deekshith Pathayappilly Krishnan, Kaan Okumus, Khac-Hoang Ngo +1

We derive finite-blocklength bounds on the minimum achievable energy per bit over a Gaussian unsourced multiple access (UMA) channel in the presence of heterogeneous path-loss cond…

cs.IT2026

Type-Based Unsourced Multiple Access Over Fading Channels in Distributed MIMO With Application to Multi-Target Localization

Kaan Okumus, Khac-Hoang Ngo, Giuseppe Durisi +2

We consider the problem of type estimation over unsourced multiple access fading channels in distributed multiple-input multiple-output (D-MIMO) systems. Unlike classical unsourced…

cs.IT2026

Type-Based Unsourced Federated Learning With Client Self-Selection

Kaan Okumus, Khac-Hoang Ngo, Unnikrishnan Kunnath Ganesan +3

We address the client-selection problem in federated learning over wireless networks under data heterogeneity. Existing client-selection methods often rely on server-side knowledge…

cs.IT2025

Type-Based Unsourced Multiple Access over Fading Channels with Cell-Free Massive MIMO

Kaan Okumus, Khac-Hoang Ngo, Giuseppe Durisi +1

Type-based unsourced multiple access (TUMA) is a recently proposed framework for type-based estimation in massive uncoordinated access networks. We extend the existing design of TU…

cs.IT2025

An Achievability Bound for Type-Based Unsourced Multiple Access

Deekshith Pathayappilly Krishnan, Kaan Okumus, Khac-Hoang Ngo +1

We derive an achievability bound to quantify the performance of a type-based unsourced multiple access system -- an information-theoretic model for grant-free multiple access with…

cs.IT2024

Type-Based Unsourced Multiple Access

Khac-Hoang Ngo, Deekshith Pathayappilly Krishnan, Kaan Okumus +2

We generalize the type-based multiple access framework proposed by Mergen and Tong (2006) to the case of unsourced multiple access. In the proposed framework, each device tracks th…