Or Ordentlich - Publications

Or Ordentlich - Publications

Structured Codes

Full papers

Or Ordentlich and Uri Erez, “Cyclic-Coded Integer-Forcing Equalization”, IEEE Transactions on Information Theory, vol. 58, no. 9, pp. 5804-5815, Sept. 2012

Or Ordentlich and Uri Erez, “On the Robustness of Lattice Interference Alignment”, IEEE Transactions on Information Theory, vol. 59, no. 5, pp. 2735-2759, May 2013

Or Ordentlich, Uri Erez and Bobak Nazer “The Approximate Sum Capacity of the Symmetric Gaussian K-User Interference Channel”, IEEE Transactions on Information Theory, vol. 60, no. 6, pp. 3450-3482, June 2014
Here is a (documented) Matlab code that computes the achievable rates we derive in this paper.

Or Ordentlich and Uri Erez, "Precoded Integer-Forcing Universally Achieves the MIMO Capacity to Within a Constant Gap, IEEE Transactions on Information Theory, vol. 61, no. 1, pp. 323-340, Jan. 2015

Or Ordentlich and Uri Erez, “A Simple Proof for the Existence of ‘‘Good’’ Pairs of Nested Lattices”, IEEE Transactions on Information Theory, vol. 62, no. 8, pp. 4439-4453, Aug. 2016

Conference papers

Or Ordentlich and Uri Erez, “Cyclic-Coded Integer-Forcing Equalization”, Proceedings of the 48th Annual Allerton Conference on Communication, Control, and Computing, pp. 474-478, Monticello, Illinois, Sep. 2010 (Slides)

Jiening Zhan, Bobak Nazer, Or Ordentlich, Uri Erez and Michael Gastpar, “Integer-Forcing Architectures for MIMO: Distributed Implementation and SIC”, Proceedings of the 44th Asilomar conference on Signals, Systems and Computers, pp. 322–326, Pacific Grove, CA, Nov. 7-10, 2010.

Or Ordentlich and Uri Erez, Achieving The Gains Promised by Integer-Forcing Equalization with Binary Codes, Proceedings of the 26th Annual Convention of Electrical and Electronic Engineers in Israel, pp. 703–707, Eilat, Israel, Nov. 2010.

Or Ordentlich, Jiening Zhan, Uri Erez, Michael Gastpar and Bobak Nazer, “Practical Code Design for Compute-and- Forward”, Proceedings of the International Symposium on Information Theory (ISIT 2011), pp. 1876–1880, St. Petersburg, Russia, Aug. 2011. (Slides)

Or Ordentlich and Uri Erez, “Interference Alignment at Finite SNR for Time-Invariant Channels”, Proceedings of the Information Theory Workshop, pp. 442–446, Paraty, Brazil, Oct. 16-20, 2011. (Slides)

Or Ordentlich, Uri Erez and Bobak Nazer, “The Compute-and-Forward Transform”, Proceedings of the International Symposium on Information Theory (ISIT 2012), pp. 3008–3012, Cambridge, MA, USA, July 2012.

Or Ordentlich, Uri Erez and Bobak Nazer, “The Approximate Sum Capacity of the Symmetric Gaussian K-User Interference Channel”, Proceedings of the International Symposium on Information Theory (ISIT 2012), pp. 3008–3012, Cambridge, MA, USA, July 2012. (Slides)

Or Ordentlich and Uri Erez, “A Simple Proof for the Existence of ‘‘Good’’ Pairs of Nested Lattices” Proceedings of the 27th Annual Convention of Electrical and Electronic Engineers in Israel, Eilat, pp. 1-12 Israel, Nov. 2012. (Slides)

Or Ordentlich and Uri Erez, “Precoded Integer-Forcing Universally Achieves the MIMO Capacity to Within a Constant Gap” Proceedings of the Information Theory Workshop, pp. 298–302, Seville, Spain, Sep. 9-13, 2013. (Slides)

Or Ordentlich, Uri Erez and Bobak Nazer, “Successive Integer-Forcing and its Sum-Rate Optimality” Proceedings of the 51st Annual Allerton Conference on Communication, Control, and Computing, Monticello, Illinois, Oct. 2013 (Slides)
This is a Matlab code that finds an approximation for the optimal integer-valued matrix when successive integer-forcing is used.

Or Ordentlich, Uri Erez and Bobak Nazer, “On Compute-and-Forward with Feedback” Proceedings of the 2015 IEEE Information Theory Workshop (invited paper). (Slides)

Bobak Nazer and Or Ordentlich, “Diophantine Approximation for Network Information Theory: A Survey of Old and New Results” Proceedings of the 54th Annual Allerton Conference on Communication, Control, and Computing, Monticello, Illinois, Sep. 2016 (invited paper).

Or Ordentlich and Yury Polyanskiy, “Low Complexity Schemes for the Random Access Gaussian Channel” accepted for presentatiom in the International Symposium on Information Theory 2017. Extended Vesrion is in preparation.