Degrees of Freedom of Multi-hop MIMO Broadcast Networks with Delayed CSIT

Transcription

1 Degrees of Freedom of Multi-hop MIMO Broadcast Networs with Delayed CSIT Zhao Wang, Ming Xiao, Chao Wang, and Miael Soglund arxiv:0.56v [cs.it] Oct 0 Abstract We study the sum degrees of freedom (DoF) of a class of multi-layer relay-aided MIMO broadcast networs with delayed channel state information at transmitters (CSIT). In the assumed networ a - antenna source intends to communicate to single-antenna destinations, with the help of N layers of full-duplex single-antenna relays. We consider two practical delayed CSIT feedbac scenarios. If the source can obtain the CSI feedbac signals from all layers, we prove the optimal sum DoF of the networ to be If the CSI feedbac is only within each hop, we show that when = the optimal sum DoF is 4, and when the sum DoF is achievable. Our results reveal that the sum DoF performance in the considered class of N-layer MIMO broadcast networs with delayed CSIT may depend not on N, the number of layers in the networ, but only on, the number of antennas/terminals in each layer. Index Terms Degrees of freedom, multi-hop MIMO broadcast networ, delayed CSIT, interference alignment. I. INTRODUCTION With the increasing interest in deploying relays in 4th generation mobile networs, multiuser multi-hop systems have drawn substantial research attention. In spite of the rapid advances in the understanding of single-hop networs, our nowledge on how to deal with inter-user interference and design efficient transmission schemes in multi-hop systems is relatively limited. For instance, we consider a wireless communication system in which a -antenna source intends The authors are with the Communication Theory Lab., School of Electrical Engineering, Royal Institute of Technology (TH), Stocholm, Sweden ( {zhaowang, mingx, chaowang, soglund}@th.se).

2 to communicate to single-antenna destinations. If the source s transmission can directly reach the destinations, this system is a well-studied -user MIMO broadcast channel. It is already nown that if perfect channel state information at transmitter (CSIT) is available, the optimal sum degrees of freedom (DoF) of the system is, while without CSIT the result is only one. Clearly, CSIT serves as a very important factor that influences system capacity. In practice, channel estimation is in general performed by receivers and CSIT is typically obtained via feedbac signals sent from them. However, attaining perfect instantaneous CSIT in realistic systems may be a challenging tas when feedbac delay is not negligible compared with channel coherence time. To gain understanding in such scenarios, Maddah-Ali and Tse [] proposed a delayed CSIT concept to model the extreme case where channel coherence time is smaller than feedbac delay so that CSIT would be completely outdated. They showed that by interference alignment (IA) design even the outdated CSIT can be advantageous to offer DoF gain achieving the optimal sum DoF of a -user MIMO broadcast channel communication in this single-hop networ is relatively well understood. []. Hence, from a DoF perspective, Nevertheless, if the source and the destinations are not physically connected so that the communication has to be assisted by intermediate relays, how many DoF are available is not clear, especially when potentially multiple layers of relays are required and only delayed CSIT can be available. To study the DoF of a multi-hop networ, a straightforward cascade approach sees the networ as a concatenation of individual single-hop sub-networs. The networ DoF is limited by the minimum DoF of all sub-networs. In this paper, we consider a class of relay-aided MIMO broadcast networs with a -antenna source, single-antenna destinations, and N relay layers, each containing single-antenna full-duplex relays. Following the cascade approach, the first hop can be treated as a -user MIMO broadcast channel. Each of the remaining hops can be seen as a single-antenna X channel []. Hence, the achievable sum DoF of the considered networ is 4, i.e. that of a X channel []. ( ) However, separating the networ into individual sub-networs may not always be a good strategy. For instance, provided perfect instantaneous CSIT, references [4] [6] showed that in certain systems designing transmission by treating all hops as a whole entity can perform strictly better than applying the cascade approach. In this paper, we will show that with delayed CSIT this is also the case for the considered N-layer relay-aided MIMO broadcast networs. Specifically, we focus on two delayed CSIT scenarios. In a global-range feedbac scenario, where the CSI

