Successive integer-forcing and its sum-rate optimality
暂无分享,去创建一个
Uri Erez | Bobak Nazer | Or Ordentlich | U. Erez | Or Ordentlich | B. Nazer
[1] Alexander Sprintson,et al. Joint Physical Layer Coding and Network Coding for Bidirectional Relaying , 2008, IEEE Transactions on Information Theory.
[2] T. Guess,et al. Optimum decision feedback multiuser equalization with successive decoding achieves the total capacity of the Gaussian multiple-access channel , 1997, Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No.97CB36136).
[3] Uri Erez,et al. On the Robustness of Lattice Interference Alignment , 2013, IEEE Transactions on Information Theory.
[4] Emre Telatar,et al. Capacity of Multi-antenna Gaussian Channels , 1999, Eur. Trans. Telecommun..
[5] Sae-Young Chung,et al. Capacity of the Gaussian Two-way Relay Channel to within 1/2 Bit , 2009, ArXiv.
[6] Alexander Vardy,et al. Closest point search in lattices , 2002, IEEE Trans. Inf. Theory.
[7] Michael Gastpar,et al. Integer-Forcing architectures for MIMO: Distributed implementation and SIC , 2010, 2010 Conference Record of the Forty Fourth Asilomar Conference on Signals, Systems and Computers.
[8] Michael Gastpar,et al. Integer-forcing linear receivers , 2010, 2010 IEEE International Symposium on Information Theory.
[9] Uri Erez,et al. Precoded Integer-Forcing Universally Achieves the MIMO Capacity to Within a Constant Gap , 2015, IEEE Trans. Inf. Theory.
[10] Cong Ling,et al. On the Proximity Factors of Lattice Reduction-Aided Decoding , 2010, IEEE Transactions on Signal Processing.
[11] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[12] W. Fischer,et al. Sphere Packings, Lattices and Groups , 1990 .
[13] Bobak Nazer. Successive compute-and-forward , 2012 .
[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] Uri Erez,et al. The Approximate Sum Capacity of the Symmetric Gaussian $K$ -User Interference Channel , 2014, IEEE Trans. Inf. Theory.
[16] Shafi Goldwasser,et al. Complexity of lattice problems - a cryptographic perspective , 2002, The Kluwer international series in engineering and computer science.
[17] Uri Erez,et al. Lattice Strategies for the Dirty Multiple Access Channel , 2007, IEEE Transactions on Information Theory.
[18] Uri Erez,et al. The Approximate Sum Capacity of the Symmetric Gaussian $K$ -User Interference Channel , 2012, IEEE Transactions on Information Theory.
[19] Robert F. H. Fischer,et al. Precoding and Signal Shaping for Digital Transmission , 2002 .
[20] Uri Erez,et al. Precoded integer-forcing universally achieves the MIMO capacity to within a constant gap , 2013, 2013 IEEE Information Theory Workshop (ITW).
[21] John M. Cioffi,et al. MMSE decision-feedback equalizers and coding. I. Equalization results , 1995, IEEE Trans. Commun..
[22] Dirk Wübben,et al. Near-maximum-likelihood detection of MIMO systems using MMSE-based lattice reduction , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).
[23] D. Harville. Matrix Algebra From a Statistician's Perspective , 1998 .
[24] Hans-Andrea Loeliger,et al. Averaging bounds for lattices and linear codes , 1997, IEEE Trans. Inf. Theory.
[25] Sae-Young Chung,et al. Capacity of the Gaussian Two-Way Relay Channel to Within ${1\over 2}$ Bit , 2009, IEEE Transactions on Information Theory.
[26] 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.
[27] Michael Gastpar,et al. Compute-and-Forward: Harnessing Interference Through Structured Codes , 2009, IEEE Transactions on Information Theory.