Gaussian Multiple Access via Compute-and-Forward

IEEE Transactions on Information Theory

Volumn 63, Issue 5, 2017, Pages 2678-2695

  Zhu, Jingge ^a   Gastpar, Michael ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b EPFL   (Switzerland)

Author keywords

Compute and forward; Gaussian multiple access channel; nested lattice codes; NOMA; structured codes

Indexed keywords

CODES (SYMBOLS); DECODING; GAUSSIAN DISTRIBUTION;

COMPUTE AND FORWARDS; GAUSSIAN MULTIPLE-ACCESS CHANNELS; NESTED LATTICE CODES; NOMA; STRUCTURED CODES;

SIGNAL TO NOISE RATIO;

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

References (28)

1. 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.
2. M. P. Wilson, K. Narayanan, H. D. Pfister, and 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.
3. W. Nam, S.-Y. Chung, and Y. H. Lee, "Nested lattice codes for Gaussian relay networks with interference, " IEEE Trans. Inf. Theory, vol. 57, no. 12, pp. 7733-7745, Dec. 2011.
4. W. Nam, S.-Y. Chung, and Y. H. Lee, "Capacity of the Gaussian twoway relay channel to within 1/2 bit, " IEEE Trans. Inf. Theory, vol. 56, no. 11, pp. 5488-5494, Nov. 2010.
5. J. Zhan, B. Nazer, U. Erez, and M. Gastpar, "Integer-forcing linear receivers, " IEEE Trans. Inf. Theory, vol. 60, no. 12, pp. 7661-7685, Dec. 2014.
6. T. M. Cover and J. A. Thomas, Elements of Information Theory. Hoboken, NJ, USA: Wiley, 2006.
7. B. Rimoldi and R. Urbanke, "A rate-splitting approach to the Gaussian multiple-access channel, " IEEE Trans. Inf. Theory, vol. 42, no. 12, pp. 364-375, Mar. 1996.
8. O. Ordentlich, U. Erez, and B. Nazer, "The approximate sum capacity of the symmetric Gaussian k-user interference channel, " IEEE Trans. Inf. Theory, vol. 60, no. 6, pp. 3450-3482, Jun. 2014.
9. O. Ordentlich, U. Erez, and B. Nazer "Successive integer-forcing and its sum-rate optimality, " in Proc. 51st Annu. Allerton Conf. Commun., Control, Comput., Oct. 2013, pp. 282-292.
10. B. Nazer and M. Gastpar, "Compute-and-forward for discrete memoryless networks, " in Proc. Inf. Theory Workshop (ITW), Nov. 2014, pp. 5-9.
11. S. H. Lim, C. Feng, A. Pastore, B. Nazer, and M. Gastpar. (Jun. 2016). "A joint typicality approach to algebraic network information theory. " [Online] . Available. https://arxiv. org/abs/1606. 09548
12. T. Philosof, R. Zamir, U. Erez, and A. J. Khisti, "Lattice strategies for the dirty multiple access channel, " IEEE Trans. Inf. Theory, vol. 57, no. 8, pp. 5006-5035, Aug. 2011.
13. R. Ahlswede, "Multi-way communication channels, " in Proc. 2nd Int. Symp. Inf. Theory, Sep. 1971, pp. 1-20.
14. H. H.-J. Liao, "Multiple access channels, " Ph. D. dissertation, Univ. of Hawai, Chennai, India, 1972.
15. 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.
16. U. Erez, S. Litsyn, and R. Zamir, "Lattices which are good for (almost) everything, " IEEE Trans. Inf. Theory, vol. 51, no. 10, pp. 3401-3416, Oct. 2005.
17. V. Ntranos, V. R. Cadambe, B. Nazer, and G. Caire, "Asymmetric compute-and-forward, " in Proc. Commun., Control, Comput. (Allerton) 51st Annu. Allerton Conf., Oct. 2013, pp. 1174-1181.
18. O. Ordentlich and U. Erez, "Precoded integer-forcing universally achieves the MIMO capacity to within a constant gap, " IEEE Trans. Inf. Theory, vol. 61, no. 1, pp. 323-340, Jan. 2015.
19. J. Zhu, "CFMA (Compute-forward multiple access) and its applications in network information theory, " Ph. D. dissertation, École Polytechnique Fédérale de Lausanne, Lausanne, Switzerland, 2016.
20. J. Zhu and M. Gastpar, "Asymmetric compute-and-forward with CSIT, " in Proc. Int. Zurich Seminar Commun., 2014, pp. 128-131.
21. B. Nazer, "Successive compute-and-forward, " in Proc. Int. Zurich Seminar Commun., 2012, p. 103.
22. J. Zhu and M. Gastpar, "On lattice codes for Gaussian interference channels, " in Proc. Int. Symp. Inf. Theory (ISIT), HongKong, China, Jun. 2015, pp. 2066-2070.
23. A. Somekh-Baruch, S. Shamai (Shitz), and S. Verdú, "Cooperative multiple-access encoding with states available at one transmitter, " IEEE Trans. Inf. Theory, vol. 54, no. 10, pp. 4448-4469, Oct. 2008.
24. S. P. Kotagiri and J. N. Laneman, "Multiaccess channels with state known to some encoders and independent messages, " EURASIP J. Wireless Commun. Netw., vol. 2008, no. 1, p. 1, Mar. 2008.
25. I.-H. Wang, "Approximate capacity of the dirty multiple-access channel with partial state information at the encoders, " IEEE Trans. Inf. Theory, vol. 58, no. 5, pp. 2781-2787, May 2012.
26. M. Costa, "Writing on dirty paper (corresp.), " IEEE Trans. Inf. Theory, vol. 29, no. 5, pp. 439-441, May 1983.
27. S. Gelfand and M. S. Pinsker, "Coding for channel with random parameters, " Problemy Pered. Inf. (Probl. Inf. Trans.), vol. 9, no. 1, pp. 19-31, 1980.
28. R. Zamir, S. Shamai (Shitz), and U. Erez, "Nested linear/lattice codes for structured multiterminal binning, " IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1250-1276, Jun. 2002.