CFMA (Compute-Forward Multiple Access) and its Applications in Network Information Theory

While both fundamental limits and system implementations are well understood for the point-to-point communication system, much less is developed for general communication networks. This thesis contributes towards the design and analysis of advanced coding schemes for multi-user communication networks with structured codes. The first part of the thesis investigates the usefulness of lattice codes in Gaussian networks with a generalized compute-and-forward scheme. As an application, we introduce a novel multiple access technique --- Compute-Forward Multiple Access (CFMA), and show that it achieves the capacity region of the Gaussian multiple access channel (MAC) with low receiver complexities. Similar coding schemes are also devised for other multi-user networks, including the Gaussian MAC with states, the two-way relay channel, the many-to-one interference channel, etc., demonstrating improvements of system performance because of the good interference mitigation property of lattice codes. As a common theme in the thesis, computing the sum of codewords over a Gaussian MAC is of particular theoretical importance. We study this problem with nested linear codes, and improve upon the currently best known results obtained by nested lattice codes. Inspired by the advantages of linear and lattice codes in Gaussian networks, we make a further step towards understanding intrinsic properties of the sum of linear codes. The final part of the thesis introduces the notion of typical sumset and presents asymptotic results on the typical sumset size of linear codes. The results offer new insight to coding schemes with structured codes.

[1]  Uri Erez,et al.  Lattice Strategies for the Dirty Multiple Access Channel , 2007, IEEE Transactions on Information Theory.

[2]  Terence Tao,et al.  Sumset and Inverse Sumset Theory for Shannon Entropy , 2009, Combinatorics, Probability and Computing.

[3]  Michael Gastpar,et al.  Compute-and-forward for discrete memoryless networks , 2014, 2014 IEEE Information Theory Workshop (ITW 2014).

[4]  Daniela Tuninetti,et al.  Approximate Sum-Capacity of K-user Cognitive Interference Channels with Cumulative Message Sharing , 2013, IEEE Journal on Selected Areas in Communications.

[5]  Shlomo Shamai,et al.  On the capacity of interference channels with one cooperating transmitter , 2007, Eur. Trans. Telecommun..

[6]  R. Zamir,et al.  Lattice Coding for Signals and Networks: A Structured Coding Approach to Quantization, Modulation and Multiuser Information Theory , 2014 .

[7]  Abhay Parekh,et al.  The Approximate Capacity of the Many-to-One and One-to-Many Gaussian Interference Channels , 2008, IEEE Transactions on Information Theory.

[8]  Sae-Young Chung,et al.  Capacity of the Gaussian Two-way Relay Channel to within 1/2 Bit , 2009, ArXiv.

[9]  Sriram Vishwanath,et al.  Capacity of Symmetric K-User Gaussian Very Strong Interference Channels , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.

[10]  Yasushige Watase,et al.  Introduction to Diophantine Approximation , 2015, Formaliz. Math..

[11]  Mokshay M. Madiman,et al.  Sumset and Inverse Sumset Inequalities for Differential Entropy and Mutual Information , 2012, IEEE Transactions on Information Theory.

[12]  Bobak Nazer.  Successive compute-and-forward , 2012 .

[13]  Syed Ali Jafar,et al.  Interference Alignment and Degrees of Freedom of the $K$-User Interference Channel , 2008, IEEE Transactions on Information Theory.

[14]  Uri Erez,et al.  Achieving 1/2 log (1+SNR) on the AWGN channel with lattice encoding and decoding , 2004, IEEE Transactions on Information Theory.

[15]  Urs Niesen,et al.  The Degrees of Freedom of Compute-and-Forward , 2011, IEEE Transactions on Information Theory.

[16]  Michael Gastpar,et al.  Gaussian (dirty) multiple access channels: A compute-and-forward perspective , 2014, 2014 IEEE International Symposium on Information Theory.

[17]  Michael Gastpar,et al.  Asymmetric Compute-and-Forward with CSIT , 2014, ArXiv.

[18]  Erdal Arikan,et al.  Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels , 2008, IEEE Transactions on Information Theory.

[19]  Alain Glavieux,et al.  Reflections on the Prize Paper : "Near optimum error-correcting coding and decoding: turbo codes" , 1998 .

[20]  Alexander Sprintson,et al.  Joint Physical Layer Coding and Network Coding for Bidirectional Relaying , 2008, IEEE Transactions on Information Theory.

[21]  Kyatsandra G. Nagananda,et al.  Multiuser cognitive radio networks: an information-theoretic perspective , 2011, ArXiv.

[22]  J. Nicholas Laneman,et al.  Multiaccess Channels with State Known to Some Encoders and Independent Messages , 2008, EURASIP J. Wirel. Commun. Netw..

[23]  Jacob Wolfowitz,et al.  Multiple Access Channels , 1978 .

