On the ergodic rate for compute-and-forward Conference Paper uri icon


  • A key issue in compute-and-forward for physical layer network coding scheme is to determine a good function of the received messages to be reliably estimated at the relay nodes. We show that this optimization problem can be viewed as the problem of finding the closest point of Z[i]n to a line in the n-dimensional complex Euclidean space, within a bounded region around the origin. We then use the complex version of the LLL lattice basis reduction (CLLL) algorithm to provide a reduced complexity suboptimal solution as well as an upper bound to the minimum distance of the lattice point from the line. Using this bound we are able to find a lower bound to the ergodic rate and a union bound estimate on the error performance of a lattice constellation used for lattice network coding. We compare performance of the CLLL with a more complex iterative optimization method as well as with a simple quantized search. Simulations show how CLLL can trade some performance for a lower complexity. 2012 IEEE.

name of conference

  • 2012 International Symposium on Network Coding (NetCod)

published proceedings

  • 2012 International Symposium on Network Coding (NetCod)

author list (cited authors)

  • Sakzad, A., Viterbo, E., Hong, Y. i., & Boutros, J.

citation count

  • 16

complete list of authors

  • Sakzad, Amin||Viterbo, Emanuele||Hong, Yi||Boutros, Joseph

publication date

  • June 2012