English
Related papers

Related papers: Rate Constrained Random Access over a Fading Chann…

200 papers

With the emergence of machine-driven communi- cation, there is a renewed interest in the design of random multiple access schemes for networks with large number of active devices. Many of the recently proposed access paradigms are…

Information Theory · Computer Science 2018-01-12 Arman Hasanzadeh , Jean-Francois Chamberland , Krishna Narayanan

We present and analyze a new robust feedback and transmit strategy for multiuser MIMO downlink communication systems, termed Rate Approximation (RA). RA combines the flexibility and robustness needed for reliable communications with the…

Information Theory · Computer Science 2013-01-10 Gerhard Wunder , Jan Schreck , Peter Jung

This paper considers an unlicensed multiple-access channel (MAC) that coexists with a licensed point-to-point user, following the underlay cognitive radio paradigm. We assume that every transceiver except the secondary base station has one…

Information Theory · Computer Science 2018-11-09 Christian Lameiro , Ignacio Santamaria , Peter J. Schreier

Given the critical dependence of broadcast channels by the accuracy of channel state information at the transmitter (CSIT), we develop a general downlink model with zero-forcing (ZF) precoding, applied in realistic heterogeneous cellular…

Information Theory · Computer Science 2017-06-19 Anastasios Papazafeiropoulos , Tharm Ratnarajah

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

Distributed network utility maximization (NUM) has received an increasing intensity of interest over the past few years. Distributed solutions (e.g., the primal-dual gradient method) have been intensively investigated under fading channels.…

Information Theory · Computer Science 2015-03-17 Junting Chen , Vincent K. N. Lau , Yong Cheng

This article investigates the performance of uplink rate splitting multiple access (RSMA) in a two-user scenario, addressing an under-explored domain compared to its downlink counterpart. With the increasing demand for uplink communication…

Signal Processing · Electrical Eng. & Systems 2026-04-21 Farjam Karim , Nurul Huda Mahmood , Arthur S. de Sena , Deepak Kumar , Bruno Clerckx , Matti Latva-aho

Non-orthogonal multiple access (NOMA) has been considered one of the most promising radio access techniques for next-generation cellular networks. In this paper, we study the joint user and power scheduling for downlink NOMA over fading…

Networking and Internet Architecture · Computer Science 2021-01-11 Do-Yup Kim , Hamid Jafarkhani , Jang-Won Lee

As shown by M\'edard, the capacity of fading channels with imperfect channel-state information (CSI) can be lower-bounded by assuming a Gaussian channel input $X$ with power $P$ and by upper-bounding the conditional entropy $h(X|Y,\hat{H})$…

Information Theory · Computer Science 2016-11-15 Adriano Pastore , Tobias Koch , Javier Rodríguez Fonollosa

In this paper, the performance of two-way relaying in mixed RF/FSO communication system with a backup RF link is investigated. Uplink RF channels are used to send data of $K$ users to a two-way relay, $R$, whereas FSO link is mainly used to…

Information Theory · Computer Science 2019-11-15 Mohammed A. Amer , Suhail Al-Dharrab

Wireless random access protocols are attracting a revived research interest as a simple yet effective solution for machine-type communications. In the quest to improve reliability and spectral efficiency of such schemes, the use of multiple…

Information Theory · Computer Science 2019-03-11 Andrea Munari , Federico Clazzer , Gianluigi Liva , Michael Heindlmaier

We consider downlink max-based scheduling in which the base station and each user are equipped with a single antenna. In each time slot, the base station obtains channel gains of all users and selects the user with the largest squared…

Information Theory · Computer Science 2016-08-15 Wiroonsak Santipach , Kritsada Mamat , Chalie Charoenlarpnopparut

Optimal resource allocation in wireless systems still stands as a rather challenging task due to the inherent statistical characteristics of channel fading. On the one hand, minimax/outage-optimal policies are often overconservative and…

Signal Processing · Electrical Eng. & Systems 2024-01-31 Gokberk Yaylali , Dionysios S. Kalogerias

We investigate the problem of message transmission and the problem of common randomness (CR) generation over single-user multiple-input multiple-output (MIMO) slow fading channels with average input power constraint, additive white Gaussian…

Information Theory · Computer Science 2022-10-24 Rami Ezzine , Moritz Wiese , Christian Deppe , Holger Boche

Recently, non-orthogonal multiple access (NOMA) has attracted considerable interest as one of the 5G-enabling techniques. However, users with better channel conditions in downlink communications intrinsically benefits from NOMA thanks to…

Information Theory · Computer Science 2018-02-23 Hong Xing , Yuanwei Liu , Arumugam Nallanathan , Zhiguo Ding , H. Vincent Poor

Ultra-Reliable Low-Latency Communications (URLLC) is a novel feature of 5G cellular systems. To satisfy strict URLLC requirements for uplink data transmission, the specifications of 5G systems introduce the grant-free channel access method.…

Networking and Internet Architecture · Computer Science 2024-02-27 Aleksei Shahsin , Andrey Belogaev , Artem Krasilov , Evgeny Khorov

We study coded multichannel random access schemes for ultra-reliable low-latency uplink transmissions. We concentrate on non-orthogonal access in the frequency domain, where users transmit over multiple orthogonal subchannels and inter-user…

Information Theory · Computer Science 2019-05-06 Christopher Boyd , Radosław Kotaba , Olav Tirkkonen , Petar Popovski

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-08-11 Alexander Fengler , Peter Jung , Giuseppe Caire

In uplink non-orthogonal multiple access (NOMA) channels, the existing cooperative successive interference cancellation (SIC) and power control (PC) schemes lack the capability of achieving the full capacity region, which restricts the…

Information Theory · Computer Science 2022-04-14 Hongwu Liu , Zhiquan Bai , Hongjiang Lei , Gaofeng Pan , Kyeong Jin Kim , Theodoros A. Tsiftsis

We consider the on-time transmissions of a sequence of packets over a fading channel.Different from traditional in-time communications, we investigate how many packets can be received $\delta$-on-time, meaning that the packet is received…

Information Theory · Computer Science 2022-02-18 Yan Li , Yunquan Dong , Byonghyo Shim