English
Related papers

Related papers: Broadcast Channels with Heterogeneous Arrival and …

200 papers

In this paper we investigate the optimal latency of communications. Focusing on fixed rate communication without any feedback channel, this paper encompasses low-latency strategies with which one hop and multi-hop communication issues are…

Information Theory · Computer Science 2017-01-05 Minh Au , Francois Gagnon

In this paper we study the Z channel with side information non-causally available at the encoders. We use Marton encoding along with Gelfand-Pinsker random binning scheme and Chong-Motani-Garg-El Gamal (CMGE) jointly decoding to find an…

Information Theory · Computer Science 2015-06-03 Saeed Hajizadeh , Mostafa Monemizadeh

Lattice coding techniques may be used to derive achievable rate regions which outperform known independent, identically distributed (i.i.d.) random codes in multi-source relay networks and in particular the two-way relay channel. Gains stem…

Information Theory · Computer Science 2016-11-17 Yiwei Song , Natasha Devroye , Huai-Rong Shao , Chiu Ngo

An analog source is to be transmitted across a Gaussian channel in more than one channel use per source symbol. This paper derives a lower bound on the asymptotic mean squared error for a strategy that consists of repeatedly quantizing the…

Information Theory · Computer Science 2016-11-17 Marius Kleiner , Bixio Rimoldi

In this paper, a two-hop network in which information is transmitted from a source via a relay to a destination is considered. It is assumed that the channels are static fading with additive white Gaussian noise. All nodes are equipped with…

Information Theory · Computer Science 2009-05-18 Vahid Pourahmadi , Alireza Bayesteh , Amir K. Khandani

In this paper, we consider a Gaussian two-way relay channel (GTRC), where two sources exchange messages with each other through a relay. We assume that there is no direct link between sources, and all nodes operate in full-duplex mode. By…

Information Theory · Computer Science 2013-01-29 Shahab Ghasemi-Goojani , Hamid Behroozi

We establish the capacity region of several classes of broadcast channels with random state in which the channel to each user is selected from two possible channel state components and the state is known only at the receivers. When the…

Information Theory · Computer Science 2015-09-16 Hyeji Kim , Abbas El Gamal

In this paper the cognitive interference channel with a common message, a variation of the classical cognitive interference channel in which the cognitive message is decoded at both receivers, is studied. For this channel model new outer…

Information Theory · Computer Science 2012-08-21 Stefano Rini , Carolin Huppert

This paper investigates the capacity regions of two-receiver broadcast channels where each receiver (i) has both common and private-message requests, and (ii) knows part of the private message requested by the other receiver as side…

Information Theory · Computer Science 2016-11-18 Behzad Asadi , Lawrence Ong , Sarah J. Johnson

This article examines the problem of state estimation over multi-terminal channels in an unreliable regime. More specifically, we consider two canonical settings. In the first setting, measurements of a common stochastic source need to be…

Information Theory · Computer Science 2023-08-31 Touraj Soleymani , Deniz Gündüz

This paper considers a Gaussian broadcast channel with two unmatched degraded components, three particular messages, and a common message that is intended for all three receivers. It is shown that for this channel superposition coding and…

Information Theory · Computer Science 2009-11-04 Ramy H. Gohary , Timothy N. Davidson

We discuss the problem of designing channel access architectures for enabling fast, low-latency, grant-free and uncoordinated uplink for densely packed wireless nodes. Specifically, we study random-access codes, previously introduced for…

Information Theory · Computer Science 2019-07-23 Suhas S Kowshik , Kirill Andreev , Alexey Frolov , Yury Polyanskiy

We propose an achievable rate-region for the two-way multiple-relay channel using decode-and-forward block Markovian coding. We identify a conflict between the information flow in both directions. This conflict leads to an intractable…

Information Theory · Computer Science 2016-07-26 Jonathan Ponniah , Liang-Liang Xie

A cache-aided $K$-user Gaussian broadcast channel (BC) is studied. The transmitter has a library of $N$ files, from which each user requests one. The users are equipped with caches of different sizes, which are filled without the knowledge…

Information Theory · Computer Science 2018-06-27 Mohammad Mohammadi Amiri , Deniz Gunduz

This article examines the queueing performance of communication systems that transmit encoded data over unreliable channels. A fading formulation suitable for wireless environments is considered where errors are caused by a discrete channel…

Information Theory · Computer Science 2013-09-16 Fatemeh Hamidi-Sepehr , Henry D. Pfister , Jean-Francois Chamberland

We consider a two-user Gaussian interference channel with heterogeneous blocklength constraints (HB-GIC), strong interference, and two private messages. We propose to apply the successive interference cancellation with early decoding, i.e.,…

Information Theory · Computer Science 2023-11-17 Kailun Dong , Pin-Hsun Lin , Marcel Mross , Eduard A. Jorswieck

This paper considers the transmission of an infinite sequence of messages (a streaming source) over a packet erasure channel, where every source message must be recovered perfectly at the destination subject to a fixed decoding delay. While…

Information Theory · Computer Science 2020-05-14 Elad Domanovitz , Silas L. Fong , Ashish Khisti

We consider the sequential transmission of a stream of messages over a block-fading multi-input-multi-output (MIMO) channel. A new message arrives at the beginning of each coherence block, and the decoder is required to output each message…

Information Theory · Computer Science 2014-08-13 Ashish Khisti , Stark Draper

For two-user interference channels, the capacity is known for the case where interference is stronger than the desired signal. Moreover, it is known that if the interference is above a certain level, it does not reduce the capacity at all.…

Information Theory · Computer Science 2012-06-21 Frederic Knabe , Aydin Sezgin

This paper considers multiplexing two sequences of messages with two different decoding delays over a packet erasure channel. In each time slot, the source constructs a packet based on the current and previous messages and transmits the…

Information Theory · Computer Science 2019-11-12 Silas L. Fong , Ashish Khisti , Baochun Li , Wai-Tian Tan , Xiaoqing Zhu , John Apostolopoulos