Beery Yair, Professor

Faculty of Engineering

Tel Aviv University, Ramat Aviv, Israel

Phone: 972-3-640 8058  
 
Room: 133, EE Building  

Positions:
Chairman: 1999-2003

Research Fields
  • Error correcting codes, soft decision decoding.
  • Turbo coding and decoding, linear-programming and iterative decoding.
  • Pseudocodewords and convergence analysis.
  • Graphs and trellises of block codes.
  • Coded modulation, lattice codes.
  • VLSI architectures, systolic & processing arrays.

    • Journal Publications

  • Y. Be'ery and J. Snyders , "A recursive Hadamard transform optimal soft-decision decoding algorithm", SIAM J. on Algebraic and Discrete Methods, Vol. 8, No. 4, pp. 778-789, October 1987 Link
  • O. Pardo and Y. Be'ery, "SPL - A different high level language for systolic processors", Microprocessing and Microprogramming J., Vol. 25, pp. 79-83, January 1989. Link
  • Y. Be'ery, B. Shahar and J. Snyders, "Fast decoding of the Leech lattice", IEEE J. on Selected Areas in Communications, Vol. SAC-7, No. 8, pp. 959-967, August 1989. Link
  • J. Snyders and Y. Be'ery, "Maximum likelihood soft decoding of binary block codes and decoders for the Golay codes", IEEE Trans. on Information Theory, Vol. IT-35, No. 5, pp. 963-975, September 1989. Link
  • B. Nissenbaum and Y. Be'ery, "SYSTOOL - Systolic array programming tool", Microprocessing and Microprogramming J., Vol. 28, pp. 69-73, March 1990. Link
  • A. Vardy, J. Snyders and Y. Be'ery, "Bounds on the dimension of codes and subcodes with prescribed contraction index", Linear Algebra and Its Applications, Vol. 142, pp. 237-261, 1990. Link
  • A. Vardy and Y. Be'ery, "On the problem of finding zero-concurring codewords", IEEE Trans. on Information Theory, Vol. 37, pp. 180-187, January 1991. Link
  • A. Vardy and Y. Be'ery, "Bit level soft decision decoding of Reed-Solomon codes", IEEE Trans. on Communications, Vol. 39, pp. 440-444, March 1991. Link
  • A. Vardy and Y. Be'ery, "Even more efficient soft decoding of the Golay codes", IEEE Trans. on Information Theory, Vol. 37, pp. 667-672, May 1991. Link
  • H. Herzberg, R. Haimi-Cohen and Y. Be'ery, "A systolic-array realization of adaptive filters and the effects of delayed adaptation", IEEE Trans. on Signal Processing, Vol. 40, pp. 2799-2803, November 1992. Link
  • Y. Berger and Y. Be'ery, "Bounds on the trellis size of linear block codes", IEEE Trans. on Information Theory, Vol. 39, pp. 203-209, January 1993. Link
  • H. Herzberg, Y. Be'ery and J. Snyders, "Concatenated multilevel block coded modulation", IEEE Trans. on Communications, Vol. 41, pp. 41-49, January 1993. Link
  • Y. Be'ery, "Variable bit-rate methods for low-delay speech coders", Speech Communications J., Vol. 12, pp. 183-192, June 1993. Link
  • A. Vardy and Y. Be'ery, "Maximum likelihood decoding of the Leech lattice", IEEE Trans. on Information Theory, Vol. 39, pp. 1435-1444, July 1993. Link
  • S. Berger, Y. Be'ery, B. Ovadia, R. Perets, G. Wertheizer, Y. Gross, "An application specific DSP for speech applications", IEEE Trans. on Consumer Electronics, Vol. 39, pp. 733-739, November 1993. Link
  • O. Amrani, Y. Be’ery and A. Vardy, "Bounded distance decoding of the Leech lattice and the Golay code", Lecture Notes in Computer Science, Vol. 781, pp. 236-248, 1994. Link
  • A. Vardy and Y. Be'ery, "Maximum likelihood soft decision decoding of BCH codes”, IEEE Trans. on Information Theory, Vol. 40, pp. 546-554, March 1994. Link
  • Y. Berger and Y. Be'ery, "Soft trellis-based decoder for linear block codes", IEEE Trans. on Information Theory, Vol. 40, pp. 764-773, May 1994. Link
  • O. Amrani, Y. Be’ery, A. Vardy, F.-W. Sun, and H.C.A. van Tilborg, "The Leech lattice and the Golay code: bounded-distance decoding and multilevel constructions", IEEE Trans. on Information Theory, Vol. 40, pp. 1030-1043, July 1994. Link
  • Y. Berger and Y. Be'ery, "Trellis-oriented decomposition and trellis complexity of composite-length cyclic codes", IEEE Trans. on Information Theory, Vol. 41, pp. 1185-1191, July 1995. Link
  • O. Amrani and Y. Be'ery, "Efficient bounded distance decoding of the Hexacode and associated decoders for the Leech lattice and the Golay code", IEEE Trans. on Communications, Vol. 44, pp. 534-537, May 1996. Link
  • Y. Berger and Y. Be'ery, "The twisted squaring construction, trellis complexity and generalized weights of BCH and QR codes", IEEE Trans. on Information Theory, Vol. 42, pp. 1817-1827, November 1996. Link
  • I. Reuven and Y. Be'ery, "Entropy/length profiles, bounds on the minimal covering of bipartite graphs, and trellis complexity of nonlinear codes", IEEE Trans. on Information Theory, Vol. 44, pp. 580-598, March 1998. Link
  • Y. Shany, I. Reuven and Y. Be'ery, "On the trellis representation of the Kerdock and Delsarte-Goethals codes", IEEE Trans. on Information Theory, Vol. 44, pp. 1547-1554, July 1998. Link
  • O. Amrani and Y. Be'ery, "Bounded-distance decoding: algorithms, decision regions, and pseudo nearest neighbors", IEEE Trans. on Information Theory, Vol. 44, pp. 3072-3082, November 1998. Link
  • I. Reuven and Y. Be'ery, "Generalized Hamming weights of nonlinear codes and the relation to Z4 representation", IEEE Trans. on Information Theory, Vol. 45, pp. 713-720, March 1999. Link
  • E. Fishler, O. Amrani and Y. Be'ery, "Geometrical and performance analysis of the GMD and Chase decoding algorithms", IEEE Trans. on Information Theory, Vol. 45, pp. 1406-1422, July 1999. Link
  • I. Reuven and Y. Be'ery, "The weighted-coordinates bound and trellis complexity of block codes and periodic packings", IEEE Trans. on Information Theory, Vol. 45, pp. 1658-1667, July 1999. Link
  • Y. Shany and Y. Be'ery, "The Preparata and Goethals codes: trellis complexity and twisted squaring construction", IEEE Trans. on Information Theory, Vol. 45, pp. 1667-1673, July 1999. Link
  • I. Reuven and Y. Be'ery, "Tail-biting trellises of block codes: trellis complexity and Viterbi decoding complexity", IEICE Trans. on Fundamentals of Electronics, Communications and Computer Science, Vol. E82A, pp. 2043-2051, October 1999. Link
  • Y. Shany and Y. Be'ery, "Linear tail-biting trellises, the square root bound, and applications for Reed-Muller codes", IEEE Trans. on Information Theory, Vol. 46, pp. 1514-1523, July 2000. Link
  • Y. Shany and Y. Be'ery, "Bounds on the state complexity of codes from the Hermitian function field and its subfields”, IEEE Trans. on Information Theory, Vol. 46, pp. 1523-1527, July 2000. Link
  • A. Sella and Y. Be’ery, "Convergence analysis of turbo-decoding of product codes", IEEE Trans. on Information Theory, Vol. 47, pp. 723-735, February 2001. Link
  • O. Amrani and Y. Be'ery, "Reed-Muller codes: Projecting onto GF(4) and multilevel construction", IEEE Trans. on Information Theory, Vol. 47, pp. 2560-2565, September 2001. Link
  • Y. Shany, I. Reuven and Y. Be'ery, "Lower bounds on the state complexity of linear tail-biting trellises", IEEE Trans. on Information Theory, Vol. 50, pp. 566-571, March 2004. Link
  • Y. Shany and Y. Be'ery, "A Note on Nonlinear Xing Codes", IEEE Trans. on Information Theory, Vol. 50, pp. 699-700, April 2004. Link
  • A. Krause, A. Sella and Y. Be’ery, "Convergence analysis of turbo-decoding of serially concatenated block codes and product codes", EURASIP J. on Applied Signal Processing, Vol. 2005, pp. 795-807, June 2005. Link
  • Y. Baram and Y. Be'ery, "Stochastic model simplification", IEEE Trans. on Automatic Control, Vol. AC-26, No. 2, pp. 379-390, April 1981. Link
  • Y. Be'ery and J. Snyders, "Optimal soft-decision block decoders based on fast Hadamard transform", IEEE Trans. on Information Theory, Vol. IT-32, No. 3, pp. 355-364, May 1986. Link
  • Ilan Dimnik and Yair Be’ery, Improved random redundant iterative HDPC decoding, IEEE Transactions on Communications, vol. 57, no. 7, pp. 1982-1985, July 2009. Link
  • S. Ouzan and Y. Be'ery, Moderate-Density Parity-Check Codes, submitted to IEEE Transactions on Communications, September 2009. Link

    • Conference Publications

  • Y. Baram and Y. Be'ery, "Simplification of high order and time varying linear systems", Joint Automatic Control Conf., San Francisco, U.S.A., pp. FA8-B, August 1980.
  • Y. Be'ery and J. Snyders, "Optimal decoding of convolutional codes and high-rate block codes based on the Hadamard transform", Proc. IEEE Int. Symp. on Information Theory, Brighton, England, p. 136, June 1985.
  • H. Herzberg, R. Haimi-Cohen and Y. Be'ery, "A systolic-array for adaptive filters: design and performance analysis", Proc. IEEE 15'th Conv. of Electrical and Electronic Eng., Tel-Aviv, Israel, pp. 4.1.3:1-4, April 1987.
  • Y. Be'ery and J. Snyders, "New methods for soft-decision decoding of the Golay(24,12) code", Proc. IEEE 15'th Conv. of Electrical and Electronic Eng., Tel-Aviv, Israel, p. 3.4.2:1-4, April 1987.
  • Y. Be'ery, "Soft decoding of the Golay codes and the Leech lattice", IEEE Information Theory Workshop, Bellagio, Italy, June 1987.
  • A. Vardy and Y. Be'ery, "Efficient algorithms for the search of zero-concurring codewords", Proc. 25'th Annual Allerton Conf. on Communication, Control and Computing, Monticello, IL, pp. 610-619, September 1987.
  • A. Vardy and Y. Be'ery, "Systolic architecture for performing cross-section on binary linear codes", Proc. IEEE Int. Symp. on Information Theory, Kobe, Japan, p. 171, June 1988.
  • J. Snyders and Y. Be'ery, "Soft binary block decoders based on a generalized Wagner rule", Proc. IEEE Int. Symp. on Information Theory, Kobe, Japan, p. 193, June 1988. Link
  • Y. Be'ery, B. Shahar and J. Snyders, "Fast decoding of the Leech lattice", Proc. Beijing Int. Workshop. on Information Theory, Beijing, China, pp. FI7.1-FI7.4, July 1988.
  • Y. Be'ery, "Soft decision decoding of block and lattice codes ", Proc. IEEE 16'th Conv. of Electrical and Electronic Eng., Tel-Aviv, Israel, pp. 1.1.1:1-4, March 1989 (Invited Lecture). Link
  • A.Vardy and Y. Be'ery, "Bit level soft decision decoding of Reed-Solomon codes", Proc. IEEE 16'th Conv. of Electrical and Electronic Eng., Tel-Aviv. 1.1.3:1-4, March 1989. Link
  • B. Nissenbaum and Y. Be'ery, "SYSTOOL - Systolic array programming tool", Proc. IEEE 16'th Conv. of Electrical and Electronic Eng., Tel-Aviv, Israel, pp. 1.5.5:1-4, March 1989. Link
  • J. Snyders and Y. Be'ery, "An approach to maximum likelihood decoding of q-ary block codes", Proc. Conf. on Information Sciences and Systems, Baltimore, Maryland, pp. 206-208, March 1989.
  • Y. Be’ery, "Methods for efficient variable bit rate LD-CELP coders for the CCITT 16 kbit/s standard", IEEE Workshop on Speech Coding for Telecommunications, Vancouver, Canada, September 1989.
  • Y. Be'ery, "Performance comparison between the ELSA and GAPP systolic architectures", IFIP Workshop on Parallel Architectures on Silicon, Grenoble, France, pp. 156-165, December 1989 (Invited Lecture).
  • Y. Be'ery, "On lattices, block codes, modems and speech compression", French-Israeli Symposium on Advanced Topics in Telecommunication, Tel-Aviv, Israel, December 1989 (Invited Lecture).
  • A. Vardy and Y. Be'ery, "Decoding of Reed-Solomon codes using bit level soft decision information", Proc. IEEE Int. Symp. on Information Theory, San Diego, California, p. 106, January 1990.
  • A. Vardy, J. Snyders and Y. Be'ery, "Bounds on the dimension of codes and subcodes", Proc. IEEE Int. Symp. on Information Theory, San Diego, California, p. 42, January 1990.
  • R. Haimi-Cohen, H. Herzberg and Y. Be'ery, "Delayed adaptive LMS filtering: current results", Proc. IEEE Int. Conf. on Acoustic, Speech, and Signal Processing, Albuquerque, New Mexico, pp. 1273-1276, April 1990. Link
  • H. Herzberg, Y. Be'ery and J. Snyders, "A new block coded modulation scheme", Proc. Bilkent Int. Conf. on New Trends in Comm., Control and Signal Processing, Ankara, Turkey, pp. 369-375, July 1990.
  • Y. Be'ery and B. Shahar, "VLSI architectures for soft decision decoding of the Leech lattice and the Golay codes", Proc. IEEE Int. Workshop on Microelectronics in Communications, Interlaken, Switzerland, March 1991.
  • A. Vardy and Y. Be'ery, "More efficient soft decoding of the Golay codes", Proc. IEEE 17'th Conv. of Electrical and Electronic Eng., Tel-Aviv, Israel, pp. 31-34, May 1991. Link
  • Y. Kashai and Y. Be'ery, "Comparing digital neural network architectures", Proc. IEEE 17'th Conv. of Electrical and Electronic Eng., Tel-Aviv, Israel, pp. 203-206, May 1991. Link
  • A. Vardy and Y. Be'ery, "Even more efficient soft decoding of the Golay codes", Proc. IEEE Int. Symp. on Information Theory, Budapest, Hungary, p. 190, June 1991. Link
  • Y. Berger and Y. Be'ery, "Improved trellis techniques for efficient soft decoding of block codes", IEEE Comm. Theory Workshop, Rhodes, Greece, July 1991.
  • Y. Kashai and Y. Be'ery, "Back propagation and distributed data architectures", Proc. Second Int. Conf. on Micro Electronics of Neural Nets, Munich, Germany, pp. 143-150, November 1991.
  • Y. Be'ery, "Lattice codes for bandwidth efficient modulation - a review and current results", Int. Comsphere Symp., Herzelia, Israel, pp. 7.6.1-7.6.4, December 1991 (Invited lecture).
  • A. Vardy and Y. Be'ery, "Maximum likelihood soft decision decoding of BCH codes", Proc. IEEE Int. Symp. on Information Theory, San Antonio, Texas, USA, p. 29, January 1993. Link
  • O. Amrani, Y. Be’ery and A. Vardy, "Reduced complexity bounded-distance decoding of the Leech lattice", Proc. IEEE Int. Symp. on Information Theory, San Antonio, Texas, USA, p. 61, January 1993. Link
  • Y. Be'ery, B. Ovadia, Y. Gross, R. Perets, G. Wertheizer, "PINE - An application specific DSP core", DSP'93, Herzelia, Israel, pp. 18-26, July 1993 (Invited Lecture).
  • O. Amrani and Y. Be'ery, "Efficient bounded distance decoding of the Hexacode and associated decoders for the Leech lattice and the Golay code", Proc. IEEE Int. Symp. on Information Theory, Trondheim, Norway, p. 400, June 1994. Link
  • Y. Be'ery, "OAK and PINE - the cores of the DSP applications' forest", DSP'94, Herzelia, Israel, pp. 4-15, June 1994 (Invited Lecture).
  • Y. Berger and Y. Be'ery, "On the trellis complexity of composite-length cyclic codes", Proc. IEEE Int. Symp. on Information Theory, Trondheim, Norway, p. 338, June 1994. Link
  • O. Amrani and Y. Be'ery, "Maximum distance decoding of the Hexacode and the associated performance of the Leech lattice and trellis codes", Israeli-French Workshop on Coding and Information Integrity, Tel-Aviv, Israel, December 1994.
  • Y. Berger and Y. Be'ery, "On the twisted squaring construction, symmetric-reversible designs and trellis diagrams of block codes", Proc. IEEE Int. Symp. on Information Theory, Whistler, Canada, p. 129, September 1995. Link
  • O. Amrani and Y. Be'ery, "Bounded distance soft decoding of a family of linear block codes including MDS codes", Mediterranean Workshop on Coding and Information Integrity, Mallorca, Spain, February 1996.
  • Y. Berger and Y. Be'ery, "Efficient permutations and trellis complexity of quadratic-residue codes", Proc. IEEE Information Theory Workshop, Haifa, Israel, p. 75, June 1996.
  • O. Amrani and Y. Be'ery, "Sub-optimal decoding of block and lattice codes", Proc. IEEE 19'th Conv. of Electrical and Electronic Eng., Jerusalem, Israel, pp. 340-343, November 1996. Link
  • I. Reuven and Y. Be'ery, "Information-theoretic bounds on trellis complexity of nonlinear codes", Proc. IEEE Int. Symp. on Information Theory, Ulm, Germany, p. 83, June 1997. Link
  • O. Amrani and Y. Be'ery, "Not all nearest neighbors are equal in bounded distance decoding", Proc. IEEE Int. Symp. on Information Theory, Ulm, Germany, p. 301, June 1997. Link
  • Y. Shany, I. Reuven and Y. Be'ery, "On the trellis representation of the Kerdock and Delsarte-Goethals codes", French-Israel Workshop on Coding and Information Integrity, Ein Boqeq, Israel, October 1997.
  • O. Amrani and Y. Be'ery, "Projecting binary Reed-Muller codes onto GF(4)", French-Israel Workshop on Coding and Information Integrity, Ein Boqeq, Israel, October 1997.
  • E. Fishler, O. Amrani and Y. Be’ery, "Decision regions and performance analysis of the Chase and GMD decoding algorithms", French-Israel Workshop on Information Integrity, Ein Boqeq, Israel, October 1997.
  • I. Reuven and Y. Be'ery, "Information-theoretic approach to the analysis of trellis complexity of lattice and nonlattice periodic packings", Proc. IEEE Int. Symp. on Information Theory, MIT, Cambridge, MA, USA, p.16, August 1998. Link
  • O. Amrani and Y. Be'ery, "Bounded-distance soft decicion decoding of binary product codes", Proc. IEEE Int. Symp. on Information Theory, Sorrento, Italy, p.85, June 2000. Link
  • A. Sella and Y. Be'ery, "Convergence analysis of turbo-decoding of product codes", Proc. IEEE Int. Symp. on Information Theory, Sorrento, Italy, p.484, June 2000. Link
  • A. Krause, A. Sella and Y. Be'ery, "Convergence analysis of turbo-decoding of serially concatenated product codes", Proc. IEEE Int. Symp. on Information Theory, Washington D.C., USA, p.318, June 2001. Link
  • L. Khermush, O. Amrani and Y. Be'ery, "Iterative decoding of product block codes based on the least mean square error criterion", Proc. IEEE Int. Symp. on Information Theory, Washington D.C., USA, p.121, June 2001. Link

    • Books

  • Chapters in Books:
  • Y. Be'ery, Z. Shpiro, T. Simchony, L. Shatz, J. Piasetzky, "An efficient variable bit-rate low-delay CELP (VBR-LD-CELP) coder", Chapter 4 in Advances in Speech Coding, Eds. Atal, Cuperman, Gersho, Kluwer Academic Publishers, Boston, pp. 37-46, 1991. Link
  • Y. Kashai and Y. Be'ery, "Comparing digital neural network architectures", Silicon Architectures for Neural Networks, Eds. M. Sami and J. Calzadilla-Daguerre, Elsevier Science Publishers, Amsterdam, pp. 45-64, 1991.
  • Y. Be'ery, S. Berger, B. Ovadia, "An application specific DSP for portable applications", VLSI Signal Processing, VI, Eds. L.D.J. Eggermont , P. Dewilde, E. Deprettere, J. van Meerbergen, IEEE Press, NY, pp. 48-56, 1993. Link
  • B. Ovadia and Y. Be'ery, "Statistical analysis as a quantitative basis for DSP architecture design", VLSI Signal Processing, VII, Eds. J. Rabaey, P. M. Chau, J. Eldon, IEEE Press, NY, pp. 93-102, 1994. Link

    • Patents

  • G. Wertheizer, Y. Be'ery, B. Ovadia, Y. Gross, R. Perets, Y. Milstein, "A simplified cyclical buffer", U.S.A. Patent No. 5,463,749, filed: January 1993, issued: October 1995. Link
  • R. Perets, Y. Be'ery, B. Ovadia, Y. Gross, Y. Milstein, G. Wertheizer, "Two expandable memory banks with a continuous address space", U.S.A. Patent No. 5,537,576, filed: June 1993, issued: July 1996. Link
  • Y. Be'ery and O. Amrani, "Methods for efficient bounded distance decoding of the Hexacode and associated decoders for the Leech lattice and the Golay code”, U.S.A Patent No. 5,805,613, filed: November 1996, issued: September 1998. Link
  • Y. Be'ery and O. Amrani, "Methods for efficient bounded distance decoding of a family of block codes and associated error correction methods for the Hexacode, the Golay code and the Leech lattice", Israeli Pat. No. 116087, issued: Dec. 1999 Link

    • other

  • eForum on Pseudocodewords, Linear Programming, and Iterative Decoding of HDPC Codes Link
  • Web-site on High-Density Parity-Check (HDPC) Codes Link