[24]  Shlomo Shamai,et al.  On the capacity region of Gaussian interference channels with state , 2013, 2013 IEEE International Symposium on Information Theory.

[25]  Uri Erez,et al.  Successive integer-forcing and its sum-rate optimality , 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[26]  Te Sun Han,et al.  A new achievable rate region for the interference channel , 1981, IEEE Trans. Inf. Theory.

[27]  Rüdiger L. Urbanke,et al.  A rate-splitting approach to the Gaussian multiple-access channel , 1996, IEEE Trans. Inf. Theory.

[28]  Michael Gastpar,et al.  Lattice codes for many-to-one cognitive interference networks , 2013, 2013 IEEE International Symposium on Information Theory.

[29]  Michael Gastpar,et al.  Lattice Codes for Many-to-One Interference Channels With and Without Cognitive Messages , 2015, IEEE Transactions on Information Theory.

[30]  Sae-Young Chung,et al.  Nested Lattice Codes for Gaussian Relay Networks With Interference , 2011, IEEE Transactions on Information Theory.

[31]  Uri Erez,et al.  Precoded integer-forcing universally achieves the MIMO capacity to within a constant gap , 2013, 2013 IEEE Information Theory Workshop (ITW).

[32]  Nan Liu,et al.  On the capacity region of the Gaussian Z-channel , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[33]  Lili Zhang,et al.  Gaussian Interference Channel with State Information , 2013, IEEE Transactions on Wireless Communications.

[34]  Thomas M. Cover,et al.  Network Information Theory , 2001 .

[35]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[36]  Michael Gastpar,et al.  Compute-and-Forward: Finding the best equation , 2014, 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[37]  Shlomo Shamai,et al.  Cooperative Multiple-Access Encoding With States Available at One Transmitter , 2008, IEEE Transactions on Information Theory.

[38]  Pramod Viswanath,et al.  Cognitive Radio: An Information-Theoretic Perspective , 2009, IEEE Transactions on Information Theory.

[39]  Simon Litsyn,et al.  Lattices which are good for (almost) everything , 2005, IEEE Transactions on Information Theory.

[40]  Patrick Mitran,et al.  Achievable rates in cognitive radio channels , 2006, IEEE Transactions on Information Theory.

[41]  Uri Erez,et al.  The Approximate Sum Capacity of the Symmetric Gaussian $K$ -User Interference Channel , 2012, IEEE Transactions on Information Theory.

[42]  Shlomo Shamai,et al.  Nested linear/Lattice codes for structured multiterminal binning , 2002, IEEE Trans. Inf. Theory.

[43]  Michael Gastpar,et al.  Compute-and-forward using nested linear codes for the Gaussian MAC , 2015, 2015 IEEE Information Theory Workshop (ITW).

[44]  Alfred Geroldinger,et al.  Combinatorial Number Theory and Additive Group Theory , 2009 .

[45]  Dominic J. A. Welsh,et al.  Codes and cryptography , 1988 .

[46]  Michael Gastpar,et al.  Multiple Access via Compute-and-Forward , 2014, ArXiv.

[47]  Imre Csiszár,et al.  Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .

[48]  I-Hsiang Wang.  Approximate Capacity of the Dirty Multiple-Access Channel With Partial State Information at the Encoders , 2012, IEEE Transactions on Information Theory.

[49]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[50]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[51]  Rudolf Ahlswede,et al.  Multi-way communication channels , 1973 .

[52]  Hans-Andrea Loeliger,et al.  Averaging bounds for lattices and linear codes , 1997, IEEE Trans. Inf. Theory.

[53]  M. Anthony,et al.  Advanced linear algebra , 2006 .

[54]  Lele Wang,et al.  Sliding-window superposition coding for interference networks , 2014, 2014 IEEE International Symposium on Information Theory.

[55]  Wei Wu,et al.  Capacity of a Class of Cognitive Radio Channels: Interference Channels With Degraded Message Sets , 2007, IEEE Transactions on Information Theory.

[56]  Suhas N. Diggavi,et al.  Is Non-Unique Decoding Necessary? , 2012, IEEE Transactions on Information Theory.

[57]  Rüdiger L. Urbanke,et al.  Lattice Codes Can Achieve Capacity on the AWGN Channel , 1998, IEEE Trans. Inf. Theory.

[58]  Claude E. Shannon,et al.  Two-way Communication Channels , 1961 .

[59]  Michael Gastpar,et al.  Compute-and-Forward: Harnessing Interference Through Structured Codes , 2009, IEEE Transactions on Information Theory.

[60]  Arun Padakandla,et al.  Computing sum of sources over an arbitrary multiple access channel , 2013, 2013 IEEE International Symposium on Information Theory.

[61]  Bert Fristedt,et al.  A modern approach to probability theory , 1996 .

[62]  Michael Gastpar,et al.  Integer-forcing linear receivers , 2010, 2010 IEEE International Symposium on Information Theory.