Title :
MIMO compute-and-forward
Author :
Zhan, Jiening ; Nazer, Bobak ; Gastpar, Michael ; Erez, Uri
Author_Institution :
EECS Dept., Univ. of California, Berkeley, Berkeley, CA, USA
fDate :
June 28 2009-July 3 2009
Abstract :
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.
Keywords :
MIMO communication; antenna arrays; channel coding; multiplexing; radio receivers; radio transmitters; radiofrequency interference; MIMO compute-and-forward; channel interference structure; channel state information; lattice code; multiple antenna setting; multiple-access strategy; multiplexing gain; network communication scenario; receiver; transmitter; Channel state information; Code standards; Equations; Lattices; MIMO; Multiple access interference; Receiving antennas; Relays; Transmitters; Transmitting antennas;
Conference_Titel :
Information Theory, 2009. ISIT 2009. IEEE International Symposium on
Conference_Location :
Seoul
Print_ISBN :
978-1-4244-4312-3
Electronic_ISBN :
978-1-4244-4313-0
DOI :
10.1109/ISIT.2009.5205264