Lattices over Eisenstein Integers for Compute-and-Forward

IEEE Transactions on Information Theory

Volumn 61, Issue 10, 2015, Pages 5306-5321

  Tunali, Nihat Engin ^a   Huang, Yu Chih ^b   Boutros, Joseph J ^c   Narayanan, Krishna R ^d  

^a XILINX INC   (United States)

^b NATIONAL TAIPEI UNIVERSITY   (Taiwan)

^c TEXAS A AND M UNIVERSITY AT QATAR   (Qatar)

^d Texas AandM University   (United States)

Author keywords

Compute and Forward; Eisenstein integers; Lattice codes

Indexed keywords

CHANNEL STATE INFORMATION;

COARSE LATTICE; COMPUTE AND FORWARDS; EISENSTEIN INTEGERS; ERROR-CORRECTING; LATTICE CODEBOOKS; LATTICE CODES; OUTAGE PERFORMANCE;

COMPLEX NETWORKS;

EID: 84959449608     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2015.2451623     Document Type: Article

References (30)

1. U. Erez and R. Zamir, "Achieving 1/2 log (1+SNR) on the AWGN channel with lattice encoding and decoding," IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2293-2314, Oct. 2004.
2. R. Zamir, S. Shamai, U. Erez, "Nested linear/lattice codes for structured multiterminal binning," IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1250-1276, Jun. 2002.
3. G. Poltyrev, "On coding without restrictions for the AWGN channel," IEEE Trans. Inf. Theory, vol. 40, no. 2, pp. 409-417, Mar. 1994.
4. H.-A. Loeliger, "Averaging bounds for lattices and linear codes," IEEE Trans. Inf. Theory, vol. 43, no. 6, pp. 1767-1773, Nov. 1997.
5. U. Erez, S. Litsyn, R. Zamir, "Lattices which are good for (almost) everything," IEEE Trans. Inf. Theory, vol. 51, no. 10, pp. 3401-3416, Oct. 2005.
6. O. Shalvi, N. Sommer, M. Feder, "Signal codes: Convolutional lattice codes," IEEE Trans. Inf. Theory, vol. 57, no. 8, pp. 5203-5226, Aug. 2011.
7. N. Sommer, M. Feder, O. Shalvi, "Low-density lattice codes," IEEE Trans. Inf. Theory, vol. 54, no. 4, pp. 1561-1585, Apr. 2008.
8. M. P. Wilson, K. Narayanan, H. D. Pfister, A. Sprintson, "Joint physical layer coding and network coding for bidirectional relaying," IEEE Trans. Inf. Theory, vol. 56, no. 11, pp. 5641-5654, Nov. 2010.
9. W. Nam, S.-Y. Chung, Y. H. Lee, "Capacity of the Gaussian two-way relay channel to within 12 bit," IEEE Trans. Inf. Theory, vol. 56, no. 11, pp. 5488-5494, Nov. 2010.
10. U. Niesen and P. Whiting, "The degrees of freedom of compute-andforward," IEEE Trans. Inf. Theory, vol. 58, no. 8, pp. 5214-5232, Aug. 2012.
11. B. Nazer and M. Gastpar, "Compute-and-forward: Harnessing interference through structured codes," IEEE Trans. Inf. Theory, vol. 57, no. 10, pp. 6463-6486, Oct. 2011.
12. C. Feng, D. Silva, F. R. Kschischang, "An algebraic approach to physical-layer network coding," in Proc. IEEE Int. Symp. Inf. Theory, Jun. 2010, pp. 1017-1021.
13. Q. T. Sun, J. Yuan, T. Huang, K. W. Shum, "Lattice network codes based on Eisenstein integers," IEEE Trans. Commun., vol. 61, no. 7, pp. 2713-2725, Jul. 2013.
14. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups. New York, NY, USA: Springer-Verlag, 1999.
15. C. A. Rogers, "A note on coverings," Mathematica, vol. 4, no. 1, pp. 1-6, 1957.
16. R. Zamir and M. Feder, "On lattice quantization noise," IEEE Trans. Inf. Theory, vol. 42, no. 4, pp. 1152-1159, Jul. 1996.
17. G. D. Forney, Jr., "Coset codes. I. Introduction and geometrical classification," IEEE Trans. Inf. Theory, vol. 34, no. 5, pp. 1123-1151, Sep. 1988.
18. J. H. Conway and N. J. A. Sloane, "A fast encoding method for lattice codes and quantizers," IEEE Trans. Inf. Theory, vol. 29, no. 6, pp. 820-824, Nov. 1983.
19. J. Leech and N. J. A. Sloane, "Sphere packings and error-correcting codes," Can. J. Math., vol. 23, pp. 718-745, Nov. 1971.
20. O. Ordentlich and U. Erez. (Sep. 2012). "A simple proof for the existence of 'good' pairs of nested lattices." [Online]. Available: http://arxiv.org/pdf/1209.5083
21. J. H. Conway and D. Smith, On Quaternions and Octonions. Boca Raton, FL, USA: CRC Press, 2003.
22. T. W. Hungerford, Algebra (Graduate Texts in Mathematics). New York, NY, USA: Springer-Verlag, 1974.
23. R. Breusch, "Zur verallgemeinerung des bertrandsehen postulates, daßzwischen x und 2x stets Primzahlen liegen," Math. Zeitschrift, vol. 34, no. 1, pp. 505-526, 1932, doi: 10.1007/BF01180606.
24. H. V. Henderson and S. R. Searle, "On deriving the inverse of a sum of matrices," SIAM Rev., vol. 23, no. 1, pp. 53-60, 1981.
25. E. Viterbo and J. Boutros, "A universal lattice code decoder for fading channels," IEEE Trans. Inf. Theory, vol. 45, no. 5, pp. 1639-1642, Jul. 1999.
26. E. Agrell, T. Eriksson, A. Vardy, K. Zeger, "Closest point search in lattices," IEEE Trans. Inf. Theory, vol. 48, no. 8, pp. 2201-2214, Aug. 2002.
27. A. K. Lenstra, H. W. Lenstra, L. Lovasz, "Factoring polynomials with rational coefficients," Math. Ann., vol. 261, no. 4, pp. 515-534, 1982.
28. H. Napias, "A generalization of the LLL-algorithm over Euclidean rings or orders," Journal de Theórie des Nombres de Bordeaux, vol. 8, no. 2, pp. 387-396, 1996.
29. A. Sakzad, E. Viterbo, Y. Hong, J. Boutros, "On the ergodic rate for compute-and-forward," in Proc. Int. Symp. Netw. Coding (NetCod), Jun. 2012, pp. 131-136.
30. A. Sakzad, J. Harshan, E. Viterbo, "Integer-forcing MIMO linear receivers based on lattice reduction," IEEE Trans. Wireless Commun., vol. 12, no. 10, pp. 4905-4915, Oct. 2013.