Results 1 - 10
of
103
Achievable rate regions and performance comparison of half duplex bi-directional relaying protocols
- IEEE Trans. Inf. Theory
, 2011
"... Abstract—In a bi-directional relay channel, two nodes wish to ex-change independent messages over a shared wireless half-duplex channel with the help of a relay. In this paper, we derive achiev-able rate regions for four new half-duplex protocols and compare these to four existing half-duplex protoc ..."
Abstract
-
Cited by 29 (2 self)
- Add to MetaCart
(Show Context)
Abstract—In a bi-directional relay channel, two nodes wish to ex-change independent messages over a shared wireless half-duplex channel with the help of a relay. In this paper, we derive achiev-able rate regions for four new half-duplex protocols and compare these to four existing half-duplex protocols and outer bounds. In time, our protocols consist of either two or three phases. In the two phase protocols, both users simultaneously transmit during the first phase and the relay alone transmits during the second phase, while in the three phase protocol the two users sequentially transmit followed by a transmission from the relay. The relay may forward information in one of four manners; we outline existing amplify and forward (AF), decode and forward (DF), lattice based, and compress and forward (CF) relaying schemes and introduce the novel mixed forward scheme. The latter is a combination of CF in one direction and DF in the other. We derive achievable rate re-gions for the CF andMixed relaying schemes for the two and three phase protocols. We provide a comprehensive treatment of eight possible half-duplex bi-directional relaying protocols in Gaussian noise, obtaining their relative performance under different SNR and relay geometries. Index Terms—Achievable rate regions, bi-directional communi-cation, compress and forward, relaying. I.
Nested lattice codes for Gaussian relay networks with interference
- IEEE Trans. Inf. Theory
, 2011
"... ar ..."
(Show Context)
The Gaussian interference relay channel: Improved achievable rates and sum rate upperbounds using a potent relay
- IEEE Transactions on Information Theory, Special Issue on Interference Networks
, 2011
"... Abstract—We consider the Gaussian interference channel with an intermediate relay as a main building block for cooperative interference networks. On the achievability side, we consider compress-and-forward based strategies. Specifically, a generalized compress-and-forward strategy, where the destina ..."
Abstract
-
Cited by 23 (5 self)
- Add to MetaCart
(Show Context)
Abstract—We consider the Gaussian interference channel with an intermediate relay as a main building block for cooperative interference networks. On the achievability side, we consider compress-and-forward based strategies. Specifically, a generalized compress-and-forward strategy, where the destinations jointly decode the compression indices and the source messages, is shown to improve upon the compress-and-forward strategy which se-quentially decodes the compression indices and source messages, and the recently proposed generalized hash-and-forward strategy. We also construct a nested lattice code based compute-and-for-ward relaying scheme, which outperforms other relaying schemes when the direct link is weak. In this case, it is shown that, with a relay, the interference link can be useful for decoding the source messages. Noting the need for upperbounding the capacity for this channel, we propose a new technique with which the sum rate can be bounded. In particular, the sum capacity is upperbounded by considering the channel when the relay node has abundant power and is named potent for that reason. For the Gaussian interference relay channel with potent relay, we study the strong and the weak interference regimes and establish the sum capacity, which, in turn, serve as upperbounds for the sum capacity of the GIFRC with finite relay power. Numerical results demonstrate that upperbounds are tighter than the cut-set bound, and coincide with known achievable sum rates for many scenarios of interest. Additionally, the degrees of freedom of the GIFRC are shown to be 2 when the relay has large power, achievable using com-press-and-forward. Index Terms—Generalized compress-and-forward, interference relay channel, lattice codes, potent relay outerbound, sum capacity.
Successive Compute-and-Forward
"... Abstract—In prior work, we proposed the compute-andforward framework for sending linear combinations of messages to relays. In this note, we extend the notion of successive interference cancellation to the compute-and-forward setting. We find that once a relay has decoded a linear combination, it ca ..."
Abstract
-
Cited by 18 (3 self)
- Add to MetaCart
Abstract—In prior work, we proposed the compute-andforward framework for sending linear combinations of messages to relays. In this note, we extend the notion of successive interference cancellation to the compute-and-forward setting. We find that once a relay has decoded a linear combination, it can mix it with its channel output to create a new effective channel output. The resulting effective channel can be tuned so that it is more suitable for decoding a second linear combination than the original channel. I.
Multiple-input multiple-output two-way relaying: A space-division approach
- IEEE TRANS. INF. THEORY
, 2013
"... We propose a novel space-division-based net-work-coding scheme for multiple-input multiple-output (MIMO) two-way relay channels (TWRCs), in which two multiantenna users exchange information via a multiantenna relay. In the proposed scheme, the overall signal space at the relay is divided into two s ..."
Abstract
-
Cited by 16 (11 self)
- Add to MetaCart
(Show Context)
We propose a novel space-division-based net-work-coding scheme for multiple-input multiple-output (MIMO) two-way relay channels (TWRCs), in which two multiantenna users exchange information via a multiantenna relay. In the proposed scheme, the overall signal space at the relay is divided into two subspaces. In one subspace, the spatial streams of the two users have nearly orthogonal directions and are completely decoded at the relay. In the other subspace, the signal direc-tions of the two users are nearly parallel, and linear functions of the spatial streams are computed at the relay, following the principle of physical-layer network coding. Based on the recov-ered messages and message-functions, the relay generates and forwards network-coded messages to the two users. We show that, at high signal-to-noise ratio, the proposed scheme achieves the asymptotic sum-rate capacity of the MIMO TWRC within bits per user-antenna, for any antenna con-figuration and any channel realization. We perform large-system analysis to derive the average sum-rate of the proposed scheme over Rayleigh-fading MIMO TWRCs. We show that the average asymptotic sum-rate gap to the capacity is at most 0.053 bits per relay-antenna. It is demonstrated that the proposed scheme significantly outperforms the existing schemes.
Degrees of Freedom for the MIMO Multi-Way Relay Channel
"... Abstract — This paper investigates the degrees of freedom (DoF) of the L-cluster, K-user MIMO multiway relay channel, where users in each cluster wish to exchange messages within the cluster, and they can only communicate through the relay. A novel DoF upper bound is derived by providing users with ..."
Abstract
-
Cited by 13 (0 self)
- Add to MetaCart
(Show Context)
Abstract — This paper investigates the degrees of freedom (DoF) of the L-cluster, K-user MIMO multiway relay channel, where users in each cluster wish to exchange messages within the cluster, and they can only communicate through the relay. A novel DoF upper bound is derived by providing users with carefully designed genie information. Achievable DoF is identified using signal space alignment and multiple-access transmission. For the two-cluster MIMO multiway relay channel with two users in each cluster, the DoF is established for the general case when users and the relay have arbitrary number of antennas, and it is shown that the DoF upper bound can be achieved using signal space alignment or multiple-access transmission, or a combination of both. The result is then generalized to the three user case. For the L-cluster K-user MIMO multiway relay channel in the symmetric setting, conditions under which the DoF upper bound can be achieved are established. In addition to being shown to be tight in a variety of scenarios of interests of the multiway relay channel, the newly derived upperbound also establishes the optimality of several previously established achievable DoF results for multiuser relay channels that are special cases of the multiway relay channel. Index Terms — MIMO multi-way relay channel, degrees of freedom, signal space alignment, interference alignment. I.
Lattice codes for the Gaussian relay channel: Decode-and-Forward and Compress-and-Forward,” [Online]. Available: http://arxiv.org/pdf/1111.0084v1.pdf
"... Abstract—Lattice codes are known to achieve capacity in the Gaussian point-to-point channel, achieving the same rates as i.i.d. random Gaussian codebooks. Lattice codes are also known to outperform random codes for certain channel models that are able to exploit their linearity. In this paper, we sh ..."
Abstract
-
Cited by 12 (3 self)
- Add to MetaCart
(Show Context)
Abstract—Lattice codes are known to achieve capacity in the Gaussian point-to-point channel, achieving the same rates as i.i.d. random Gaussian codebooks. Lattice codes are also known to outperform random codes for certain channel models that are able to exploit their linearity. In this paper, we show that lattice codes may be used to achieve the same performance as known i.i.d. Gaussian random coding techniques for the Gaussian relay channel, and show several examples of how this may be combined with the linearity of lattices codes in multisource relay networks. In particular, we present a nested lattice list decoding technique in which lattice codes are shown to achieve the decode-and-for-ward (DF) rate of single source, single destination Gaussian relay channels with one or more relays. We next present two examples of how this DF scheme may be combined with the linearity of lattice codes to achieve new rate regions which for some channel conditions outperform analogous known Gaussian random coding techniques in multisource relay channels. That is, we derive a new achievable rate region for the two-way relay channel with direct links and compare it to existing schemes, and derive a new achievable rate region for the multiple access relay channel. We furthermore present a lattice compress-and-forward (CF) scheme for the Gaussian relay channel which exploits a lattice Wyner–Ziv binning scheme and achieves the same rate as the Cover–El Gamal CF rate evaluated for Gaussian random codes. These results suggest that structured/lattice codes may be used to mimic, and sometimes outperform, random Gaussian codes in general Gaussian networks. Index Terms—Compress and forward, decode and forward, Gaussian relay channel, lattice codes, relay channel. I.
Reduced-dimension cooperative precoding for MIMO two-way relay channels
- IEEE Trans. Wireless Commun
, 2012
"... Abstract—We investigate efficient communications over MIMO two-way relay channels (TWRCs) of nT < nR, where nT denotes the number of antennas at each user and nR denotes that at the relay. We propose a new reduced-dimension (RD) cooperative precoding scheme. In the proposed scheme, the two users ..."
Abstract
-
Cited by 8 (8 self)
- Add to MetaCart
Abstract—We investigate efficient communications over MIMO two-way relay channels (TWRCs) of nT < nR, where nT denotes the number of antennas at each user and nR denotes that at the relay. We propose a new reduced-dimension (RD) cooperative precoding scheme. In the proposed scheme, the two users cooperatively create nT aligned eigen-modes, supporting nT streams of physical-layer network coding. We investigate the design of the RD cooperative precoder and derive an asymptotically optimal solution. We analytically show that, in the worst case, the proposed scheme is within 1 2 bit per transmit antenna of the asymptotic sum-capacity of the MIMO TWRC. For fading MIMO TWRCs with i.i.d. Gaussian coefficients, we derive a closed-form expression of the average sum-rate of the proposed scheme using large system analysis. Our analytical result shows that, for a large system with nT nR = 1 2, the proposed scheme is less than 0.16 bit per transmit antenna away from the capacity. Furthermore, this gap reduces as nT nR increases, and vanishes as nT nR tends to 1. It is demonstrated that the proposed scheme can significantly outperform other existing schemes in the literature. Index Terms—MIMO, two-way relay channel, physical-layer network coding, precoding, capacity. I.
MIMO multiway relaying with clustered full data exchange: Signal space alignment and degrees of freedom
- IEEE Trans. Wireless Commun
, 2014
"... Abstract—Recently, much research interest has been attracted towards the design of efficient communication mechanisms for multiple-input multiple-output (MIMO) multiway relay channels (mRCs). In this paper, we investigate achievable degrees of freedom (DoF) of the MIMO mRC with L clusters and K user ..."
Abstract
-
Cited by 7 (3 self)
- Add to MetaCart
(Show Context)
Abstract—Recently, much research interest has been attracted towards the design of efficient communication mechanisms for multiple-input multiple-output (MIMO) multiway relay channels (mRCs). In this paper, we investigate achievable degrees of freedom (DoF) of the MIMO mRC with L clusters and K users per cluster, where each user is equipped with M antennas and the relay with N antennas. Our analysis is focused on a new data exchange model, termed clustered full data exchange, i.e., each user in a cluster wants to learn the messages of all the other users in the same cluster. Novel signal alignment techniques are developed to jointly and systematically construct the beamforming matrices at the users and the relay for efficient implementation of physical-layer network coding. Based on that, we derive an achievable DoF of the MIMO mRC with an arbitrary network configuration of L and K, as well as with an arbitrary antenna configuration of M and N. We show that our proposed scheme achieves the DoF capacity when M
Physical-layer MIMO relaying
- In Proc. Int. Symp. Inform. Theory (ISIT
"... Abstract—The physical-layer network coding (PNC) approach provides improved performance in many scenarios over “tra-ditional ” relaying techniques or network coding. This work addresses the generalization of PNC to wireless scenarios where network nodes have multiple antennas. We use a recent ma-tri ..."
Abstract
-
Cited by 7 (7 self)
- Add to MetaCart
(Show Context)
Abstract—The physical-layer network coding (PNC) approach provides improved performance in many scenarios over “tra-ditional ” relaying techniques or network coding. This work addresses the generalization of PNC to wireless scenarios where network nodes have multiple antennas. We use a recent ma-trix decomposition, which allows, by linear pre- and post-processing, to simultaneously transform both channel matrices to triangular forms, where the diagonal entries, corresponding to both channels, are equal. This decomposition, in conjunction with precoding, allows to convert any two-input multiple-access channel (MAC) into parallel MACs, over which single-antenna PNC may be used. The technique is demonstrated using the two-way relay channel with multiple antennas. For this case it is shown that, in the high signal-to-noise regime, the scheme approaches the cut-set bound, thus establishing the asymptotic network capacity. Index Terms—network modulation, physical-layer network coding, network capacity, multiple access channel, structured codes, nested lattices, MIMO channels, two-way relay channel I.
