Prof. Yuval Bistritz 

School of Electrical Engineering

The Iby and Aladar Fleischman Faculty of Engineering
Tel Aviv University
Ramat Aviv 69978 
Phone: +972-3-6408174 
Fax: +972-3-6407095
e-mail: bistritz@eng.tau.ac.il

Yuval Bistritz received the B.Sc. in physics and the M.Sc. and Ph.D in electrical engineering (Summa Cum Laude), in 1973, 1978, and 1983, respectively, from Tel Aviv University, Israel. From 1979 to 1984 he held assistant and teaching positions in the department of Electrical Engineering, Tel Aviv University and in 1987 he joined this department as a faculty member. From 1984 to 1986 he was a research scholar in the Information System Laboratory, Stanford University, Stanford, CA, working on fast signal processing algorithms. From 1986 to 1987 he was with AT&T Bell Laboratories, Murray Hill NJ, and from 1994 to 1996 with DSP Group, Santa Clara CA, working on speech processing algorithms. Dr. Bistritz is a Fellow of the IEEE. He received the Weizmann fellowship award for postdoctoral research for 1984-1986 and the distinguished researcher award from the Israeli Technological Committee in 1992. He is the recipient of the 2015 IEEE Vitold Belevitch Circuits and Systems Award that honors the individual with fundamental contributions in the field of circuits and systems.

What is the Bistritz (stability) criterion?


A name attached (by other researchers of course) to a simple algebraic method to determine the zero location with respect to the unit-circle of a real (or complex) polynomial that I devised in [1984,1986]. It follows a different form from the common classical forms of the Schur-Cohn Marden-Jury stability tests that makes it reminiscent of the Routh test (the well known algorithm to test stability of continuous-time systems and analog filters devised by Routh in 1877). It is the most efficient possible algebraic way to test stability of discrete-time systems and digital filters. I presented in [2002] a more polished version of the test that behaves the same for stability testing but handles the zero location problem with extra simplicity.

What are the immittance algorithms?


Immittance is a prefix chosen for algorithms that follow the new formulation that stems from my stability test in order to distinguish them from corresponding so called scattering algorithms that follow the classical formulation (used since Levinson, Schur, Cohn, Marden and Jury). The term immittance was coined by Bode and is an abridged concatenation of impedance and admittance. I encountered W. H. Bode's book Network Analysis and Feedback Amplifier Design (1945) on Tom Kailath's shelf at Stanford just when I needed a meaningful name for the new formulation. From a mathematical perspective, the algorithms in the new formulation start with a pair of polynomials whose ratio forms a unit-circle immittance function (a function that is lossless on the unit-circle instead of on the imaginary axis).

What are the ISP / ISF parameters?

Immittance spectral pairs (ISP) or Immittance spectral frequencies (ISF) are stability parameters proposed to code speech by the LPC model [1993]. They are part of many speech compression standards: Third Generation Partnership Project (3GPP) for GSM; Third generation mobile communication WCDMA system; The ITU G.722.2 standard for wideband speech coding; The cdma2000 Variable-Rate Multimode Wideband (VMR-WB) and more.


My research interest includes:

  • Computer algebra and symbolic computation approach to signal processing algorithms.
  • Methods for testing stability of one- and multi-dimensional continuous and discrete systems.
  • Topics in speech signal processing (speaker recognition, low bit-rate speech coders and more).


List of Publications



The information for students taking my courses has been moved to our Virtual TAU.


Return to:
[Faculty of Engineering ]


Please send comments or questions about this page to: < webmaster@eng.tau.ac.il >

Last modified: June 2015.