English
Related papers

Related papers: An ODMA-Based Unsourced Random Access Scheme with …

200 papers

Grant-free non-orthogonal multiple access (NOMA) is promising to achieve low latency massive access in Internet of Things (IoT) applications. In grant-free NOMA, pilot signals are often used for user activity detection (UAD) and channel…

Information Theory · Computer Science 2021-12-15 Yuanyuan Zhang , Zhengdao Yuan , Qinghua Guo , Zhongyong Wang , Jiangtao Xi , Yonghui Li

Sparse code multiple access (SCMA) is a promising multiplexing approach to achieve high system capacity. In this paper, we develop a novel iterative detection and decoding scheme for SCMA systems combined with Low-density Parity-check…

Information Theory · Computer Science 2015-08-05 Baicen Xiao , Kexin Xiao , Shutian Zhang , Zhiyong Chen , Bin Xia , Hui Liu

This paper considers a simple on-off random multiple access channel, where n users communicate simultaneously to a single receiver over m degrees of freedom. Each user transmits with probability lambda, where typically lambda n < m << n,…

Information Theory · Computer Science 2009-03-09 Alyson K. Fletcher , Sundeep Rangan , Vivek K Goyal

This article considers the massive MIMO unsourced random access problem on a quasi-static Rayleigh fading channel. Given a fixed message length and a prescribed number of channel uses, the objective is to construct a coding scheme that…

Information Theory · Computer Science 2022-03-09 Michail Gkagkos , Krishna R. Narayanan , Jean-Francois Chamberland , Costas N. Georghiades

This work considers the problem of integrated sensing and communications (ISAC) with a massive number of unsourced and uncoordinated users. In the proposed model, known as the unsourced ISAC system (UNISAC), all active communication and…

Information Theory · Computer Science 2026-04-21 Mohammad Javad Ahmadi , Rafael F. Schaefer , H. Vincent Poor

This paper studies randomly spread code-division multiple access (CDMA) and multiuser detection in the large-system limit using the replica method developed in statistical physics. Arbitrary input distributions and flat fading are…

Information Theory · Computer Science 2007-07-13 Dongning Guo , Sergio Verdu

In this paper, we discuss a non-orthogonal multiple access (NOMA) scheme to exploit a high diversity gain using repetition, namely repetition-based NOMA. Unlike conventional power-domain NOMA, all the users can have the same transmit power,…

Information Theory · Computer Science 2020-04-03 Jinho Choi

A multi-antenna broadcast channel scenario is considered where a base station delivers contents to cache-enabled user terminals. A joint design of coded caching (CC) and multigroup multicast beamforming is proposed to benefit from spatial…

Information Theory · Computer Science 2020-01-03 Antti Tölli , Seyed Pooya Shariatpanahi , Jarkko Kaleva , Babak Khalaj

This paper considers a random access system where each sender can be in two modes of operation, active or not active, and where the set of active users is available to a common receiver only. Active transmitters encode data into independent…

Information Theory · Computer Science 2016-11-18 Paolo Minero , Massimo Franceschetti , David N. C. Tse

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

We consider unsourced random access (uRA) in user-centric cell-free (CF) wireless networks, where random access users send codewords from a common codebook during specifically dedicated random access channel (RACH) slots. The system is…

Information Theory · Computer Science 2024-08-16 Eleni Gkiouzepi , Burak Çakmak , Manfred Opper , Giuseppe Caire

In this paper, a random access scheme is introduced which relies on the combination of packet erasure correcting codes and successive interference cancellation (SIC). The scheme is named coded slotted ALOHA. A bipartite graph representation…

Information Theory · Computer Science 2016-11-15 Enrico Paolini , Gianluigi Liva , Marco Chiani

Non-orthogonal multiple access (NOMA) has been proposed for massive connectivity in future generations of wireless communications. A dominant NOMA scheme is based on power optimization, in which decoding of target user is assumed to be…

Information Theory · Computer Science 2018-10-23 Kun Wang

This paper investigates the issue of cooperative activity detection for grant-free random access in the sixth-generation (6G) cell-free wireless networks with sourced and unsourced paradigms. First, we propose a cooperative framework for…

Information Theory · Computer Science 2020-11-23 Xiaodan Shao , Xiaoming Chen , Derrick Wing Kwan Ng , Caijun Zhong , Zhaoyang Zhang

In this paper, we design a novel two-phase unsourced random access (URA) scheme in massive multiple input multiple output (MIMO). In the first phase, we collect a sequence of information bits to jointly acquire the user channel state…

Information Theory · Computer Science 2023-06-28 Jia-Cheng Jiang , Hui-Ming Wang

We study a wireless-powered uplink communication system with non-orthogonal multiple access (NOMA), consisting of one base station and multiple energy harvesting users. More specifically, we focus on the individual data rate optimization…

Information Theory · Computer Science 2016-11-17 Panagiotis D. Diamantoulakis , Koralia N. Pappi , Zhiguo Ding , George K. Karagiannidis

The construction of preamble sequences for channel estimation by superposition of orthogonal pilots can improve performance of massive grant-free uplink from machine-type devices. In this letter, a technique is proposed to obtain full…

Information Theory · Computer Science 2023-12-25 Lorenzo Valentini , Elena Bernardi , Enrico Paolini

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

Non-orthogonal multiple access (NoMA) as an efficient way of radio resource sharing can root back to the network information theory. For generations of wireless communication systems design, orthogonal multiple access (OMA) schemes in time,…

This paper investigates the problem of resource allocation for joint communication and radar sensing system on rate-splitting multiple access (RSMA) based unmanned aerial vehicle (UAV) system. UAV simultaneously communicates with multiple…

Information Theory · Computer Science 2021-07-13 Yuwei Li , Wanli Ni , Hui Tian , Meihui Hua , Shaoshuai Fan