English
Related papers

Related papers: Modern Random Access for Satellite Communications

200 papers

We propose a contention-based random-access protocol, designed for wireless networks where the number of users is not a priori known. The protocol operates in rounds divided into equal-duration slots, performing at the same time estimation…

Information Theory · Computer Science 2012-10-03 Čedomir Stefanović , Kasper F. Trilingsgaard , Nuno K. Pratas , Petar Popovski

In this work, we investigate the performance of a dual-hop multiple relays system consisting of mixed Radio-Frequency (RF)/Free Space Optical (FSO) channels. The RF channels are subject to Rayleigh fading while the optical links experience…

Signal Processing · Electrical Eng. & Systems 2019-01-21 Elyes Balti , Brian K. Johnson

This work investigates covert communication in a rate-splitting multiple access (RSMA)-based multi-user multiple-input single-output system, where the random locations of the wardens follow a homogeneous Poisson point process. To…

Systems and Control · Electrical Eng. & Systems 2025-06-09 Xinyue Pei , Jihao Liu , Xuewen Luo , Xingwei Wang , Yingyang Chen , Miaowen Wen , Theodoros A. Tsiftsis

Dynamic spectrum access (DSA) is regarded as an effective and efficient technology to share radio spectrum among different networks. As a secondary user (SU), a DSA device will face two critical problems: avoiding causing harmful…

Machine Learning · Computer Science 2018-10-30 Hao-Hsuan Chang , Hao Song , Yang Yi , Jianzhong Zhang , Haibo He , Lingjia Liu

Rate-splitting multiple access (RSMA) has appeared as a powerful transmission and multiple access strategy for multi-user multi-antenna communications. Uniquely, this paper studies the optimization of the sum-rate of RSMA with imperfect…

Information Theory · Computer Science 2021-02-22 Jihye An , Onur Dizdar , Bruno Clerckx , Wonjae Shin

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

This paper studies the performance of a transmission and reception scheme for massive access under some practical challenges. One challenge is the near-far problem, i.e., an access point often receives signals from different transmitting…

Information Theory · Computer Science 2023-05-15 Lina Liu , Dongning Guo

In this work we treat the unsourced random access problem on a Rayleigh block-fading AWGN channel with multiple receive antennas. Specifically, we consider the slowly fading scenario where the coherence block-length is large compared to the…

Information Theory · Computer Science 2021-09-22 Alexander Fengler , Osman Musa , Peter Jung , Giuseppe Caire

Embedded real-time applications in communication systems require high processing power. Manual scheduling devel-oped for single-processor applications is not suited to multi-core architectures. The Algorithm Architecture Matching (AAM)…

Multimedia · Computer Science 2008-11-05 Maxime Pelcat , Slaheddine Aridhi , Jean François Nezan

Rate-Splitting Multiple Access (RSMA) for multi-user downlink operates by splitting the message for each user equipment (UE) into a private message and a set of common messages, which are simultaneously transmitted by means of superposition…

Signal Processing · Electrical Eng. & Systems 2022-03-09 Daesung Yu , Seok-Hwan Park , Osvaldo Simeone , Shlomo Shamai

Newer cellular communication generations are planned to allow asynchronous transmission of multiple numerologies (waveforms with different parameters) in adjacent bands, creating unavoidable adjacent channel interference. Most prior work on…

Signal Processing · Electrical Eng. & Systems 2020-03-03 Berker Peköz , Selçuk Köse , Hüseyin Arslan

Several studies assert that the random access procedure of the Long Term Evolution (LTE) cellular standard may not be effective whenever a massive number of simultaneous connection attempts are performed by terminals, as may happen in a…

Networking and Internet Architecture · Computer Science 2018-09-07 Michele Polese , Marco Centenaro , Andrea Zanella , Michele Zorzi

This paper investigates the massive random access for a huge amount of user devices served by a base station (BS) equipped with a massive number of antennas. We consider a grant-free unsourced random access (U-RA) scheme where all users…

Information Theory · Computer Science 2020-09-15 Xinyu Xie , Yongpeng Wu , Junyuan Gao , Wenjun Zhang

Non-fixed flexible antenna architectures, such as fluid antenna system (FAS), movable antenna (MA), and pinching antenna, have garnered significant interest in recent years. Among them, rotatable antenna (RA) has emerged as a promising…

This paper aims to realize a new multiple access technique based on recently proposed millimeter-wave reconfigurable antenna architectures. To this end, first we show that integration of the existing reconfigurable antenna systems with the…

Information Theory · Computer Science 2018-03-28 Mojtaba Ahmadi Almasi , Hani Mehrpouyan , David Matolak , Cunhua Pan , Maged Elkashlan

Future machine to machine (M2M) communications need to support a massive number of devices communicating with each other with little or no human intervention. Random access techniques were originally proposed to enable M2M multiple access,…

Information Theory · Computer Science 2016-11-15 Mahyar Shirvanimoghaddam , Yonghui Li , Mischa Dohler , Branka Vucetic

Rotatable antenna (RA) provides additional spatial degrees of freedom (DoFs) for communication systems by enabling per-antenna dynamic boresight adjustment, which is attractive for fairness-oriented multicast transmission. This letter…

Information Theory · Computer Science 2026-03-30 Weihua Zhu , Beixiong Zheng , Lipeng Zhu , Jie Tang , Yong Zeng

In this paper, we consider uplink transmissions involving multiple users communicating with a base station over a fading channel. We assume that the base station does not coordinate the transmissions of the users and hence the users employ…

Computer Science and Game Theory · Computer Science 2009-08-25 Nitin Salodkar , Abhay Karandikar

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

In this paper a Time Division Multiple Access (TDMA) based Random Access (RA) channel with Successive Interference Cancellation (SIC) is considered for a finite user population and reliable retransmission mechanism on the basis of…

Information Theory · Computer Science 2016-11-18 Christian Kissling
‹ Prev 1 8 9 10 Next ›