Capacity of Two-Way Linear Deterministic Diamond Channel

Transcription

1 Capacity of Two-Way Linear Deterministic Diamond Channel Mehdi Ashraphijuo Columbia University Vaneet Aggarwal Purdue University Xiaodong Wang Columbia University Abstract In this paper, we study the capacity regions of two-way linear deterministic diamond channels. We show that the capacity of the diamond channel in each direction can be simultaneously achieved for all values of channel parameters, where the forward and backward channel parameters are not necessarily the same. We propose a relay strategy called reverse amplify-and-forward strategy and show that this strategy and its variants combined with proper transmission strategies achieve the capacity of linear deterministic diamond channel. I. INTRODUCTION Two-way communication between two nodes was first studied by Shannon [1]. There have been many attempts recently to demonstrate two-way communications experimentally [2, 3]. The two-way relay channel where two nodes communicate to each other in the presence of a single relay, has been widely studied [4, 5]. In this paper, we will consider the two-way diamond channel, where two nodes communicate to each other in the presence of two relays. Also, [6, 7] consider different kinds of collaboration between the nodes. The diamond channel was first introduced in [8], and consists of one transmitter, two relays and a receiver. The twoway half-duplex K-relay channel has been studied using the amplify-and-forward strategy at the relays [9, 10]. The design of relay beamformers based on minimizing the transmit power subject to the received signal-to-noise ratio constraints was considered in [10]. Furthermore, achievability schemes using time-sharing are investigated in [11] for a symmetric reciprocal diamond channel with half-duplex nodes and the inner and outer bounds are compared using simulations. However, we show that the achievability scheme in [11] has an unbounded gap from the capacity. None of the prior works gave a capacity achieving strategy for a two-way full-duplex diamond channel. In this paper, we consider a linear deterministic model which was proposed in [12], and has been shown to lead to approximate capacity results for Gaussian channels in [5, 13, 14]. We study the capacity region of a two-way linear deterministic diamond channel where the forward and backward channel gains are not necessarily the same. We find that the capacity in each direction can be simultaneously achieved. Thus, each user can transmit at a rate which is not affected by the fact that the relays receive the superposition of the signals. In order to achieve the capacity in each direction separately, we develop new transmission strategies by the transmitters and the relays. The strategies proposed for the one-way diamond channel in [12] do not directly work for two-way channels. The reason is that they are dependent on the channel parameters in the forward direction; but for two-way channels we need a strategy that is optimal for both directions. For the special case when the diamond channel reduces to a two-way relay channel (channel gains to and from one of the relays are zeros), our proposed strategy reduces to a reverse amplifyand-forward strategy, where the relay reverses the order of the received signals to form the transmitted signal. The proposed strategy in this case is different from the one in [5] for twoway relay channels, since the relay strategy in [5] depends on the channel parameters, while ours simply reverses the order of the input. On the other hand, the transmission strategy at the source nodes in our approach is dependent on the channel parameters unlike that in [5]. Thus, the proposed strategy in this paper makes the relay strategy simpler by compensating in the transmission strategy at the source nodes. For a general two-way diamond channel, we give different strategies based on the parameters of both the forward and backward channels. Depending on the forward and backward channel gains we consider four cases; these cases are further subdivided. Two special cases are Cases and Our first main result is that if neither the forward, nor the backward channel is of one of these two cases, then the proposed reverse amplify-and-forward strategy at the relays is optimal. We next consider the case that exactly one of the forward and backward channels is of Case or Without loss of generality, we assume that the forward channel is of one of the two mentioned cases. For each of these two cases, we give four new strategies at the relay which involve various modifications to the reverse amplify-and-forward strategy, such as repeating some of the streams on multiple levels or changing the order of transmission at some levels at one of the relays. Furthermore, the transmission strategy for the forward direction is rather straightforward by simply sending capacity number of bits at the lowest levels. We show that all these modified strategies achieve the capacity in the forward direction. The choice of the strategies then depends on the parameters in the backward direction. We show that for each case of the backward channel, at least one of the four proposed strategies achieves the capacity for the backward direction. Finally, the case when both the forward and backward channels are of Case or is considered. Here, a modified form of the relay strategies proposed above is used to achieve the capacity in both directions /15/$ IEEE 1896 ISIT 2015

