English
Related papers

Related papers: The Approximate Capacity of the MIMO Relay Channel

200 papers

The multicast capacity of the Gaussian two-hop relay network with one source, $N$ relays, and $L$ destinations is studied. It is shown that a careful modification of the partial decode--forward coding scheme, whereby the relays cooperate…

Information Theory · Computer Science 2015-08-04 Jing Li , Young-Han Kim

This paper considers the multi-input multi-output (MIMO) relay channel where multiple antennas are employed by each terminal. Compared to single-input single-output (SISO) relay channels, MIMO relay channels introduce additional degrees of…

Information Theory · Computer Science 2008-05-03 Caleb K. Lo , Sriram Vishwanath , Robert W. Heath

Consider a Gaussian relay network where a source node communicates to a destination node with the help of several layers of relays. Recent work has shown that compress-and-forward based strategies can achieve the capacity of this network…

Information Theory · Computer Science 2015-07-16 Ritesh Kolte , Ayfer Özgür , Abbas El Gamal

In this paper, we show that the capacity of the three-node Gaussian relay channel can be achieved to within 1 and 2 bit/sec/Hz using compress-and-forward and amplify-and-forward relaying, respectively.

Information Theory · Computer Science 2010-11-24 Woohyuk Chang , Sae-Young Chung , Yong H. Lee

In this paper, a Gaussian two-way relay channel, where two source nodes exchange messages with each other through a relay, is considered. We assume that all nodes operate in full-duplex mode and there is no direct channel between the source…

Information Theory · Computer Science 2009-02-17 Wooseok Nam , Sae-Young Chung , Yong H. Lee

We study the capacity of the full-duplex bidirectional (or two-way) relay channel with two nodes and one relay. The channels in the forward direction are assumed to be different (in general) than the channels in the backward direction, i.e.…

Information Theory · Computer Science 2008-08-26 Amir Salman Avestimehr , Aydin Sezgin , David N. C. Tse

The capacity of a class of multi-way relay channels, where L users communicate via a relay (at possibly different rates), is derived for the case where the channel outputs are modular sums of the channel inputs and the receiver noise. The…

Information Theory · Computer Science 2011-11-16 Lawrence Ong , Sarah J. Johnson , Christopher M. Kellett

This paper studies the transceiver design of the Gaussian two-pair two-way relay channel (TWRC), where two pairs of users exchange information through a common relay in a pairwise manner. Our main contribution is to show that the capacity…

Information Theory · Computer Science 2018-06-01 Xiaojun Yuan , Haiyang Xin , Soung-Chang Liew , Yong Li

Consider a Gaussian relay network where a number of sources communicate to a destination with the help of several layers of relays. Recent work has shown that a compress-and-forward based strategy at the relays can achieve the capacity of…

Information Theory · Computer Science 2013-04-30 Ritesh Kolte , Ayfer Özgür

Standard upper and lower bounds on the capacity of relay channels are cut-set (CS), decode-forward (DF), and quantize-forward (QF) rates. For real additive white Gaussian noise (AWGN) multicast relay channels with one source node and one…

Information Theory · Computer Science 2019-01-28 Mohit Thakur , Gerhard Kramer

The capacity of a class of deterministic relay channels with the transmitter input X, the receiver output Y, the relay output Y_1 = f(X, Y), and a separate communication link from the relay to the receiver with capacity R_0, is shown to be…

Information Theory · Computer Science 2016-11-18 Thomas M. Cover , Young-Han Kim

We consider systems in which the transmitter conveys messages to the receiver through a capacity-limited relay station. The channel between the transmitter and the relay-station is assumed to be a frequency selective additive Gaussian noise…

Information Theory · Computer Science 2018-01-08 Adi Homri , Michael Peleg , Shlomo Shamai

The capacity of a class of Interference Relay Channels (IRC) -the Injective Semideterministic IRC where the relay can only observe one of the sources- is investigated. We first derive a novel outer bound and two inner bounds which are based…

Information Theory · Computer Science 2016-09-28 Germán Bassi , Pablo Piantanida , Sheng Yang

Recently, it has been shown that a quantize-map-and-forward scheme approximately achieves (within a constant number of bits) the Gaussian relay network capacity for arbitrary topologies. This was established using Gaussian codebooks for…

Information Theory · Computer Science 2015-03-17 Ayfer Ozgur , Suhas Diggavi

A multi-input multi-output (MIMO) Gaussian channel with two transmit antennas and two receive antennas is studied that is subject to an input peak-power constraint. The capacity and the capacity-achieving input distribution are unknown in…

Information Theory · Computer Science 2024-01-31 Alex Dytso , Luca Barletta , Gerhard Kramer

We consider the broadcast phase of a three-node network, where a relay node establishes a bidirectional communication between two nodes using a spectrally efficient two-phase decode-and-forward protocol. In the first phase the two nodes…

Information Theory · Computer Science 2011-04-19 Rafael F. Wyrembelski , Tobias J. Oechtering , Igor Bjelakovic , Clemens Schnurr , Holger Boche

Consider the broadcast relay channel (BRC) which consists of a source sending information over a two user broadcast channel in presence of two relay nodes that help the transmission to the destinations. Clearly, this network with five nodes…

Information Theory · Computer Science 2010-05-05 Arash Behboodi , Pablo Piantanida

The use of 1-bit analog-to-digital converters (ADCs) is seen as a promising approach to significantly reduce the power consumption and hardware cost of multiple-input multiple-output (MIMO) receivers. However, the nonlinear distortion due…

Information Theory · Computer Science 2022-10-12 Neil Irwin Bernardo , Jingge Zhu , Yonina C. Eldar , Jamie Evans

We develop a new upper bound on the capacity of the relay channel that is tighter than previously known upper bounds. This upper bound is proved using traditional weak converse techniques involving mutual information inequalities and…

Information Theory · Computer Science 2022-04-01 Abbas El Gamal , Amin Gohari , Chandra Nair

Transmit signal and bandwidth optimization is considered in multiple-antenna relay channels. Assuming all terminals have channel state information, the cut-set capacity upper bound and decode-and-forward rate under full-duplex relaying are…

Information Theory · Computer Science 2011-11-30 Chris T. K. Ng , Gerard J. Foschini
‹ Prev 1 2 3 10 Next ›