English
Related papers

Related papers: Multi-Class Unsourced Random Access via Coded Demi…

200 papers

The performance of grant-free random access (GF-RA) is limited by the number of accessible random access resources (RRs) due to the absence of collision resolution. Compressive sensing (CS)-based RA schemes scale up the RRs at the expense…

Information Theory · Computer Science 2021-03-23 Ameha Tsegaye Abebe , Chung G. Kang

In this paper, we propose a compressive random access (CRA) scheme using multiple resource blocks (RBs) to support massive connections for machine type communications (MTC). The proposed CRA scheme is scalable. As a result, if the number of…

Information Theory · Computer Science 2019-02-28 Jinho Choi

In this work, we address the issue of quality of experience (QoE) in unmanned aerial vehicle (UAV) aided multiuser rate-splitting multiple access (RSMA) networks under secrecy constraints. The problem is formulated as maximization of sum…

Networking and Internet Architecture · Computer Science 2024-05-24 Abuzar B. M. Adam , Xiaoyu Wan , Mohammed Saleh Ali Muthanna

It is a challenging task to design a random access protocol that achieves the optimal throughput in multi-cell random access with decentralized transmission due to the difficulty of coordination. In this paper, we present a decentralized…

Information Theory · Computer Science 2020-06-16 Huifa Lin , Kwang Soon Kim , Won-Yong Shin

Adder MAC is a simple noiseless multiple-access channel (MAC), where if users send messages $X_1,\ldots,X_h\in \{0,1\}^n$, then the receiver receives $Y = X_1+\cdots+X_h$ with addition over $\mathbb{Z}$. Communication over the noiseless…

Information Theory · Computer Science 2018-09-21 Yuzhou Gu

Exponential error bounds achievable by universal coding and decoding are derived for frame-asynchronous discrete memoryless %asynchronous multiple access channels with two senders, via the method of subtypes, a refinement of the method of…

Information Theory · Computer Science 2020-02-04 Lóránt Farkas , Tamás Kói

This paper studies the distributed optimization problem over directed networks with noisy information-sharing. To resolve the imperfect communication issue over directed networks, a series of noise-robust variants of Push-Pull/AB method…

Optimization and Control · Mathematics 2023-07-28 Shengchao Zhao , Siyuan Song , Yongchao Liu

We consider the detection of correlated information sources in the ubiquitous Code-Division Multiple-Access (CDMA) scheme. We propose a message-passing based scheme for detecting correlated sources directly, with no need for source coding.…

Information Theory · Computer Science 2010-03-24 Hadar Efraim , Nadav Yacov , Ori Shental , Ido Kanter

We consider unsourced random access with MIMO receiver - a crucial communication scenario for future 5G/6G wireless networks. We perform a projection-based decoder analysis and derive energy efficiency achievability bounds when channel…

Information Theory · Computer Science 2023-03-28 Kirill Andreev , Daria Ustinova , Alexey Frolov

The recent prevalence of deep neural networks has lead semantic segmentation networks to achieve human-level performance in the medical field when sufficient training data is provided. Such networks however fail to generalize when tasked…

Computer Vision and Pattern Recognition · Computer Science 2023-08-01 Serban Stan , Mohammad Rostami

Despite advances in language and speech technologies, no open-source system enables full speech-to-speech, multi-turn dialogue with integrated tool use and agentic reasoning. We introduce AURA (Agent for Understanding, Reasoning, and…

Artificial Intelligence · Computer Science 2025-07-01 Leander Melroy Maben , Gayathri Ganesh Lakshmy , Srijith Radhakrishnan , Siddhant Arora , Shinji Watanabe

In this letter, we extend the sparse Kronecker-product (SKP) coding scheme, originally designed for the additive white Gaussian noise (AWGN) channel, to multiple input multiple output (MIMO) unsourced random access (URA). With the SKP…

Signal Processing · Electrical Eng. & Systems 2022-08-16 Zeyu Han , Xiaojun Yuan , Chongbin Xu , Xin Wang

The massive amounts of machine-type user equipments (UEs) will be supported in the future fifth generation (5G) networks. However, the potential large random access (RA) delay calls for a new RA scheme and for a detailed assessment of its…

Information Theory · Computer Science 2017-05-04 Yanan Liang , Xu Li , Jiayi Zhang , Zhiguo Ding

We propose an irregular repetition slotted ALOHA (IRSA) based random-access protocol for the binary adder channel (BAC). The BAC captures important physical-layer concepts, such as packet generation, per-slot decoding, and information rate,…

Information Theory · Computer Science 2023-02-24 Khac-Hoang Ngo , Alexandre Graell i Amat , Giuseppe Durisi

Merging or routing low-rank adapters (LoRAs) has emerged as a popular solution for enhancing large language models, particularly when data access is restricted by regulatory or domain-specific constraints. This position paper argues that…

Computation and Language · Computer Science 2025-06-17 Mei-Yen Chen , Thi Thu Uyen Hoang , Michael Hahn , M. Saquib Sarfraz

We introduce a new model of spatial random multiple access systems with a non-standard departure policy: all arriving messages are distributed uniformly on a finite sphere in the space, and when a successful transmission of a single message…

Networking and Internet Architecture · Computer Science 2017-08-29 Sergey Foss , Andrey Turlikov , Maxim Grankin

The use of massive multiple-input multiple-output (MIMO) to serve a crowd of user equipments (UEs) is challenged by the deficit of pilots. Assuming that the UEs are intermittently active, this problem can be addressed by a shared access to…

Signal Processing · Electrical Eng. & Systems 2020-01-14 José Carlos Marinello , Taufik Abrão , Richard Demo Souza , Elisabeth de Carvalho , Petar Popovski

This paper considers the problem of distributed source coding for a large network. A major obstacle that poses an existential threat to practical deployment of conventional approaches to distributed coding is the exponential growth of the…

Information Theory · Computer Science 2013-01-08 Kumar Viswanatha , Sharadh Ramaswamy , Ankur Saxena , Emrah Akyol , Kenneth Rose

In the upcoming 6G era, multiple access (MA) will play an essential role in achieving high throughput performances required in a wide range of wireless applications. Since MA and interference management are closely related issues, the…

Irregular repetition slotted Aloha (IRSA) has shown significant advantages as a modern technique for uncoordinated random access with massive number of users due to its capability of achieving theoretically a throughput of $1$ packet per…

Information Theory · Computer Science 2023-12-12 Manuel Fernández-Veiga , M. E. Sousa-Vieira , Ana Fernández-Vilas , Rebeca P Díaz-Redondo