2 II. CHANNEL MODEL The linear deterministic channel model was proposed in [12] to focus on signal interactions instead of the additive noise, and to obtain insights for the Gaussian channel. A two-way diamond channel consists of two nodes (denoted by A and B) who wish to communicate to each other through two relays (denoted by R 1 and R 2 ). We use non-negative integers n Ak, n Bk, n ka, and n kb, to represent the channel gains from node A to R k, node B to R k, R k to node A, and R k to node B, respectively, for k {1, 2}. In this paper, the links in the direction from A to B are said to be in the forward direction and those from B to A are in the backward direction. Let us define q AR max k {n Ak }, q RB max k {n kb }, q BR max k {n Bk }, q RA max k {n ka }, qk I max{n Ak, n Bk }, and qk O max{n ka, n kb } for k {1, 2}. Furthermore, denote the channel input at transmitter u, for u {A, B}, at time i as X u,i = F 2 q ur, such that X 1 u,i and XquR u,i [X qur u,i,, X2 u,i, X1 u,i ]T represent the least and the most significant bits of the transmitted signal, respectively. Also, we define Xuk,i R = [X qur u,i,, XquR nuk+2 u,i, X qur nuk+1 u,i, 0,..., 0 }{{} ]T, for k qk I nuk {1, 2}. At each time i, the received signal at R k is given by Y k,i = D qi k nak q I k XAk,i R + D qi k nbk X R qk I Bk,i mod 2, (1) where D q I k is a qk I qi k shift matrix as Eq. (9) in [12]. Also if we have Y k,i = [Y qi k k,i,, Y k,i 2, Y k,i 1 ]T, define V k,i = [0,, 0, Y min(qi k,qo k ) k,i,, Yk,i 2, Y k,i 1 ]T, for k {1, 2}, where the first (qk O qi k )+ elements of V k,i are zero. Furthermore, define T k,i f k,i (V k,1,..., V k,i 1 ) where ( ) i 1 f k,i : R qo k R q O k is a function at Rk which converts V k,1,..., V k,i 1 to the output signal at time i. We represent [ ] T T k,i s elements as T k,i = Tk,i 1, T k,i 2,, T qo k k,i. Also, we define T ku,i = [T k,i 1, T k,i 2,, T nku k,i, 0,..., 0 ] }{{} T for u {A, B}. q Ru n ku At each time i, the received signal at the receivers u {A, B} is given by 2 Y u,i = Dq qru nku Ru T ku,i mod 2. (2) k=1 Source u picks a message W u that it wishes to communicate to ū (u, ū {A, B}, u ū), and transmits signal at each time i which is a function of W u and Yu i 1 = {Y u,i 1, Y u,i 2,..., Y u,1 }. Each destination ū uses a decoder, which is a mapping gū : R m Wū {1,..., W u } from the m received signals and the message at the receiver to the source message indices ( W u is the number of messages of node u that can be chosen). We say that the rate pair log WA (R A m, R log WB B m ) is achievable if the probability of error in decoding both messages by their corresponding destinations can be made arbitrarily close to 0 as m. The capacity region is the convex hull of all the achievable rate pairs (R A, R B ). III. CAPACITY OF TWO-WAY LINEAR DETERMINISTIC DIAMOND CHANNEL In this section, we state the main result that the cut-set bound for the diamond channel in each direction can be simultaneously achieved, thus giving the capacity region for the two-way linear deterministic diamond channel. It can be seen that max{n A1, n A2 } and max{n 1B, n 2B } are cut-set bounds on the transmissions from A and to B, respectively. Moreover, n A1 + n 2B and n A2 + n 1B are cut-set bounds on the sum of the two paths for the transmission from A to B. The same observation can be made for the other direction. Theorem 1. For the two-way linear deterministic diamond channel, the capacity region is given as follows: R A C AB min{max{n A1, n A2 }, max{n 1B, n 2B }, n A1 + n 2B, n A2 + n 1B }, (3) R B C BA min{max{n B1, n B2 }, max{n 1A, n 2A }, n B1 + n 2A, n B2 + n 1A }. (4) We note that the outer-bound is the cut-set bound, and thus the proof is straightforward. We will prove the achievability of the rate pair (C AB, C BA ). We consider four main cases and several subcases depending on the forward channel parameters as follows. Case 1: C AB = n A2 + n 1B. Case 2: C AB = n A1 + n 2B. Case 3: C AB = max{n A1, n A2 }. We call it Type 1, if max{n A1, n A2 } = n A1, and Type 2 otherwise. For Type i, where i, j {1, 2}, i j, we have: Case 3.1: n ib < C AB. We divide it into two sub-cases: Case 3.1.1: n jb n Aj + n ib. Case 3.1.2: n jb < n Aj + n ib. Case 3.2: n ib C AB. Case 4: C AB = max{n 1B, n 2B } We call it Type 1, if max{n 1B, n 2B } = n 1B, and Type 2 otherwise. For Type i, where i, j {1, 2}, i j, we have: Case 4.1: n Ai < C AB. We divide it into two sub-cases: Case 4.1.1: n Aj n jb + n Ai. Case 4.1.2: n Aj < n jb + n Ai. Case 4.2: n Ai C AB. Similarly we divide the backward channel into four main cases and several subcases where the case definition is obtained by interchanging A and B in the forward direction cases. For instance, Case 1 in the backward direction is C BA = n B2 + n 1A. We divide the proof into three parts, depending on the cases in which forward and backward channel gain parameters lie. The first part is when neither the forward channel nor the backward channel is of Case or (Section III-A). The second part is when exactly one of the forward and backward channels is of Case or (Section III-B). And finally the third part is when both the forward and backward channels are of Case or (Section III-C). 1897

3 A. Neither the forward channel nor backward channel is of Case or In this scenario, we use a reverse amplify-and-forward strategy in the relays to achieve the rate pair (C AB, C BA ). Assume a particular relay (say R i ) gets n Ai levels from node A and n Bi levels from node B and transmits qi O levels. It receives Y A1 = [a nai,..., a 1 ] T from node A and Y B1 = [b nbi,..., b 1 ] T from node B. Then it sends out the following signal to nodes A and B X Ri = a 1. a min(nai,q O i ) 0 (q O i n Ai) + + b 1. b min(nbi,q O i ) 0 (q O i n Bi) + mod 2. (5) We call this relay strategy as Relay Strategy 0 (also called reverse amplify-and-forward ). We will keep the strategy at the relays the same, and for different cases use different strategies for transmission at nodes A and B. Since we need to show that the rate pair (C AB, C BA ) is achievable, it is enough to show that there is a transmission strategy for node A such that with the above relay strategy, node B is able to decode the data in a one-way diamond channel because any interference by node B on the received signal can be canceled by node B which knows the interfering signal (Showing it for one direction is enough since the same arguments hold for the other). Thus, we only consider one-way diamond channel for this case. We further consider the case when n A1, n A2, n 1B, n 2B > 0 since otherwise the diamond channel reduces to a relay channel or no connection between the nodes A and B, and in both cases it is easy to see that node A sending C AB bits on the lowest levels achieves this rate in the forward direction. It has been shown in Appendix 1 of [15] that there is a transmission strategy for each of the cases (except for Case or 4.1.2) such that the above relay strategy achieves the capacity for one-way diamond channel. B. Exactly one of the forward and backward channels is of Case or We assume that the forward channel is of Case or without loss of generality. The other case where the backward channel is of Case or can be proven symmetrically. Since we need to show that the rate pair (C AB, C BA ) is achievable, we will describe a few relay strategies for which the same transmission strategy is used at node A such that node B is able to decode the corresponding message. Furthermore, we will show that at least one of these strategies is optimal for the backward channel for each case of the backward channel parameters. As before we consider the case when n A1, n A2, n 1B, n 2B > 0. In the remainder of this section, we assume that the forward channel is of Case The case that the forward channel is of Case is treated in Appendix 2 of [15]. When the forward channel is of Case 3.1.2, node A transmits [a CAB,..., a 1 ] T. Also, the transmission strategy for node B depends on the channel gains in the backward direction. For the relay strategy, we will choose one of the four strategies explained in the following depending on the backward channel parameters. We prove that all of these strategies are optimal for the forward channel for any set of parameters. The parameters associated with each relay strategy proposed here are only based on the forward channel gains, and we will show that at least one of the proposed strategies is optimal for each choice of the backward channel parameters. Note that using Relay Strategy 0 in both relays, node B cannot necessarily decode the message if the forward channel is of Case or 4.1.2, when the above transmission strategy is used by node A. Remark 1. All relay strategies in this subsection are defined with respect to the forward channel parameters (and in favor of the forward channel direction 1 ) because we assumed that the forward channel is either of Case or and the backward channel is not of these cases. We note that Relay Strategy 0 is symmetric and is not dependent on the channel gains in any direction. In Section III-C, we will generalize some of these strategies to be based on the parameters of both the forward and backward channels. 1) Relay Strategy 1:: If the forward channel is of Case Strategy 1 is used at R ī, where i, ī {1, 2}, i ī. Here, we define Relay Strategy 1 at R 2 (forward channel of Case roles of relays R 1 and R 2 (interchanging 1 and 2 and forward channel of Case Type 2). As shown in Figure 1, if R 2 receives a block of n 2B bits, first it will reverse them as in Relay Strategy 0 and then changes the order of the first n 1B (n A1 n A2 ) streams 2 with the next n A1 n 1B streams. Node A transmits [a CAB,..., a 1 ] T. The received signals can Fig. 1. Relay Strategy 1 at R 2. be seen in Figure 2. We use (R i, B j ) to denote block number j from R i. Bits that are not delivered to node B from R 1 using Relay Strategy 0, (a n1b+1,..., a na1 ), are all sent at the highest levels from R 2 to node B and thus are decoded with no interference (block (R 2, B 1 )). The remaining bits can be decoded by starting from the lowest level of reception in B (a n1b in block (R 1, B 4 )) and removing the effect of the decoded bits and going up. 1 In the sense that the strategies are designed so that the forward communication achieves the capacity. 2 In the following relay strategies, we divide the streams into multiple substreams. The number of streams in each sub-stream is a non-negative number when the forward channel is of Case Type

4 levels Contribution from relay Contribution from relay Fig. 2. by using Relay Strategy 1 when the forward channel is of Case Type 1. 2) Relay Strategy 2:: If the forward channel is of Case Strategy 2 is used at R ī, where i, ī {1, 2}, i ī. Here, we define Relay Strategy 2 at R 2 (forward channel of Case roles of R 1 and R 2 (interchanging 1 and 2 and forward channel of Case Type 2). It is similar to Relay Strategy 0 with the only difference that R 2 repeats a part of the top n A2 streams after reverse-amplify-and-forward, as explained below in nine separate scenarios based on the parameters of the forward channel. We note that the repetition of streams is based on the received signal at the relay. However, we describe only the forward direction to show that the messages can be decoded. We partition the four-dimensional space (n A1, n A2, n 1B, n 2B ) into multiple parts, and we consider one of the case below. The proof for the rest of cases is given in Section IV of [15]. This case corresponds to {n 2B + (n A1 n A2 ) n A2 + n 1B, n 1B (n A1 n A2 ) + (n 2B n 1B )}. Figure 3 depicts the received signal at node B (ignoring the effect of transmitted signal from B) assuming that both relays use Relay Strategy 0. The repetitions will be described below to show that messages can be decoded with the proposed strategies. R 2 repeats the Contribution from relay Contribution from relay Block No Block No from the other relay. Then, subtract the corresponding signals (blocks (R 1, B 3 ) and (R 1, B 4 )). Furthermore, block (R 2, B 4 ) can be decoded from repetitions because their interference is already decoded. Then, subtract the corresponding signals (block (R 2, B 2 )). Consequently, block (R 1, B 2 ) are decoded because their interference (block (R 2, B 2 )) was decoded earlier. Finally, block (R 2, B 3 ) can be decoded because all its interference signals have been decoded. 3) Relay Strategy 3:: If the forward channel is of Case Strategy 3 is used at R ī, where i, ī {1, 2}, i ī. Here, we define Relay Strategy 3 at R 2 (forward channel of Case roles of relays R 1 and R 2 (interchanging 1 and 2 and forward channel of Case Type 2). As shown in Figure 4, if R 2 receives a block of n 2B bits, first it will reverse them as in Relay Strategy 0 and then changes the order of the n A2 (n 2B n 1B ) streams right after the first n 2B n 1B streams, with the following n 2B n A2 streams. Node A Fig. 4. Relay Strategy 3 at R 2. transmits [a CAB,..., a 1 ] T, and it can be shown to be decoded at node B. 4) Relay Strategy 4:: If the forward channel is of Case Type i, then Relay Strategy 0 is used at R ī, where i, ī {1, 2}, i ī, and Relay Strategy 4 is used at R i. Here, we define Relay Strategy 4 at R 1 (forward channel of Case Type 1), while that for R 2 can be obtained by interchanging roles of R 1 and R 2 (interchanging 1 and 2 and forward channel of Case Type 2). As shown in Figure 5, if R 1 receives a block of n 1B bits, first it will reverse them as in Relay Strategy 0 and then changes the order of the first n A1 n A2 streams with the next n 1B (n A1 n A2 ) streams. Node A Fig. 3. The received signals at node B (ignoring the effect of transmitted signal from B) assuming that both relays use Relay Strategy 0 for channel parameters of case {n 2B + (n A1 n A2 ) n A2 + n 1B, n 1B (n A1 n A2 ) + (n 2B n 1B )}. streams in block (R 2, B 2 ) on block (R 2, B 4 ). Using this strategy, block (R 2, B 1 ) will be decoded from the top levels of the received signal from R 2 since there is no interference Fig. 5. Relay Strategy 4 at R 1. transmits [a CAB,..., a 1 ] T. Bits that are not delivered to node B from R 2 using Relay Strategy 0 in the block (R 1, B 4 ) are decoded without any interference. The remaining bits can be decoded by starting from the highest level (a na1 n A2+1 in block (R 2, B 1 )) and removing the effect of the decoded bits. 1899

