English
Related papers

Related papers: Coded Pilot Access: A Random Access Solution for M…

200 papers

Massive multiple-input multiple-output (MIMO) technology facilitates huge increases in the capacity of wireless channels, while non-orthogonal multiple access (NOMA) addresses the problem of limited resources in traditional orthogonal…

Information Theory · Computer Science 2020-07-15 Lucinda Hadley , Ioannis Chatzigeorgiou

A common approach to obtain channel state information for massive MIMO networks is to use the same orthogonal training sequences in each cell. We call this the full-pilot reuse (FPR) scheme. In this paper, we study an alternative approach…

Information Theory · Computer Science 2017-09-12 Rusdha Muharar , Jamie Evans

Grant-free massive access is an important technique for supporting massive machine-type communications (mMTC) for Internet-of-Things (IoT). Two important features in grant-free massive access are low-complexity devices and short-packet data…

Information Theory · Computer Science 2019-09-23 Gang Chen , Ying Cui , Hei Victor Cheng , Feng Yang , Lianghui Ding

This letter studies a time-slotted multiple-access system with a primary user (PU) and a secondary user (SU) sharing the same channel resource. We propose a novel secondary access protocol which alleviates sensing errors and detects the…

Networking and Internet Architecture · Computer Science 2016-11-01 Ahmed El Shafie

Slotted ALOHA (SA) algorithms with Successive Interference Cancellation (SIC) decoding have received significant attention lately due to their ability to dramatically increase the throughput of traditional SA. Motivated by increased density…

Information Theory · Computer Science 2017-06-30 Aleksandar Mastilovic , Dejan Vukobratovic , Dusan Jakovetic , Dragana Bajovic

This paper introduces a random multiple access method for satellite communications, named Network Coding-based Slotted Aloha (NCSA). The goal is to improve diversity of data bursts on a slotted-ALOHA-like channel thanks to error correcting…

Information Theory · Computer Science 2010-09-27 Huyen Chi Bui , Jerome Lacan , Marie-Laure Boucheret

This paper investigates the performance of Multiple-input multiple-output non-orthogonal multiple access (MIMO-NOMA) systems with randomly deployed users, where the randomly deployed NOMA users follow Poisson point process (PPP), the…

Information Theory · Computer Science 2022-09-29 Zheng Shi , Guanghua Yang , Yaru Fu , Hong Wang , Shaodan Ma

This paper is a tutorial introduction to the field of unsourced multiple access (UMAC) protocols. We first provide a historical survey of the evolution of random access protocols, focusing specifically on the case in which uncoordinated…

Information Theory · Computer Science 2024-08-20 Gianluigi Liva , Yury Polyanskiy

In this work, we introduce the pattern-domain pilot design paradigm based on a "superposition of orthogonal-building-blocks" with significantly larger contention space to enhance the massive machine-type communications (mMTC) random access…

Information Theory · Computer Science 2025-10-28 Xiaoming Dai , Tiantian Yan , Qianqian Li , Hua Li , Xiyuan Wang

This paper considers the application of multiple-input multiple-output (MIMO) techniques to non-orthogonal multiple access (NOMA) systems. A new design of precoding and detection matrices for MIMO-NOMA is proposed and its performance is…

Information Theory · Computer Science 2015-03-19 Zhiguo Ding , Fumiyuki Adachi , H. Vincent Poor

Multiple access is the base for increasing the capacity in multi-user communication networks. However, the growing demand for higher data rates and the number of users who requires communication services has led to the scarcity of…

Information Theory · Computer Science 2023-03-14 Victor Monzon Baeza

Data aggregation is a promising approach to enable massive machine-type communication (mMTC). This paper focuses on the aggregation phase where a massive number of machine-type devices (MTDs) transmit to aggregators. By using non-orthogonal…

Information Theory · Computer Science 2018-04-25 Onel L. Alcaraz López , Hirley Alves , Pedro Nardelli , Matti Latva-aho

The advent of Machine-to-Machine communication has sparked a new wave of interest to random access protocols, especially in application to LTE Random Access (RA). By analogy with classical slotted ALOHA, state-of-the-art models LTE RA as a…

Information Theory · Computer Science 2018-12-19 Mikhail Vilgelm , Sergio Rueda Linares , Wolfgang Kellerer

Leveraging recent progress in physical-layer network coding we propose a new approach to random access: When packets collide, it is possible to recover a linear combination of the packets at the receiver. Over many rounds of transmission,…

Information Theory · Computer Science 2012-12-27 Jasper Goseling , Michael Gastpar , Jos H. Weber

Recently, non-orthogonal codes have been advocated for IoT massive access. Activity detection has been demonstrated to entail common support recovery in a jointly sparse multiple measurement vector (MMV) problem and MMV algorithms have been…

Signal Processing · Electrical Eng. & Systems 2019-08-06 Mohammad Naseri Tehrani , Shahrokh Farahmand

Intelligent terminals often produce a large number of data packets of small lengths. For these packets, it is inefficient to follow the conventional medium access control (MAC) protocols because they lead to poor utilization of service…

Information Theory · Computer Science 2016-11-18 Ronggui Xie , Huarui Yin , Zhengdao Wang , Xiaohui Chen

Modern mobile terminals often produce a large number of small data packets. For these packets, it is inefficient to follow the conventional medium access control protocols because of poor utilization of service resources. We propose a novel…

Information Theory · Computer Science 2014-09-05 Ronggui Xie , Huarui Yin , Xiaohui Chen , Zhengdao Wang

Next-generation internet-of-things (IoT) networks require extremely low latency, complexity, and collision probability. We introduce the novel partial-information multiple access (PIMA) scheme, a semi-grant-free (GF) coordinated random…

Information Theory · Computer Science 2023-07-28 Alberto Rech , Stefano Tomasin , Lorenzo Vangelista , Cristina Costa

Modern random access protocols are emerging as an efficient yet simple solution for arising internet of things (IoT) applications in upcoming beyond-5G systems. In this context, both terrestrial and non-terrestrial scenarios can benefit…

Information Theory · Computer Science 2019-06-06 Andrea Munari , Federico Clazzer

In this paper, we study grant-free random access with massive multiple input multiple output (MIMO) systems. We first show that the performance of massive MIMO based grant-free random access is mainly decided by the probability of preamble…

Information Theory · Computer Science 2020-10-27 Jinho Choi
‹ Prev 1 3 4 5 6 7 10 Next ›