Prof. Meir Feder

Publications

1995 - 1999

• “Rate-Distortion Performance in Coding Band-Limited Sources by Sampling and Dithered Quantization"
  Ram Zamir and Meir Feder
  IEEE Trans. on Information Theory, IT-41, pp. 141- 154, January 1995.
• “A Universal Finite Memory Source"
  Marcello J. Weinberger, Jorma Rissanen and Meir Feder
  IEEE Trans. on Information Theory, IT-41, pp. 643-652, May 1995.
• “The Strong Version of the Redundancy-Capacity Theorem for Universal Coding and Statistical Inference"
  Neri Merhav and Meir Feder
  IEEE Trans. on Information Theory, IT-41, pp. 714-722, May 1995.
• “On Lattice Quantization Noise"
  Ram Zamir and Meir Feder
  IEEE Trans. on Information Theory, IT-42, pp. 1152-1159, July 1996.
• “Information Rates in Pre/Post Filtered Dithered Quantization"
  Ram Zamir and Meir Feder
  IEEE Trans. on Information Theory, IT-42, pp. 1340-1353, September 1996.
• “Hierarchical Universal Coding"
  Meir Feder and Neri Merhav
  IEEE Trans. on Information Theory, IT-42, pp. 1354-1364, September 1996.
• “The Vector Sampling Expansion"
  Danny Seidner, Meir Feder, David Cubanski and Steve Blackstock
  IEEE Signal Processing Letters, pp. 115-117, May 1998.
• “Analysis and Synthesis of 1/f Noise"
  Eli Shusterman and Meir Feder
  IEEE Trans. on Signal Processing, pp. 1698-1702, June 1998.
• “Branch Prediction Based on Universal Data Compression Algorithms"
  Eitan Federovsky, Meir Feder, and Shlomo Weiss
  Proceedings of the 25th Annual International Symposium on Computer Architecture,pp. 62 - 72, June 1998.
  
• “Universal Decoding of Channels with Memory"
  Meir Feder and Amos Lapidoth
  IEEE Trans. on Information Theory, IT-44, pp. 1726-1745, September 1998.
• “Universal Prediction"
  Neri Merhav and Meir Feder
  Invited paper,
  Special Commemorative issue of the IEEE Trans. on Information Theory, celebrating 50 years of Information Theory,
  IEEE Trans. on Information Theory, IT-44, pp. 2124-2147, October 1998.
• “An Inequality regarding Linear Transformations of Line Sets Analogous to the Entropy Power Inequality"
  Ram Zamir and Meir Feder,
  IEEE Trans. on Information Theory, IT-44, pp. 3039-3040, November 1998.
• “Recursive Expectation-Maximization (EM) Algorithms for Time-Varying Parameters with Applications to Multiple Target Tracking”
  Liron Frenkel and Meir Feder
  IEEE Trans. on Signal Processing, Vol. 47, No. 2, pp. 306-320, February 1999.
• “Random Coding Techniques for Non-Random Codes"
  Nadav Shulman and Meir Feder,
  IEEE Trans. on Information Theory, Vol. 45 No. 6, pp. 2101 -2104, September 1999.
• “Universal Linear Prediction by Model Order Weighting"
  Andrew. C. Singer and Meir Feder
  IEEE Trans. on Signal Processing, Vol. 47 No. 10, pp. 2685 -2699 October 1999.
• “Universal Prediction with Memory for Binary Sequences"
  Meir Feder and Eitan Federovski
  Invited paper,
  “Numbers, Information and Complexity", a special honorary collection for R. Ahlswede's 60-th birthday, 1999.