Approaching the capacity of two-way gaussian relay channel with relay private messages

Ghabeli, Leila; Derpich, Milan S.

doi:10.1109/isit.2014.6875330

Cited by 4 publications

(7 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Consider the five-node network channel gains is given as N UL D .n 15 , n 25 , n 35 , n 45 /, N DL D .n 51 , n 52 , n 53 , n 54 / and a rate tuple R = .R 12 , R 13…”

Section: Numerical Resultsmentioning

confidence: 99%

“…Again, from the extra SOS conditions in Lemma 1, we have R 34 C R 41 C R 13 C R 12 C R 42 C R 32 D n C 1 (C8) By subtracting this condition from the MGC, we can get R 23 D R 32 C 1 . Also, from the upper bound conditions in Theorem 2, we can get R 31 C R 32 C R 34 C R 41 C R 42 C R 12 Ä n and by comparing with (C8), we obtain R 13 R 31 C 1 , where Dˇ1 C 1 . Now, we need to choose the rates from which we will detour the -bits, we have the following options.…”

Section: C2 Detour Schemementioning

confidence: 90%

See 1 more Smart Citation

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

“…Consider the five-node network channel gains is given as N UL D .n 15 , n 25 , n 35 , n 45 /, N DL D .n 51 , n 52 , n 53 , n 54 / and a rate tuple R = .R 12 , R 13…”

Section: Numerical Resultsmentioning

confidence: 99%

Section: C2 Detour Schemementioning

confidence: 90%

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

show abstract

“…As it is observed from the results, not necessarily decoding those values of (a 1 , a 2 ) and (b 3 , b 4 ) which are closer to (h 1r , h 2r ) and (h 3r , h 4r ) result in higher rates. The first row of the [7,10,4,6] by our method and the method of [13] for the downlink communication h 2r /h 1r = h 4r /h 3r = 2. It can be seen that, for most cases, decoding (a 1 , a 2 ) = (1, 2) results in higher rates.…”

Section: Uplinkmentioning

confidence: 99%

“…This strategy attains noise suppression without multiplexing loss. In [6], the capacity of the TRC with relay private messages has been achieved within constant gaps of 2/3 and 5/6 bit/s/Hz per user from the single-sided genie-aided upper bound for restricted and non-restricted channel models, respectively.…”

Section: Introductionmentioning

confidence: 99%

“…Compute-and-forward is another strategy proposed for the TRC which uses lattice codebooks. In this method, the receiver need not decode messages directly; instead, it computes a linear equation of the messages based on the fact that integer combinations of codewords also belong to the codebook [5][6][7][8][9][10][11][12]. In [5], an achievable scheme was proposed for the TRC based on nested lattice codes, which was shown to achieve within 1/2 bit from the cut-set bound, for all channel parameters.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Approaching the capacity of two‐pair bidirectional Gaussian relay networks

Ghabeli

Derpich

2015

IET Communications

Self Cite

View full text Add to dashboard Cite

The authors present an improved achievable rate region for two-pair bidirectional Gaussian relay networks based on successive compute-and-forward method. In these networks, one relay helps in the communication between two pairs of users. In their proposed scheme, the authors use nested lattice codes for encoding the messages at the users, and Gaussian random codes for the encoding at the relay. They use the successive compute-and-forward strategy to decode two integer linear combinations of the lattice codewords in the uplink, and successive interference cancellation for decoding the Gaussian codewords in the downlink. The downlink channel can be considered as a broadcast channel with two receiver groups, but within each group, a pair of users is considered as an additive white Gaussian noise channel (instead of a broadcast channel) because each node knows its own transmitted message. It is shown that for all channel gains of downlink channels and all channel gains of symmetric uplink channel pairs, the strategy achieves rates to within constant gaps of 1/2 and 3/4 bit/s/Hz per user of the cut-set upper bound for restricted and non-restricted models, respectively. These gaps are tighter than those previously obtained for this network, which have not exploited the successive compute-and-forward method.

show abstract

Multi-way Communications: An Information Theoretic Perspective

Chaaban

Sezgin

2015

FNT in Communications and Information Theory

View full text Add to dashboard Cite

Approaching the capacity of two-way gaussian relay channel with relay private messages

Cited by 4 publications

References 7 publications

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

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

Approaching the capacity of two‐pair bidirectional Gaussian relay networks

Multi-way Communications: An Information Theoretic Perspective

Contact Info

Product

Resources

About