The Community for Technology Leaders
Proceedings of 1994 28th Asilomar Conference on Signals, Systems and Computers (1994)
Pacific Grove, CA, USA
Oct. 31, 1994 to Nov. 2, 1994
ISSN: 1058-6393
ISBN: 0-8186-6405-3
pp: 368-371
T. Boros , Inf. Syst. Lab., Stanford Univ., CA, USA
J. Kamali , Inf. Syst. Lab., Stanford Univ., CA, USA
T. Kailath , Inf. Syst. Lab., Stanford Univ., CA, USA
ABSTRACT
The so-called analytic interpolation problem is addressed and solved. The objective is to find the family of rational interpolants which are analytic in a certain region of the complex plane. It turns out that the usual linear fractional map cannot be used to describe the solution set conveniently. Instead, an affine parametrization formula is proposed as the natural framework to impose analyticity constraint on the interpolants. All solutions of the interpolation problem are characterized in terms of a generating system, which can be obtained efficiently via a fast recursive algorithm. The recursive procedure can be used to update the solutions whenever a new interpolation constraint is added to the input data set. It is shown that the analytic interpolation problem is solvable if and only if the corresponding unconstrained problem is solvable, i.e., if and only if the interpolation data-set is consistent. The above results have many applications in different areas such as stable lattice filter design, channel identification, and Q-parametrization of stabilizing controllers.<>
INDEX TERMS
interpolation, lattice filters, digital filters, digital arithmetic, recursive filters
CITATION

T. Boros, J. Kamali and T. Kailath, "Analytic interpolation problems and lattice filter design," Proceedings of 1994 28th Asilomar Conference on Signals, Systems and Computers(ACSSC), Pacific Grove, CA, USA, 1995, pp. 368-371.
doi:10.1109/ACSSC.1994.471478
83 ms
(Ver 3.3 (11022016))