Answers are grounded in this paper and cite their sources.
The Levinson algorithm has been widely utilized in the solution of the normal equations which arise in Wiener filtering. The algorithm can be easily derived and implemented using Szegö polynomials. In recent years, Wiener filtering techniques have been extended to two-dimensional processes. We show that the Szegö polynomials have bivariate analogues which can be used to derive and implement a two-dimensional analogue of the Levinson algorithm.
No takes yet. Share an insight, caveat, or question.
J. H. Justice (1977) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: