Or Ordentlich - Publications

Or Ordentlich - Publications

All

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 Ofer Shayevitz, “Minimum MS. E. Gerber's Lemma”, IEEE Transactions on Information Theory, vol. 61, no. 11, pp. 5883-5891, Nov. 2015

Or Ordentlich and Ofer Shayevitz, “An Upper Bound on the Sizes of Multiset-Union-Free Families”, SIAM Journal on Discrete Mathematics, vol. 30, issue 2, pp. 1032-1045, May 2016

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

Yanjun Han, Or Ordentlich and Ofer Shayevitz, “Mutual Information Bounds via Adjacency Events”, IEEE Transactions on Information Theory, vol. 62, no. 11, pp. 6068-6080, Nov. 2016.

Or Ordentlich and Uri Erez, “Integer-Forcing Source Coding”, IEEE Transactions on Information Theory, vol. 63, no. 2, pp. 1253-1269, Feb. 2017.

Or Ordentlich and Uri Erez, “Performance Analysis and Optimal Filter Design for Sigma-Delta Modulation via Duality with DPCM”, submitted Jun. 2015

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)

Anatoly Khina, Or Ordentlich, Uri Erez, Yuval Kochman and Gregory W. Wornell, “Decode-and-Forward for the Gaussian Relay Channel via Standard AWGN Coding and Decoding”, Proceedings of the Information Theory Workshop, pp. 462–466, Lausanne, Switzerland, Sep. 3-7, 2012.

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 and Uri Erez, “Integer-Forcing Source Coding” Proceedings of the International Symposium on Information Theory (ISIT 2014), Honolulu, HI, USA, July 2014. (Slides)

Or Ordentlich and Ofer Shayevitz, “Bounding Techniques for the Intrinsic Uncertainty of Channels”, Proceedings of the International Symposium on Information Theory (ISIT 2014), Honolulu, HI, USA, July 2014. (Slides)

Or Ordentlich and Ofer Shayevitz, “Subset-Universal Lossy Compression” Proceedings of the 2015 IEEE Information Theory Workshop. (Slides)

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

Or Ordentlich and Uri Erez, “Performance Analysis and Optimal Filter Design for Sigma-Delta Modulation via Duality with DPCM” Proceedings of the 2015 International Symposium on Information Theory (ISIT 2015). (Slides)

Or Ordentlich and Ofer Shayevitz, “A VC-dimension-based Outer Bound on the Zero-Error Capacity of the Binary Adder Channel” Proceedings of the 2015 International Symposium on Information Theory (ISIT 2015). (Slides)

Or Ordentlich, Ofer Shayevitz and Omri Weinstein, “An Improved Upper Bound for the Most Informative Boolean Function Conjecture”, Proceedings of the 2016 International Symposium on Information Theory (ISIT 2016). (Slides)

Or Ordentlich, “Novel Lower Bounds on the Entropy Rate of Binary Hidden Markov Processes”, Proceedings of the 2016 International Symposium on Information Theory (ISIT 2016). (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).

Wasim Huleihel and Or Ordentlich, “How to Quantize n Outputs of a Binary Symmetric Channel to n-1 Bits?” accepted for presentatiom in the International Symposium on Information Theory 2017

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.

Bobak Nazer, Or Ordentlich and Yury Polyanskiy, “Information-Distilling Quantizers” accepted for presentatiom in the International Symposium on Information Theory 2017. Extended Vesrion is in preparation.

Patents

Barak Rotbard, Naftali Sommer, Shai Winter, Ofir Shalvi, Dotan Sokolov, Or Ordentlich, and Micha Anholt “Rejuvenation of analog memory cells”, U.S. Patent 8,248,831, issued Aug. 21, 2012.

Micha Anholt, Or Ordentlich, Naftali Sommer, and Ofir Shalvi “Error correction coding over multiple memory pages”, U.S. Patent 8,495,465, issued July 23, 2013.

Barak Rotbard, Naftali Sommer, Shai Winter, Ofir Shalvi, Dotan Sokolov, Or Ordentlich, and Micha Anholt “Read threshold setting based on temperature integral” U.S. Patent 8,599,592, issued Dec. 3, 2013.

Uri Erez and Or Ordentlich “Transmission system with isi channel and method of operating thereof” U.S. Patent 9,118,518, issued Aug. 25, 2015.