English
Related papers

Related papers: Transmission and Storage Rates for Sequential Mass…

200 papers

In Sequential Massive Random Access (SMRA), a set of correlated sources is jointly encoded and stored on a server, and clients want to access to only a subset of the sources. Since the number of simultaneous clients can be huge, the server…

Information Theory · Computer Science 2018-01-18 Elsa Dupraz , Thomas Maugey , Aline Roumy , Michel Kieffer

Massive machine-type communications (mMTC) demand robust solutions to support extensive connectivity efficiently. Unsourced random access (URA) has emerged as a promising approach, delivering high spectral and energy efficiency. Among URA…

Information Theory · Computer Science 2025-12-25 Liandong Hu , Jian Dang , Zaichen Zhang

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

This thesis deals with the problem of communicating and storing non-sequential data. We investigate this problem through the lens of lossless source coding, also sometimes referred to as lossless compression, from both an algorithmic and…

Information Theory · Computer Science 2024-11-25 Daniel Severo

Current wireless networks are designed to optimize spectral efficiency for human users, who typically require sustained connections for high-data-rate applications like file transfers and video streaming. However, these networks are…

Information Theory · Computer Science 2025-09-30 Kirill Andreev , Pavel Rybin , Alexey Frolov

Reliable transmission of arbitrarily correlated sources over multiple-access relay channels (MARCs) and multiple-access broadcast relay channels (MABRCs) is considered. In MARCs, only the destination is interested in a reconstruction of the…

Information Theory · Computer Science 2012-07-04 Yonathan Murin , Ron Dabora , Deniz Gündüz

Rateless Multiple Access (RMA) is a novel non-orthogonal multiple access framework that is promising for massive access in Internet of Things (IoT) due to its high efficiency and low complexity. In the framework, after certain…

Information Theory · Computer Science 2016-11-17 Zhaoyang Zhang , Xianbin Wang , Yu Zhang , Yan Chen

This article introduces a novel communication paradigm for the unsourced, uncoordinated Gaussian multiple access problem. The major components of the envisioned framework are as follows. The encoded bits of every message are partitioned…

Information Theory · Computer Science 2020-11-23 Asit Pradhan , Vamsi Amalladinne , Avinash Vem , Krishna R. Narayanan , Jean-Francois Chamberland

Sparse Code Multiple Access (SCMA) is a disruptive code-domain non-orthogonal multiple access (NOMA) scheme to enable \color{black}future massive machine-type communication networks. As an evolved variant of code division multiple access…

Signal Processing · Electrical Eng. & Systems 2022-05-17 Saumya Chaturvedi , Zilong Liu , Vivek Ashok Bohara , Anand Srivastava , Pei Xiao

Sparse Code Multiple Access (SCMA) is an enabling code-domain non-orthogonal multiple access (NOMA)scheme for massive connectivity and ultra low-latency in future machine-type communication networks. As an evolved variant of code division…

Information Theory · Computer Science 2021-05-17 Saumya Chaturvedi , Zilong Liu , Vivek Ashok Bohara , Anand Srivastava , Pei Xiao

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

We study reliable transmission of arbitrarily correlated sources over multiple-access relay channels (MARCs) and multiple-access broadcast relay channels (MABRCs). In MARCs only the destination is interested in reconstructing the sources,…

Information Theory · Computer Science 2016-11-17 Yonathan Murin , Ron Dabora , Deniz Gündüz

We propose a novel random multiple access (RMA) scheme with quality of service (QoS) guarantees for machine-to-machine (M2M) communications. We consider a slotted uncoordinated data transmission period during which machine type…

Information Theory · Computer Science 2016-10-25 Rana Abbas , Mahyar Shirvanimoghaddam , Yonghui Li , Branka Vucetic

A joint sparse-regression-code (SPARC) and low-density-parity-check (LDPC) coding scheme for multiple-input multiple-output (MIMO) massive unsourced random access (URA) is proposed in this paper. Different from the state-of-the-art…

Information Theory · Computer Science 2022-01-12 Tianya Li , Yongpeng Wu , Mengfan Zheng , Dongming Wang , Wenjun Zhang

We put forward a new algorithmic solution to the massive unsourced random access (URA) problem, by leveraging the rich spatial dimensionality offered by large-scale antenna arrays. This paper makes an observation that spatial signature is…

Information Theory · Computer Science 2020-09-16 Volodymyr Shyianov , Faouzi Bellili , Amine Mezghani , Ekram Hossain

This paper proposes, for the first time, a hybrid multiple access framework that integrates the principles of rate-splitting (RS) and sparse code multiple access (SCMA) in an SISO downlink scenario. The proposed scheme, termed RS-SCMA,…

Signal Processing · Electrical Eng. & Systems 2026-01-29 Minerva Priyadarsini , Zilong Liu , Kuntal Deka , Sujit Kumar Sahoo , Sanjeev Sharma

Unsourced random access (URA) is a recently proposed communication paradigm attuned to machine-driven data transfers. In the original URA formulation, all the active devices share the same number of bits per packet. The scenario where…

Information Theory · Computer Science 2021-02-16 Vamsi K. Amalladinne , Allen Hao , Stefano Rini , Jean-Francois Chamberland

Rate Splitting Multiple Access (RSMA) has recently emerged as a promising technique to enhance the transmission rate for multiple access networks. Unlike conventional multiple access schemes, RSMA requires splitting and transmitting…

Information Theory · Computer Science 2022-04-01 Nguyen Quang Hieu , Dinh Thai Hoang , Dusit Niyato , Diep N. Nguyen , Dong In Kim , Abbas Jamalipour

Rate Splitting Multiple Access (RSMA) is a code division multi-access technique which can achieve any base in the multi-access capacity polymatroid without high coding complexity or synchronization among the transmitting users. In this…

Information Theory · Computer Science 2016-08-15 Xiaomao Mao , Huifang Chen , Peiliang Qiu

The thesis is dedicated to studying methods to improve the efficiency of random access schemes and to facilitate their deployment in machine-type communications (MTC). First, a joint user activity identification and channel estimation…

Information Theory · Computer Science 2019-06-11 Zhuo Sun
‹ Prev 1 2 3 10 Next ›