5 These strategies can be used at different relays to achieve the optimal rate. For instance, if the backward channel is of Case 1 and the forward channel is of Case Type 1, the following strategy is used. If n A2 > n B2, we use Relay Strategy 2 at R 2 and Relay Strategy 0 at R 1. Otherwise use Relay Strategy 1 at R 2 and Relay Strategy 0 at R 1. If n A2 > n B2, R 2 repeats from the streams that are already decoded from the highest levels received in A, on the lower levels, and otherwise it just changes the order of some of the equations at the highest levels received in A, which does not affect the decoding. Four new relay strategies are needed for Case 4.1.2, whose details can be seen in [15]. C. Both the forward and backward channels are either of Case or In Section III-B, we used Relay Strategy 2 or Relay Strategy 6 as one of the achievability strategies when the forward channel is of Case or 4.1.2, respectively. In this section, we show that using a modified combination of these strategies achieve the optimal capacity region when both the forward and backward channels are either of Case or We will define Relay Strategy (m i, n i ) at R i for i {1, 2}, m i, n i {0, 2, 6}. If the forward channel is of Case 3.1.2, at R 1, we use m 1 = 0 when the forward channel is Type 1 and m 1 = 2 otherwise. At R 2, we use m 2 = 2 when the forward channel is Type 1 and m 2 = 0 otherwise. If the forward channel is of Case 4.1.2, at R 1, we use m 1 = 6 when the forward channel is Type 1 and m 1 = 0 otherwise. At R 2, we use m 2 = 0 when the forward channel is Type 1 and m 2 = 6 otherwise. The value of n i is determined the same way based on the backward channel parameters. Relay Strategy (m i, 0) at R i uses Relay Strategy m i at R i based on the forward channel parameters, and Relay Strategy (0, n i ) at R i uses Relay Strategy n i based on the backward channel parameters. For the remaining strategies (m i, n i ) {(2, 2), (2, 6), (6, 2), (6, 6)} at R i, we use the combination of the repetitions suggested by Relay Strategies m i based on the forward channel parameters, and n i based on the backward channel parameters. If these two repetitions happen at the same level, we sum these modulo 2. However, there are some modifications to account for repetitions adding to zero modulo 2, or multiple repetitions due to different strategies at the relays. The modifications are as follows. 1) If the repetitions happen in the same relay, i.e., m 1 = n 1 = 0 or m 2 = n 2 = 0: In case the repetition of a particular signal by both the forward and backward strategies is suggested at the same level, we send the repeated signal. If different repeated signals are suggested at a particular level, we send the sum of these two signals modulo two. 2) If the repetitions happen in different relays, i.e., m 1 = n 2 = 0 or m 2 = n 1 = 0, we consider two cases. In case that the repetitions of some streams from two relays are from the same level and are repeated on the same level at node B (ignoring the backward signal component) R i skips repetitions at the corresponding levels if the forward channel is of Case Type i and R ī skips repetitions at the corresponding levels if the forward channel is of Case Type i. In case that the repetitions of some streams from two relays are from the same level and are repeated on the same level at node A (ignoring the forward signal component) R i skips repetitions at the corresponding levels if the backward channel is of Case Type i and R ī skips repetitions at the corresponding levels if the backward channel is of Case Type i. We use the same transmission strategy as in Section III-B for channel of both Cases and 4.1.2, and the decoding of the messages at the receivers can be shown. Detailed proofs can be seen in [15]. IV. CONCLUSIONS In this paper, we studied the capacity of the bidirectional (or two-way) diamond channel with two nodes and two relays. We used the deterministic approach to capture the essence of the problem and to determine capacity-achieving transmission and relay strategies. Depending on the forward and backward channel gains, we used either a reverse amplify-and-forward or a particular modified strategy involving repetitions, and reversing order of some streams at the relays. REFERENCES [1] C. Shannon, Two-way communication channels, in Proc. 4th Berkeley Symp. Mathematical Statistics Probability, 1961, pp [2] S. Chen, M. Beach, and J. McGeehan, Division-free duplex for wireless applications, Electronics Letters, vol. 34, no. 2, pp , Jan [3] A. K. Khandani, Methods for spatial multiplexing of wireless twoway channels, US patent, filed Oct (provisional patent filed Oct. 2005), issued Oct [4] B. Rankov and A. Wittneben, Achievable rate regions for the two-way relay channel, in Proc. IEEE Int. Symp. Inform. Theory (ISIT), Jul. 2006, pp [5] A. Avestimehr, A. Sezgin, and D. Tse, Capacity of the two-way relay channel within a constant gap, European Transactions on Telecommunications, vol. 21, no. 4, pp , Jun [6] M. Ashraphijuo, V. Aggarwal, and X. Wang, On the capacity region and the generalized degrees of freedom region for MIMO interference channel with feedback, IEEE Trans. Inform. Theory, vol. 59, no. 12, pp , Dec [7], On the capacity and degrees of freedom regions of two-user MIMO interference channels with limited receiver cooperation, IEEE Trans. Inform. Theory, vol. 60, no. 7, pp , Jul [8] B. Schein, Distributed coordination in network information theory, Ph.D. Dissertation, Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, [9] R. Vaze and R. W. Heath, On the capacity and diversity-multiplexing tradeoff of the two-way relay channel, IEEE Trans. Inform. Theory, vol. 57, no. 7, pp , Jul [10] T. Mirfakhraie, Optimal three-time slot distributed beamforming for two-way relaying, M.Sc. Dissertation, Ontario Institute of Technology, Dept. of Electrical and Computer Engineering, [11] A. T. P. V, S. Bhashyam, The gaussian two-way diamond channel, in Annual Allerton Conference on Communication, Control, and Computing, Oct [12] A. Avestimehr, S. Diggavi, and D. Tse, Wireless network information flow: A deterministic approach, IEEE Trans. Inform. Theory, vol. 57, no. 4, pp , Apr [13] M. Ashraphijuo, V. Aggarwal, and X. Wang, On the symmetric K-user interference channels with limited feedback, Submitted to IEEE Trans. Inform. Theory, arxiv: , Mar [14] A. Vahid, C. Suh, and A. Avestimehr, Interference channels with ratelimited feedback, IEEE Trans. Inform. Theory, vol. 58, no. 5, pp , May [15] M. Ashraphijuo, V. Aggarwal, and X. Wang, On the capacity regions of two-way diamond channels, Submitted to IEEE Trans. on Inf. Theory, ArXiv: , Oct