Rate Bounds for MIMO Relay Channels Using Precoding Caleb K. Lo, Sriram Vishwanath and Robert W. Heath, Jr. Wireless Networking and Communications Group Department of Electrical and Computer Engineering The University of Texas at Austin GLOBECOM 2005

Outline  Motivation  SISO vs. MIMO Relay Channels  Prior Work  Problem Statement  Message Splitting  Results  Conclusions

Motivation  Mesh network: self-organizing wireless nodes  Relay channel: fundamental building block SenderReceiver Intermediate Node Large Distance Shorter Distance

SISO Relay  Assume decode-and-forward at relay  If relay is not useful h1h1 h3h3 h2h2 Sender Relay Receiver

MIMO Relay  Assume decode-and-forward at relay  H 1, H 2 and H 3 generally cannot be compared H1H1 H3H3 H2H2 Relay Sender Receiver

Prior Work  Cover and El Gamal (ITIT ’79)  Rate bounds for general full-duplex relay channel  Wang, Zhang and Host-Madsen (ITIT ’05)  Rate bounds for Gaussian MIMO relay channel  Non-cooperative lower bound for fixed channels

System Model

Problem Statement  Want tighter lower bounds for MIMO relay  Assumptions  Fixed channel gains  Full CSI at all terminals  Full-duplex decode-and-forward relaying  Our contribution  Improved lower bounds via transmit precoding

Message Splitting  Relay treats V as interference H1H1 H3H3 H2H2 Relay Sender Receiver X 1 = X 1 (U,V) X 2 = X 2 (U)

Superposition Coding  Relay only decodes U  Rx decodes both U and V SenderReceiver Relay X 1 = U + V X 2 = X 2 (U)X 1 = U + V

Dirty-Paper Coding  Coding in presence of known interference (from C.B. Peel, “On Dirty-Paper Coding,” IEEE Sig. Proc. Mag., May 2003, pg )

Rate Bound Results (1/6)  Cover and El Gamal result  Superposition Coding X 1 = U + V Tx Relay Rx X 1 = U + V X 2 = X 2 (U)

Rate Bound Results (2/6)  Superposition Coding for Gaussian MIMO

Rate Bound Results (3/6)  Cover and El Gamal result  Dirty-Paper Coding Tx Relay Rx X 1 = X 1 (U,V) X 2 = X 2 (U)

Rate Bound Results (4/6)  Dirty-Paper Coding for Gaussian MIMO

Rate Bound Results (5/6) H1H1 H3H3 H2H2 Relay Sender Receiver  Precoding-based bounds significantly outperform Wang et al. lower bound

Rate Bound Results (6/6) H2H2 H1H1 H3H3 Relay Sender Receiver  Precoding-based bounds very close to Wang et al. cut-set upper bound

Conclusions  Variable cooperation level yields rate benefits in MIMO relay channel  New tight lower capacity bounds achieved via transmit precoding  Considered DMC and Gaussian cases