MIMO Compute-and-Forward

In many network communication scenarios, a relay in the network may only need to recover and retransmit an equation of the transmitted messages. In previous work, it has been shown that if each transmitter employs the same lattice code, the interference structure of the channel can be exploited to recover an equation much more efficiently than possible with standard multiple-access strategies. Here, we generalize this compute-and-forward framework to the multiple antenna setting. Our results show that it is often beneficial to use extra antennas at the receiver to rotate the channel coefficients towards the nearest integer vector instead of separating out the transmitted signals. We also demonstrate that in contrast to classical strategies, the multiplexing gain of compute-and-forward increases if the transmitters have channel state information. Finally, we apply our scheme to the two way relay network and observe performance gains over traditional strategies.

Published in:
2009 Ieee International Symposium On Information Theory, Vols 1- 4, 2848-2852
Presented at:
IEEE International Symposium on Information Theory (ISIT 2009), Seoul, SOUTH KOREA, Jun 28-Jul 03, 2009
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa

 Record created 2011-10-17, last modified 2018-03-17

Rate this document:

Rate this document:
(Not yet reviewed)