3 Layer- Layer- Layer- Layer-N N N N Fig.. (N, ) relay-aided MIMO broadcast networs. of all layers can be decoded by the source, we propose a joint transmission design to prove the optimal networ sum DoF to be In addition, in a one-hop-range feedbac scenario, where the CSI feedbac signals sent from each layer can only be received by its adjacent upperlayer, we show that when = the optimal sum DoF 4 is achievable, and when a DoF is achievable. These results depend not on N but only on, and are clearly better than those attained by the cascade approach. II. SYSTEM MODEL As shown in Fig., we consider a multi-hop MIMO broadcast networ in which a source node with transmit antennas intends to communicate to single-antenna destinations. There is no physical lin between them so that N (N ) layers of intermediate relay nodes, each with full-duplex single-antenna relays, are deployed to aid the communication. The networ contains a total of N layers of nodes. No connection exists between non-adjacent layers. We term this networ an (N,) relay-aided MIMO broadcast networ throughout the paper. n is used to represent the node ( {,,...,}) at layer-n (n {,,...,N}). Assume the rate tuple (R,R,...,R ) between the source and destinations can be achieved. Let C denote the capacity region and P denote the power constraint of each layer. The sum DoF of the (N,) relay-aided MIMO broadcast networ with delayed CSIT is defined as [] { } D d CSI Σ (N,) = max lim i=r i (P). () (R,...,R ) C P logp Let a matrix H [n ] (t) denote the channel matrix between the (n )th and the nth layers (i.e. the (n )th hop) at time slot t. The ith row and th column element of H [n ] (t), h [n ] i (t), represents the channel gain from node (n ) to node n i. We consider bloc fading

4 4 channels. All fading coefficients remain constant within one time slot, but change independently across different time slots. Let x [n ] (t) (E[ x [n ] (t) ] P ) and y[n] (t) represent the transmit signal of node (n ) and the received signal of node n at time slot t, respectively. The received signals of layer-n is y [n] (t) = H [n ] (t)x [n ] (t)+z [n] (t),n =,,...,N, () where x [n ] (t) = [x [n ] (t) x [n ] (t)... x [n ] (t)]t is the transmit signals of layer-(n ), y [n] (t) = [y [n] (t) y [n] (t)... y [n] (t)]t, and z n (t) is the unit-power complex additive white Gaussian noise (AWGN). At each time slot t, each receiver is able to obtain the CSI of its incoming channels by a proper training process. That is, n i nows h [n ] i (t), {,,...,}. Such nowledge can be directly delivered to nodes in later layers along with data transmission. To transmit CSI to previous layers, feedbac signals are used from each receiver. We assume that the feedbac delay is larger than the channel coherence time. Thus if any transmitter can receive and decode the feedbac signals, its obtained CSIT is in fact delayed by one time slot. In this paper, we consider two scenarios of delayed CSIT feedbac in the (N, ) relay-aided MIMO broadcast networ: ) Global-range delayed CSIT: In this scenario, the source node can receive and successfully decode the feedbac signals transmitted by all nodes. Hence it can obtain the global CSI H [] (t),h [] (t),...,h [N ] (t) at time slot t+. ) One-hop-range delayed CSIT: In this case, the feedbac signals can be delivered only between adjacent layers. Then at time slot t+, H [n ] (t) is nown at only layer-(n ). III. MAIN RESULTS AND DISCUSSIONS We study the sum DoF of the considered (N, ) relay-aided MIMO broadcast networ, for both global-range and one-hop-range delayed CSIT scenarios. Our main results are summarized in the following two theorems. Theorem : With global-range delayed CSIT, the sum DoF of the (N, ) relay-aided MIMO broadcast networ is D d CSI (N,) = () Proof: Please see Section IV for the proof.

5 5 Theorem : With one-hop-range delayed CSIT, the sum DoF of the(n, ) relay-aided MIMO broadcast networ is D d CSI (N,) = 4, Dd CSI (N,) Proof: Please see Section V for the proof ,. (4) We can see that N does not appear in () or (4). Thus, the sum DoF of the (N,) relay-aided broadcast networ would not be limited by the number of layers in the networ, but may be related only to, the number of antennas/users. With global-range feedbac, the sum DoF of the networ is the same as that in a single-hop -user MIMO broadcast channel. The result reveals the importance of providing the CSI of the whole networ to the source. In practice, this can be achieved by e.g., each node broadcasting its feedbac signal with a sufficiently high power. However, this may not be possible in some systems, and one-hop-range feedbac may be more feasible. In this case, the CSI flow is limited within only one hop, which in turn affects the interference management in the networ. When =, the sum DoF is shown to be 4, by a joint transmission design among all hops. Following a similar strategy, the sum DoF can be lower bounded by for. Although currently it is difficult to quantify the distance between this lower bound and the actual achievable sum DoF, we can see that when is small, e.g., =,4, the lower bound is tight since it is only slightly smaller than a sum DoF upper bound. Recall that applying the cascade approach the achievable sum DoF is limited by that of a X channel, i.e., 4 ( ) []. By a joint transmission design among all hops, our scheme strictly surpasses the cascade approach. The tas of proving the optimality of our results or finding even better schemes to attain the actual sum DoF of an (N,) relay-aided MIMO broadcast networ will be left for future investigation. IV. PROOF OF THEOREM ) Outer Bound: We assume that all the relays in each layer can fully cooperate and jointly process their signals. Since this assumption would not reduce networ performance, the sum DoF of this new system, which is clearly limited by that of the last hop (i.e. a single-hop -user

6 6 MIMO broadcast channel), would serve as an outer bound of the sum DoF of the considered (N, ) relay-aided broadcast networ. According to [], the outer bound is ) Achievability: Consider full-duplex amplify-and-forward relays. At time slot t, node n ( i chooses g [n] i (t) as its amplification coefficient such that g [n] ) i (t) = h[n ] i (t) +. We define G [n] (t) = diag{g [n] (t),g [n] (t),...,g [n] (t)} and focus on the high-snr regime (where DoF is effective). Hence we omit the noise term in (). At time slot t, the received signals at the layer-n (i.e. the destinations) can be denoted by ( N ) y [N] (t) = H [n ] (t)g [n ] (t) H [] (t)x [] (t). (5) n= Let H(t) = N n=( H [n ] (t)g [n ] (t) ) H [] (t) and substitute it into (5). We obtain an equivalent single-hop -user MIMO broadcast channel with an equivalent channel matrix H(t). Because the source has the delayed CSI of the whole networ, H(t ) is nown at time slot t. Thus the transmission scheme proposed in [] for achieving the sum DoF of a single-hop -user MIMO broadcast channel with delayed CSIT can also be employed in the equivalent system. The sum DoF outer bound is achievable. V. PROOF OF THEOREM Clearly, the outer bound above still holds for one-hop-range feedbac. When = it can be shown that the outer bound 4 is tight. However, it may not be true for. In this proof we will present a new multi-round transmission scheme that treats all hops as a whole entity aiming for aligning interference. The achievable sum DoF is higher than that obtained by the cascade approach and thus will serve as a lower bound to the sum DoF of the considered networ. Due to the page limitation, we will mainly focus on an example (,) relay-aided MIMO broadcast networ. Let integer l. We will show that 9l independent messages can be delivered from the-antenna source to thesingle-antenna destinations through a layer ofsingle-antenna full-duplex relays, using a total of 6l+ time slots. Then when l, the sum DoF. can be asymptotically achieved. The corresponding approach for general networs will be given later. Recall that we use y [n] (t) and x[n] (t) respectively to denote the received and transmitted signals of the th node in layer-n (or the th antenna if n = ) at time slot t. The transmission process in the (,) relay-aided MIMO broadcast networ, for the first time slots, is shown in Table I. Specifically, rounds of messages, each containing 9 independent messages, are delivered to

7 7 TABLE I x [] x [] x [] y [] y [] y [] x [] x [] x [] y [] y [] t (t) µ() µ() µ() L[] (t) ν() ν() ν() L[] 4 () L[] (t) ω() ω() ω() L[] (t) L[] (t) L[] (t) L[] () L[] 4 () L[] 5 () L[] 6 () L[] 7 () L[] 8 () L[] 9 () γ[] () γ[] () L[] 6 7 () γ[] () µ() µ() µ() L[] () L[] () () L[] 8 () L[] () γ[] () γ[] (t) L[] (t) L[] (t) L[] (t) L[] (t) L[] () L[] 4 () L[] 5 () L[] 6 () L[] 4 () L[] 5 () γ[] () L[] 7 () L[] 8 () L[] 9 () L[] 7 () L[] 8 () ν() ν() ν() L[] 4 () L[] 6 () () ω() ω() ω() L[] 7 () L[] 8 () () L[] () L[] () L[] () L[] 4 () L[] 4 () L[] 5 () L[] 6 () L[] () L[] 7 () γ[] () γ[] () L[] 7 () L[] 8 () L[] 9 () L[] 6 () γ[] () L[] () L[] 8 () γ[] () γ[] () () γ[] () γ[] () () γ[] () γ[] () () L[] () L[] () L[] () γ[] () L[] () L[] 4 () L[] 7 () () L[] 5 () L[] 8 () () L[] 6 () L[] 9 () () L[] 4 () L[] 7 () () L[] 5 () L[] 8 () y [] (t) L [] () L [] 6 () L [] 9 () γ [] () γ [] () L [] () L [] 6 () L [] 9 () the destinations. Let µ (l), ν (l), and ω (l) ( {,,}) denote the source messages intended for the destinations (the index l means that the notations apply for the lth transmission round). In what follows, we will explain the first round of transmission. It consists of two phases. Phase One: The first phase taes the first time slots. At time slot t (t {,, }), µ t (),ν t (),ω t () are transmitted by the three source antennas respectively. Hence each relay (i.e. each node of layer-) receives a linear combination of three messages at each time slot. Again, we ignore the noise in (). The received signals at is expressed as (t {,,}) y [] (t) = h[] (t)µ t()+h [] (t)ν t()+h [] (t)ω t(). (6) Let L [] (t )+ () = y[] (t) denote the linear equation nown by at time slot t. After the rd time slot, since H [] (), H [] (), and H [] () are nown at the source, all the equations L [] i (), i =,,,9, can be recovered by the source. Phase Two: This phase taes the next 6 time slots after phase one. At each time slot t (t {,4,5}) only two source antennas are activated to retransmit the equations L [] i (). According to x [] (t) shown in Table I, we have y [] (4) = h[] (4)L[] ()+h [] (4)L[] 4 (); (7) y [] (5) = h[] (4)L[] ()+h [] (4)L[] 7 (); (8)

8 8 y [] (6) = h[] (4)L[] 6 ()+h[] (4)L[] 8 (). (9) Since node obtains L [] 4 () in phase one, at time slot 4 it can recover L [] (). Similarly, both L [] () and L[] 4 () are also nown at node. Use γ [n] (l) = (a,b) to represent that equations a and b are recovered by both nodes n i and n j. As shown in Table I, we can replace both y [] (4) and y [] (4) with γ [] () = (L [] (),L [] 4 ()). Clearly, we also have γ [] () = (L [] (),L [] 7 ()) and γ [] () = (L[] 6 (),L[] 8 ()). Meanwhile, the relay nodes also send the equations they received in phase one to the destinations, as shown in Table I. The received equations at the destinations are: ij y [] (4)=h[] (4)L[] ()+h [] (4)L[] ()+h [] (4)L[] (), (0) y [] (5)=h[] (5)L[] 4 ()+h[] (5)L[] 5 ()+h[] (5)L[] 6 (), () y [] (6)=h[] (6)L[] 7 ()+h [] (6)L[] 8 ()+h [] (6)L[] 9 (). () Let L [] (t 4)+ () = y[] (t). Clearly, if the destination nows the three equations L [] (), L [] (), L [] (), it can recover its desired messages µ (), ν (), ω (). After time slot 6, the node has L [] (). Thus if L[] () and L[] () can be provided to node, the problem is solved. Similarly, having L [] 5 (), the destination needs L [] 4 () and L [] 6 () to recover µ (),ν (),ω (). L [] 7 () and L [] 8 () are desired by the destination, who already has L [] 9 (), to recover µ (), ν (), ω (). Therefore, we aim to deliver these six equations from the relays to the destinations in the next three time slots. According to the above description, we can see that after time slot 6, node nows the equations L [] (), L[] () and L[] (). Node nows the equations L [] 4 (), L[] 5 () and L[] 6 (). Node nows the equations L [] 7 (), L [] 8 () and L [] 9 (). Since the channel matrices H [] (4), H [] (5), and H [] (6) are available at all nodes in layer-, the node can formulate the equations L [] () and L[] () using (0). Similarly, the node can formulate the equations L [] 4 () and L [] 6 () according to (). The node can formulate the equations L [] 7 () and L [] 8 () using (). At time slot 7, let transmit L [] () and transmit L [] 4 (), as shown in Table I. Node, which already nows L [] 4 (), can recover L [] () by eliminating L [] 4 () from its received signal. The node can also attain both L [] () and L[] 4 (), following the similar approach. Thus the received signals y [] (7) and y [] (7) in Table I can be replaced with a simpler expression

9 9 γ [] () = (L [] (),L [] 4 ()). Then we can also have γ [] () = (L [] (),L [] 7 ()) and γ [] () = (L [] 6 (),L [] 8 ()), at the 8th and 9th time slots, respectively. Consequently, equations L [] (), L [] (), and L [] () are nown at the destination. The desired messages can be recovered now. The same result holds also for the destinations and. 9 independent messages are delivered successfully from the source to the destinations in one transmission round. The same process can continue until l rounds of transmissions are finished using a total of 6l+ time slots (the second round transmission is shown in Table I partially). When l, this scheme achieves a sum DoF. The lower bound for Dd CSI (,) is proven. To generalize this scheme ton (N>) layers, we first denote the messages from the source as: L [] ( )+ (l) = µ (l), L [] ( )+ (l) = ν (l) and L [] ( )+ (l) = ω (l). The lth-round transmission at layer-n (n {,,...,N }) can be denoted by the following formula. It taes the time slots t = 6(l )+(n )+ˆt (ˆt =,,...,6): {L [n] (ˆt )+ (l)} = ˆt =,,; [L [n+] x [n] (l),l [n+] 4 (l),0] T ˆt = 4; (t) = [L [n+] (l),0,l [n+] 7 (l)] T ˆt = 5; () Here {L [n] (ˆt )+ (l)} i= [0,L [n+] 6 (l),l [n+] 8 (l)] T ˆt = 6. represents the column vector composed by L[n] (l) ( {,,}). (ˆt )+ We denote the received equation at node(n+) when ˆt {,,} as L [n+] (l) = (ˆt )+ i= h[n] i (t) L [n] (l). By induction, we assume n (ˆt )+i can recover L [n+] ( )+i (l) after the first three time slots (i {,,}). Then the transmission can be designed as shown in () when ˆt {4,5,6}. Therefore, (n+) and (n+) can recover γ [n+] (l)=(l [n+] (l),l [n+] 4 (l)); (n+) and (n+) can recover γ [n+] (l)=(l [n+] (l),l [n+] 7 (l)); and (n+) and (n+) can recover γ [n+] (l) = (L [n+] 6 (l),l [n+] 8 (l)) after time slot 6l+(n ). Since the destinations refer to the Nth layer, the l-round transmission taes 6l+(N ) time slots to deliver 9l independent messages. The achievable sum DoF is 9l 6l+(N ) when l. The result still holds for >. Now we consider =. In this case, 4 messages are delivered using time slots. Let L [] = µ and L [] = ν denote the messages for the first destination, and L [] = µ and L [] 4 = ν denote those for the second destination. During time slot, the nodes (or antennas) n and n (n {,,,N}) send L [n] and L [n], respectively. The received signal at node (n+)

10 0 ( {,}) is L [n+] = h [n] ()L[n] +h [n] ()L[n]. During time slot, n sends L [n] and n sends L [n] 4. (n + ) receives L [n+] + = h [n] ()L[n] + h [n] ()L[n] 4. Assume n can recover L [n+], and n can recover L [n+]. During time slot, n and n transmit L [n+] and L [n+], respectively. Since (n+) nows L [n+], it can recover L [n+]. Similarly, (n+) can recover L [n+]. As a result, the destination N can thus obtain both µ and ν because it can have L [N] and L [N]. The destination N can obtain µ and ν from L [N] and L [N] 4. The achieved sum DoF is 4 the upper bound. to meet VI. CONCLUSIONS We investigate the sum DoF of a class of multi-hop MIMO broadcast networ with delayed CSIT feedbac. Our results show the transmission design by treating the multi-hop networ as an entity can achieve better sum DoF than the cascade approach which separates each hop individually. REFERENCES [] M. A. Maddah-Ali and D. Tse, Completely stale transmitter channel state information is still very useful, in 00 Allerton Conference. [] V. R. Cadambe and S. A. Jafar, Interference alignment and the degrees of freedom of wireless X networs, IEEE Trans. Inform. Theory, vol. 55, pp , Sep [] M. J. Abdoli, A. Ghasemi, and A.. handani, On the degrees of freedom of -user SISO interference and X channels with delayed CSIT. [Online]. Available: [4] S. W. Jeon, S. Y. Chung, and S. A. Jafar, Degrees of freedom of multi-source relay networs, in 009 Allerton Conference. [5] T. Gou, S. A. Jafar, S. W. Jeon, and S. Y. Chung, Aligned interference neutralization and the degrees of freedom of the xx interference channel, IEEE Trans. Inform. Theory, vol. 58, pp , Jul. 0. [6] C. Wang, H. Farhadi, and M. Soglund, Achieving the degrees of freedom of wireless multi-user relay networs, IEEE Trans. Commun., To appear.