Barnes-Wall lattices for the symmetric interference channel

In this paper we study the performance of Barnes-Wall lattices in a symmetric interference channel, under different types of interference. We are inspired by the work of Jafar [1], in which a scheme is proposed for each type of interference, using a base Q expression for the transmitted signals. This is similar to the multilevel structure of Barnes-Wall lattices. With the advantage of their good performance and the extension in bigger dimensions that using lattices implies, we propose to use Barnes-Wall lattices to improve the performance of each user, under lattice alignment in a symmetric interference channel.

[1]  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.

[2]  Emanuele Viterbo,et al.  Practical Encoders and Decoders for Euclidean Codes from Barnes-Wall Lattices , 2012, IEEE Transactions on Communications.

[3]  Daniele Micciancio,et al.  Efficient bounded distance decoders for Barnes-Wall lattices , 2008, 2008 IEEE International Symposium on Information Theory.

[4]  Cong Ling,et al.  Analysis of lattice codes for the many-to-one interference channel , 2012, 2012 IEEE Information Theory Workshop.

[5]  Sriram Vishwanath,et al.  Generalized Degrees of Freedom of the Symmetric Gaussian $K$ User Interference Channel , 2010, IEEE Transactions on Information Theory.

[6]  Martin Bossert,et al.  Soft-decision decoding of Reed-Muller codes as generalized multiple concatenated codes , 1995, IEEE Trans. Inf. Theory.

[7]  Sae-Young Chung,et al.  Sphere-bound-achieving coset codes and multilevel coset codes , 2000, IEEE Trans. Inf. Theory.

[8]  Shlomo Shamai,et al.  A layered lattice coding scheme for a class of three user Gaussian interference channels , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[9]  G. David Forney,et al.  A bounded-distance decoding algorithm for the Leech lattice, with generalizations , 1989, IEEE Trans. Inf. Theory.

[10]  Ofer Amrani,et al.  Augmented product codes and lattices: Reed-Muller codes and Barnes-Wall lattices , 2005, IEEE Transactions on Information Theory.

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

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

[13]  Syed Ali Jafar,et al.  Interference Alignment and Spatial Degrees of Freedom for the K User Interference Channel , 2007, 2008 IEEE International Conference on Communications.

[14]  Jinho Choi,et al.  Interference Alignment over Lattices for MIMO Interference Channels , 2011, IEEE Communications Letters.

[15]  Hua Wang,et al.  Gaussian Interference Channel Capacity to Within One Bit , 2007, IEEE Transactions on Information Theory.