English
Related papers

Related papers: Improved bounds for the many-user MAC

200 papers

The recent development of the massive multiple-input multiple-output (MIMO) paradigm, has been extensively based on the pursuit of favorable propagation: in the asymptotic limit, the channel vectors become nearly orthogonal and inter-user…

Information Theory · Computer Science 2015-03-03 Christos Masouros , Michail Matthaiou

The capacity-achieving input distribution of the discrete-time, additive white Gaussian noise (AWGN) channel with an amplitude constraint is discrete and seems difficult to characterize explicitly. A dual capacity expression is used to…

Information Theory · Computer Science 2015-11-30 Andrew Thangaraj , Gerhard Kramer , Georg Bocherer

Motivated by the recent interest in approximate message passing (AMP) for matrix-valued linear observations with superposition of \emph{multiple statistically asymmetric signal sources}, we introduce a multi-source AMP framework in which…

Information Theory · Computer Science 2025-01-22 Burak Çakmak , Giuseppe Caire

Low latency and reliable information transfer are highly demanded in fifth generation (5G) and beyond 5G wireless communications. A novel delay-bounded wireless media access control (MAC) protocol called Carrier Sense Multiple Access with…

Networking and Internet Architecture · Computer Science 2022-11-14 Haruaki Tanaka , Yusuke Yamasaki , Satoshi Yasuda , Nobuyasu Shiga , Kenichi Takizawa , Nicolas Chauvet , Ryoichi Horisaki , Makoto Naruse

Bit-interleaved coded modulation (BICM) is a practical approach for reliable communication over the AWGN channel in the bandwidth limited regime. For a signal point constellation with 2^m points, BICM labels the signal points with bit…

Information Theory · Computer Science 2012-06-04 Georg Böcherer , Fabian Altenbach , Alex Alvarado , Steven Corroy , Rudolf Mathar

Large language models improve with scale, yet feedback-based alignment still exhibits systematic deviations from intended behavior. Motivated by bounded rationality in economics and cognitive science, we view judgment as resource-limited…

Machine Learning · Computer Science 2025-09-22 Wenjun Cao

The performance of integer-forcing equalization for communication over the compound multiple-input multipleoutput channel is investigated. An upper bound on the resulting outage probability as a function of the gap to capacity has been…

Information Theory · Computer Science 2017-12-05 Elad Domanovitz , Uri Erez

The recently released IEEE 802.15.6 standard specifies several physical (PHY) layers and medium access control (MAC) layer protocols for variety of medical and non-medical applications of Wireless Body Area Networks (WBAN). The medical…

Networking and Internet Architecture · Computer Science 2022-09-02 Md. Abubakar Siddik , Most. Anju Ara Hasi , Jakia Akter Nitu , Sumonto Sarker , Nasrin Sultana , Emarn Ali

As one of the core technologies for 5G systems, massive multiple-input multiple-output (MIMO) introduces dramatic capacity improvements along with very high beamforming and spatial multiplexing gains. When developing efficient physical…

Information Theory · Computer Science 2023-11-01 Hengtao He , Xianghao Yu , Jun Zhang , Shenghui Song , Khaled B. Letaief

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

This paper studies the scalability of a wireless backhaul network modeled as a random extended network with multi-antenna base stations (BSs), where the number of antennas per BS is allowed to scale as a function of the network size. The…

Information Theory · Computer Science 2014-06-12 Harpreet S. Dhillon , Giuseppe Caire

This paper studies the capacity of massive random-access cellular networks, modeled as a MIMO fading channel with an infinite number of interfering cells. To characterize the symmetric sum rate of the network, a random-coding argument is…

Information Theory · Computer Science 2025-09-26 Grace Villacrés , Tobias Koch , Gonzalo Vazquez-Vilar

Given a set of wireless links, a fundamental problem is to find the largest subset that can transmit simultaneously, within the SINR model of interference. Significant progress on this problem has been made in recent years. In this note, we…

Data Structures and Algorithms · Computer Science 2012-03-15 Magnus M. Halldorsson , Pradipta Mitra

Feasibility of using unlicensed spectrum for ultra reliable low latency communications (URLLC) is still a question for beyond 5G wireless networks. Low latency access to the channel and efficiently sharing spectrum among the multiple users…

Information Theory · Computer Science 2022-06-15 Irshad A. Meer , Woong-Hee Lee , Mustafa Ozger , Cicek Cavdar , Ki Won Sung

Many communication applications incorporate event-triggered behavior, where the conventional Shannon capacity may not effectively gauge performance. Consequently, we advocate for the concept of identification capacity as a more suitable…

Information Theory · Computer Science 2025-02-04 Ilya Vorobyev , Christian Deppe , Holger Boche

The densification of Wi-Fi deployments means that fully distributed random channel access is no longer sufficient for high and predictable performance. Therefore, the upcoming IEEE 802.11bn amendment introduces multi-access point…

In this paper, we complement Verd\'{u}'s work on spectral efficiency in the wideband regime by investigating the fundamental tradeoff between rate and bandwidth when a constraint is imposed on the error exponent. Specifically, we consider…

Information Theory · Computer Science 2007-07-13 X. Wu , R. Srikant

Grant-free access schemes are candidates to support future massive multiple access applications owing to their capability to reduce control signaling and latency. As a promising class of grant-free schemes, coded random access schemes can…

Information Theory · Computer Science 2022-08-25 Lorenzo Valentini , Marco Chiani , Enrico Paolini

This paper presents an achievability bound that evaluates the exact probability of error of an ensemble of random codes that are decoded by a minimum distance decoder. Compared to the state-of-the-art which demands exponential computation…

Information Theory · Computer Science 2023-05-17 Ioannis Papoutsidakis , Angela Doufexi , Robert J. Piechocki

A well-known lower bound widely used in the massive MIMO literature hinges on channel hardening, i.e., the phenomenon for which, thanks to the large number of antennas, the effective channel coefficients resulting from beamforming tend to…

Information Theory · Computer Science 2017-10-27 Giuseppe Caire
‹ Prev 1 8 9 10 Next ›