Compute-and-forward in the two-hop multi-antenna X-channel
- 1 May 2012
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
Abstract
We utilize the compute-and-forward and inverse compute-and-forward schemes in a two-hop multi-antenna X-channel. We introduce the beamforming problems and compare numerical results to a network coding scheme with decode-and-forward. Furthermore, we derive conditions under which compute-and-forward and inverse compute-and-forward achieve higher sum rate than network coding and decode-and-forward. Finally, we illustrate the results by numerical simulations.Keywords
This publication has 8 references indexed in Scilit:
- Compute-and-Forward: Harnessing Interference Through Structured CodesIEEE Transactions on Information Theory, 2011
- Computation alignment: Capacity approximation without noise accumulation2011
- Achievable rate regions in multiple-antenna networks with linear network coding2011
- Reliable Physical Layer Network CodingProceedings of the IEEE, 2011
- New results on Hermitian matrix rank-one decompositionMathematical Programming, 2009
- Lattices are everywhere2009
- Achieving$ 1over 2log (1+ hboxSNR)$on the AWGN Channel With Lattice Encoding and DecodingIEEE Transactions on Information Theory, 2004
- Network information flowIEEE Transactions on Information Theory, 2000