English
Related papers

Related papers: The Approximate Capacity of the MIMO Relay Channel

200 papers

This paper focuses on the capacity of point-to-point relay communications wherein the transmitter is assisted by an intermediate relay. We detail the mathematical model of cutset and amplify and forward (AF) relaying strategy. We present…

Information Theory · Computer Science 2013-01-15 Farshad Shams , Marco Luise

This paper studies the relaying strategies and the approximate capacity of the classic three-node Gaussian relay channel, but where the noises at the relay and at the destination are correlated. It is shown that the capacity of such a relay…

Information Theory · Computer Science 2011-10-25 Lei Zhou , Wei Yu

An information measure based on fractional partitions of a set is used to derive a general dependence balance inequality for communication. This inequality is used to obtain new upper bounds on reliable and secret rates for multiterminal…

Information Theory · Computer Science 2026-04-14 Amin Gohari , Gerhard Kramer

The L-user additive white Gaussian noise multi-way relay channel is considered, where multiple users exchange information through a single relay at a common rate. Existing coding strategies, i.e., complete-decode-forward and…

Information Theory · Computer Science 2015-03-14 Lawrence Ong , Christopher M. Kellett , Sarah J. Johnson

We analyze coding for energy efficiency in relay channels at a fixed source rate. We first propose a half-duplex decode-forward coding scheme for the Gaussian relay channel. We then derive three optimal sets of power allocation, which…

Information Theory · Computer Science 2016-11-18 Fanny Parzysz , Mai Vu , François Gagnon

The capacity region of the 2-user multi-input multi-output (MIMO) Gaussian interference channel (IC) is characterized to within a constant gap that is independent of the channel matrices for the general case of the MIMO IC with an arbitrary…

Information Theory · Computer Science 2015-03-18 Sanjay Karmakar , Mahesh K. Varanasi

The capacity of the Gaussian wiretap channel model is analyzed when there are multiple antennas at the sender, intended receiver and eavesdropper. The associated channel matrices are fixed and known to all the terminals. A computable…

Information Theory · Computer Science 2016-11-15 Ashish Khisti , Gregory Wornell

We present an achievable rate for general Gaussian relay networks. We show that the achievable rate is within a constant number of bits from the information-theoretic cut-set upper bound on the capacity of these networks. This constant…

Information Theory · Computer Science 2016-11-17 Amir Salman Avestimehr , Suhas N. Diggavi , David N C. Tse

The two user Gaussian interference channel with a full-duplex relay is studied. By using genie aided approaches, two new upper bounds on the achievable sum-rate in this setup are derived. These upper bounds are shown to be tighter than…

Information Theory · Computer Science 2010-08-16 Anas Chaaban , Aydin Sezgin

In this work, novel upper and lower bounds for the capacity of channels with arbitrary constraints on the support of the channel input symbols are derived. As an immediate practical application, the case of multiple-input multiple-output…

Information Theory · Computer Science 2017-09-01 Alex Dytso , Mario Goldenbaum , Shlomo Shamai , H. Vincent Poor

The capacity of a discrete-time multi-input multi-output (MIMO) Gaussian channel with output quantization is investigated for different receiver architectures. A general formulation of this problem is proposed in which the antenna outputs…

Information Theory · Computer Science 2017-07-10 Stefano Rini , Luca Barletta , Yonina C. Eldar , Elza Erkip

Communication over a fully quantum relay channel is considered. We establish three bounds based on different coding strategies, i.e., partial decode-forward, measure-forward, and assist-forward. Using the partial-decode forward strategy,…

Quantum Physics · Physics 2025-05-22 Uzi Pereg

We characterize the capacity region to within log{2(M-1)} bits/s/Hz for the M-transmitter K-receiver Gaussian multicast channel with feedback where each receiver wishes to decode every message from the M transmitters. Extending…

Information Theory · Computer Science 2012-05-21 Changho Suh , Naveen Goela , Michael Gastpar

We consider the arbitrarily varying Gaussian relay channel with sender frequency division. We determine the random code capacity, and establish lower and upper bounds on the deterministic code capacity. It is observed that when the channel…

Information Theory · Computer Science 2018-06-01 Uzi Pereg , Yossef Steinberg

In this part, we consider the capacity analysis for wireless mobile systems with multiple antenna architectures. We apply the results of the first part to a commonly known baseband, discrete-time multiple antenna system where both the…

Information Theory · Computer Science 2007-07-13 Majid Fozunbal , Steven W. McLaughlin , Ronald W. Schafer

Motivated by the design of low-complexity low-power coding solutions for the Gaussian relay channel, this work presents an upper bound on the minimum energy-per-bit achievable on the Gaussian relay channel using rank-1 linear relaying. Our…

Information Theory · Computer Science 2024-01-30 Oliver Kosut , Michelle Effros , Michael Langberg

In this paper, protocols for the half-duplex relay channel are introduced and performance limits are analyzed. Relay nodes underly an orthogonality constraint, which prohibits simultaneous receiving and transmitting on the same…

Information Theory · Computer Science 2010-02-02 Peter Rost , Gerhard Fettweis

A half-duplex wireless network with 6 lateral nodes, 3 transmitters and 3 receivers, and a central relay is considered. The transmitters wish to send information to their corresponding receivers via a two phase communication protocol. The…

Information Theory · Computer Science 2010-01-22 Hamidreza Ebrahimzadeh Saffar , Patrick Mitran

This paper investigates the capacity of a wireless two way relay channel in which two end nodes exchange information via a relay node. The capacity is defined in the information-theoretic sense as the maximum information exchange rate…

Information Theory · Computer Science 2008-04-22 Zhang Shengli , Soung Chang Liew

We obtain a new upper bound on the capacity of a class of discrete memoryless relay channels. For this class of relay channels, the relay observes an i.i.d. sequence $T$, which is independent of the channel input $X$. The channel is…

Information Theory · Computer Science 2008-10-07 Ravi Tandon , Sennur Ulukus