English
Related papers

Related papers: Common Randomness Generation over Slow Fading Chan…

200 papers

We investigate the problem of common randomness (CR) generation from discrete correlated sources aided by one-way communication over single-user multiple-input multiple-output (MIMO) slow fading channels with additive white Gaussian noise…

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

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

Common randomness (CR), as a resource, is not commonly exploited in existing practical communication systems. In the CR generation framework, both the sender and receiver aim to generate a common random variable observable to both, ideally…

Signal Processing · Electrical Eng. & Systems 2024-06-27 Rami Ezzine , Wafa Labidi , Christian Deppe , Holger Boche

We study the problem of common randomness (CR) generation in the basic two-party communication setting in which the sender and the receiver aim to agree on a common random variable with high probability by observing independent and…

Information Theory · Computer Science 2022-01-27 Wafa Labidi , Rami Ezzine , Christian Deppe , Holger Boche

We investigate the problem of generating common randomness (CR) from finite compound sources aided by unidirectional communication over rate-limited perfect channels. The two communicating parties, often referred to as terminals, observe…

Information Theory · Computer Science 2024-01-26 Rami Ezzine , Moritz Wiese , Christian Deppe , Holger Boche

We investigate the problem of common randomness (CR) generation in the basic two-party communication setting in which a sender and a receiver aim to agree on a common random variable with high probability. The terminals observe independent…

Information Theory · Computer Science 2024-05-06 Wafa Labidi , Rami Ezzine , Moritz Wiese , Christian Deppe , Holger Boche

We address the problem of recovering a sparse signal observed by a resource constrained wireless sensor network under channel fading. Sparse random matrices are exploited to reduce the communication cost in forwarding information to a…

Information Theory · Computer Science 2015-04-16 Thakshila Wimalajeewa , Pramod K. Varshney

Discrete-time Rayleigh fading single-input single-output (SISO) and multiple-input multiple-output (MIMO) channels are considered, with no channel state information at the transmitter or the receiver. The fading is assumed to be stationary…

Information Theory · Computer Science 2016-11-17 Vignesh Sethuraman , Ligong Wang , Bruce Hajek , Amos Lapidoth

The multipath-rich wireless environment associated with typical wireless usage scenarios is characterized by a fading channel response that is time-varying, location-sensitive, and uniquely shared by a given transmitter-receiver pair. The…

Cryptography and Security · Computer Science 2009-10-28 Chunxuan Ye , Suhas Mathur , Alex Reznik , Yogendra Shah , Wade Trappe , Narayan Mandayam

The minimum average signal-to-noise ratio (SNR) per bit required for error-free transmission over a fading channel is derived, and is shown to be equal to that of the additive white Gaussian noise (AWGN) channel, which is $-1.6$ dB.…

Information Theory · Computer Science 2017-11-29 K. Vasudevan

Wireless fading channels suffer from both channel fadings and Additive White Gaussian Noise (AWGN). As a result, it is impossible for fading channels to support a constant rate data stream without using buffers. In this paper, we consider…

Information Theory · Computer Science 2017-12-15 Yunquan Dong , Pingyi Fan

This paper proposes a unified framework for the effective rate analysis over arbitrary correlated and not necessarily identical multiple inputs single output (MISO) fading channels, which uses moment generating function (MGF) based approach…

Information Theory · Computer Science 2016-12-13 Minglei You , Hongjian Sun , Jing Jiang , Jiayi Zhang

Discrete Diffusion and Flow Matching models have significantly advanced generative modeling for discrete structures, including graphs. However, the dependencies between intermediate noisy states lead to error accumulation and propagation…

Machine Learning · Computer Science 2025-06-24 Yoann Boget

Discrete-time Rayleigh fading multiple-input multiple-output (MIMO) channels are considered, with no channel state information at the transmitter and receiver. The fading is assumed to be correlated in time and independent from antenna to…

Information Theory · Computer Science 2007-07-13 Vignesh Sethuraman , Ligong Wang , Bruce Hajek , Amos Lapidoth

Unlike the AWGN (additive white gaussian noise) channel, fading channels suffer from random channel gains besides the additive Gaussian noise. As a result, the instantaneous channel capacity varies randomly along time, which makes it…

Information Theory · Computer Science 2014-07-18 Yunquan Dong , Pingyi Fan

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

We study a multiple-input multiple-output (MIMO) multiple access channel (MAC) from several multi-antenna transmitters to a multi-antenna receiver. The fading channels between the transmitters and the receiver are modeled by random…

Information Theory · Computer Science 2011-05-04 Jakob Hoydis , Romain Couillet , Merouane Debbah

The effective throughput of multiple-input single-output (MISO) wireless communication systems over $\kappa-\mu$ shadowed fading channels is analysed. To obtain exact closed-from expression, the moment generating function (MGF) of the…

Information Theory · Computer Science 2018-05-01 H. Al-Hmood , H. S. Al-Raweshidy

We derive new upper and lower bounds on the fading number of multiple-input single-output (MISO) fading channels of general (not necessarily Gaussian) regular law with spatial and temporal memory. The fading number is the second term, after…

Information Theory · Computer Science 2007-07-16 Stefan M. Moser

We consider the problem of estimating sparse communication channels in the MIMO context. In small to medium bandwidth communications, as in the current standards for OFDM and CDMA communication systems (with bandwidth up to 20 MHz), such…

Networking and Internet Architecture · Computer Science 2016-11-17 Yann Barbotin , Ali Hormati , Sundeep Rangan , Martin Vetterli
‹ Prev 1 2 3 10 Next ›