Degrees of Freedom for the MIMO Multi-Way Relay Channel

Tian, Ye; Yener, Aylin

doi:10.1109/tit.2014.2309646

Cited by 49 publications

(3 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Although (6)- (9) are obtained under the assumption of CSIT with one unit delay, they actually hold under the more general assumption of CSIT with delay of arbitrary units. A short discussion on this extension will be given at the end of Sect.…”

Section: Remarkmentioning

confidence: 99%

“…This concludes the illustrating example. We now use the illustrating example to discuss two extensions of the results given in (6)- (9). First, consider the extension to the assumption of CSIT with delay of arbitrary units.…”

Section: Illustrating Example For K =mentioning

confidence: 99%

“…The main idea of signal space alignment is to jointly design the precoders such that the signals to be exchanged between two users are aligned in the same subspace at the relay, so that the dimensions of the relay signal space can be efficiently utilized. The idea of signal space alignment is then generalized and applied to many related MIMO relay channels [5]- [13], including the K-user Y channel [5], [6], the multipair two-way relay channel [7], [8], and the multi-way relay channels with a clustered private message set [9], [10], with a clustered public message set [11], and with a more general message set [12].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Achievable Degrees of Freedom of MIMO Multi-Way Relay Channel with Asymmetric Message Set and Delayed CSIT

Huang

Ouyang

2017

IEICE Trans. Commun.

View full text Add to dashboard Cite

In this paper, we study the achievable degrees of freedom (DoF) of a multiple-input multiple-output (MIMO) multi-way relay channel with asymmetric message set that models the scenario of the two-way communication between a base station and multiple users through a relay. Under the assumption of delayed channel state information at transmitters (CSIT), we propose an amplify-and-forward relaying scheme based on the scheme proposed by Maddah-Ali and Tse to support signal space alignment, so that the available dimensions of the signal spaces at the relay and the users can be efficiently utilized. The proposed scheme outperforms the traditional one-way scheme from the perspective of DoF, and is useful to relieve the communication bottleneck caused by the asymmetric traffic load inherent in cellular networks.

show abstract

Section: Remarkmentioning

confidence: 99%

Section: Illustrating Example For K =mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Achievable Degrees of Freedom of MIMO Multi-Way Relay Channel with Asymmetric Message Set and Delayed CSIT

Huang

Ouyang

2017

IEICE Trans. Commun.

View full text Add to dashboard Cite

show abstract

Using network coding to achieve the capacity of deterministic relay networks with relay messages

Zewail

Mohasseb

Nafie

et al. 2016

Wireless Communications

View full text Add to dashboard Cite

In this paper, we derive the capacity of the deterministic relay networks with relay messages. We consider a network that consists of five nodes, four of which can only communicate via the fifth one. However, the fifth node is not merely a relay as it may exchange private messages with the other network nodes. First, we develop an upper bound on the capacity region based on the notion of a single-sided genie. In the course of the achievability proof, we also derive the deterministic capacity of a four-user relay network (without private messages at the relay). The capacity achieving schemes use a combination of two network coding techniques: the simple ordering scheme and detour scheme. In the simple ordering scheme, we order the transmitted bits at each user such that the bi-directional messages will be received at the same channel level at the relay, while the basic idea behind the detour scheme is that some parts of the message follow an indirect paths to their respective destinations. This paper, therefore, serves to show that user cooperation and network coding can enhance throughput, even when the users are not directly connected to each other. Finally, we make a conjecture about the capacity region of the general K-node relay network with relay messages.A. Zewail et al.The capacity of deterministic relay networks with relay messages the relay just re-orders the received equations created from the superposition of the transmitted signals on the wireless medium and forwards them. We call this scheme the simple ordering scheme (SOS). Then, from the insights of this work, the authors of [7] used a combination of lattice codes and random Gaussian codes at the source nodes to propose a coding scheme that achieves to within 2 bits per user of the cut-set upper bound on the capacity of the two-pair two-way relay network.Reference [8] studied the two-way X-Channel. First, a new upper bound based on the notion of a single-sided genie was developed, then it was used to characterize the deterministic multicast capacity of their network. To prove the achievability, the authors proposed the idea of Detour Schemes that route some bits intended for a certain receiver via alternative paths when they cannot be accommodated on direct routes. Thereafter, the capacity of the deterministic Y-channel was defined in [9]. Building on this result, the authors investigated the capacity of the Gaussian Ychannel in [10]. Then, we extended these works in [11], by considering a four-user relay network with no direct link, where each user wishes to exchange a number of private messages with the other three users via the relay node. Achievability of the capacity region was demonstrated via two detour schemes (DS), which are different from the ones used in [8] because of the different nature of the multicast network. After that, in [12], we studied the capacity of a three-user relay network where the relay node is interested in exchanging some private messages with the other network users. It was shown that, if all messages emanating from ...

show abstract

Three-Way Massive MIMO Relaying with Successive Cancelation Decoding

Ngo

Matthaiou

2018

Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

View full text Add to dashboard Cite

Abstract. In this paper, we propose a novel transmission scheme for a three-way massive multiple-input multiple-output (MIMO) relay network where three users exchange their data with the help of a decodeand-forward relay station equipped with a very large antenna array. Our proposed scheme needs only two time-slots for the information exchange. More precisely, the three users first send their symbols to the relay. Then, the relay uses the maximum-ratio combining technique to decode all transmitted symbols and simultaneously transmits these symbols to all three users. Each user applies successive cancelation decoding to decode symbols transmitted from other users. We study the sum spectral efficiency of our proposed transmission protocol. We show that the sum spectral efficiency of our proposed scheme increases noticeably compared to the one of the conventional scheme where three time-slots are required to exchange data among the three users, without increasing the system complexity.

show abstract

Degrees of Freedom for the MIMO Multi-Way Relay Channel

Cited by 49 publications

References 24 publications

Achievable Degrees of Freedom of MIMO Multi-Way Relay Channel with Asymmetric Message Set and Delayed CSIT

Achievable Degrees of Freedom of MIMO Multi-Way Relay Channel with Asymmetric Message Set and Delayed CSIT

Using network coding to achieve the capacity of deterministic relay networks with relay messages

Three-Way Massive MIMO Relaying with Successive Cancelation Decoding

Contact Info

Product

Resources

About