Skip to main content
SpringerLink
Log in

Two-Dimensional Schur Algorithm

  • Published:
Multidimensional Systems and Signal Processing Aims and scope Submit manuscript

Abstract

In this paper, a novel 2-D Schur algorithm is developed as a natural extension of the 1-D Schur recursion. This lattice structure is based on Parker and Kayran's four-field lattice approach. Starting with given 2-D autocorrelation samples, four quarter-plane gapped functions are generated. Their linear combination is used to satisfy gap conditions and calculate 2-D lattice parameter reflection factors for the first stage. In order to determine the growing number of 2-D reflection coefficients at succesive stages, appropriately defined auxiliary gapped functions are introduced after the first order. The theory has been confirmed by computer simulations. In addition to developing the basic theory, the presentation includes a comparison between the proposed 2-D lattice structure and other existing four-field lattice structures.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. T. Kailath, “A theorem of I. Schur and its impact on modern signal processing.” In The Schur Memorial Volume, Operator Theory: Advances and Applications, (I. Gohberg, ed.), Springer-Verlag, 1986, vol. 18, pp. 9–30.

  2. S. J. Orfanidis, Optimum Signal Processing, New York: MacMillan, 1988.

    Google Scholar 

  3. T. Kailath, “Signal Processing in the VLSI Era.” In VLSI and Modern Signal Processing, (S. Y. Kung, H. Whitehouse, and T. Kailath, eds.), New Jersey: Prentice-Hall, 1985.

    Google Scholar 

  4. T. Kailath, A. M. Bruckstein, and D. Morgan, “Fast matrix factorization via discrete transmission-lines,” Linear Algebra and Appl., vol. 75, 1986, pp. 1–25.

    Google Scholar 

  5. P. Dewilde, A. Vieira, and T. Kailath, “On the generalized Szego-Levinson realization algorithm for optimal linear predictors based on a network synthesis approach,” IEEE Trans. on Circuits and Systems, vol. CAS-25, 1978, pp. 663–675.

    Google Scholar 

  6. A. M. Bruckstein and T. Kailath, “An inverse scattering framework for several problems in signal processing,” IEEE ASSP Magazine, vol. 1, Jan. 1987, pp. 6–20.

    Google Scholar 

  7. A. Yagle and B. C. Levy, “The Schur algorithm and its applications,” Acta Applic. Math., vol. 3, 1985, p. 255.

    Google Scholar 

  8. E. A. Robinson and S. Treitel, “Maximum entropy and the relationship of the partial autocorrelation to the reflection coefficients of a layered system,” IEEE Trans. on Acoust., Speech, Signal Processing, vol. ASSP-28, April 1980, pp. 224–235.

    Google Scholar 

  9. S. Haykin, Adaptive Filter Theory, Englewood Cliffs, NJ: Prentice-Hall, 1986.

    Google Scholar 

  10. T. L. Marzetta, “Two-dimensional linear prediction: Autocorrelation arrays, minimum phase prediction error filters, and reflection coefficient arrays,” IEEE Trans. on Acoust., Speech, Signal Processing, vol. ASSP-28, Dec. 1980, pp. 725–733.

  11. S. R. Parker and A. H. Kayran, “Lattice parameter autoregressive modeling of 2-D fields, Part I: The quarterplane case,” IEEE Trans. on Acoust. Speech, Signal Processing, vol. ASSP-32, Aug. 1984, pp. 872–885.

  12. H. Lev-Ari and S. R. Parker, “Lattice filter models of two-dimensional fields,” Proc. IEEE Int. Conf. on Acoust. Speech, Signal Processing, Tampa, Florida, March 1985, pp. 1317–1320.

  13. C.W. Therrien,“Relation between 2-D and multichannel linear prediction,” IEEE Trans. on Acoust. Speech, Signal Processing, vol. ASSP-29, June 1981, pp. 454–456.

  14. P. J. Lenk and S. R. Parker, “Schur and Levinson recursions for two-dimensional data fields,” Proc. IEEE Int. Symp. on Circuits and Systems, San Jose, CA, May 1986, pp. 92–95.

  15. H. K. Kwan and Y. C. Lui, “Lattice implementation of two-dimensional recursive digital filters,” IEEE Trans. on Circuits and Systems, vol. CAS-36, March 1989, pp. 383–386.

  16. B. F. McGuffin and B. Lui., “An efficient algorithm for two-dimensional autoregressive spectrum estimation,” IEEE Trans. on Acoust., Speech, Signal Processing, vol. ASSP-37, Jan. 1989, pp. 106–117.

  17. N. K. Bose, “Multidimensional digital signal processing: Problems, progress and future scopes,” Proc. IEEE, vol. 78, April 1990, pp. 590–597.

  18. A. H. Kayran, “Design of 2-D recursive filters with asymmetric half-plane lattice modeling,” IEE Proceedings, Part G, vol. 137, Dec. 1989, pp. 427–438.

  19. A. Ertüzün, A. H. Kayran, and E. Panayirci, “An improved 2-D lattice filter and its entropy relations,” Signal Processing, vol. 28, no. 1, July 1992, pp. 1–24.

    Google Scholar 

  20. H. Moro, T. Watanabe, A. Taguchi, and N. Hamada, “On the adaptive algorithm and its convergence rate improvement of 2-D lattice filter.” In Proceedings of ECCTD' 89, 1989, pp. 430–434.

  21. L. F. Chapparro and M. Boudaoud, “Two-dimensional linear prediction covariance method and its solution,” IEEE Trans. on Systems, Man an Cybernetics, vol. SMC-17, no. 4, July/August 1987, pp. 617–621.

    Google Scholar 

  22. Ü Kücük, Quarter-plane AR modeling of 2-D random fields, Ph.D Thesis, Yildiz Technical University, Istanbul, 1995.

    Google Scholar 

  23. H. K. Kwan and Y. C. Lui, “Image data compression using 2-D lattice modeling method,” Proc. IEE, vol. 134, Part F, 1987, pp. 401–404.

    Google Scholar 

  24. A. H. Kayran, S. R. Parker and D. J. Klich,“Two-dimesional spectral estimation with autoregressive lattice parameters.” In Proc. IEEE Int. Conf. on Acoust., Speech and Signal Processing, San Diego, California, March 1984.

  25. H. K. Kwan and Y. C. Lui, “3-D lattice predictive modeling of random fields.” In Proc. IEEE Int. Conf. on Acoust., Speech and Signal Processing, Tokyo, Japan, 1986, pp. 1057–1060.

  26. A. H. Kayran, S. R. Parker, and H. Cambazoglu, “Design of the 2-D recursive digital filters with autoregressive lattice parameter factors.” In Proc. Int. Symp. on Circuits and Systems, Montreal, Canada, May 1984, pp. 470–473.

  27. M. N. Nam and W. D. O'Neill, “Adaptive linear predictive coding of time varying images using multidimensional recursive least squares ladder filters,” IEEE Journal on Selected Areas in Comm., vol. SAC-5, August 1987, pp. 1115–1126.

  28. H. Youlal, M. Janati-I, and M. Najim, “Two-dimensional joint process lattice adaptive restoration of images,” IEEE Trans. on Image Processing, vol. 1, July 1992, pp. 366–378.

  29. A. H. Kayran, “Two-dimensional orthogonal lattice structures for autoregressive modeling of random fields,” IEEE Trans. on Signal Processing, vol. 44, April 1996, pp. 963–978.

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, Istanbul Technical University, Maslak, Istanbul o[80626, Turkey

    Ahmet H. Kayran (Professor)

  2. Department of Electronics and Comm., Yildiz Technical University, Maslak, Istanbul, 80670, Turkey

    Unal Kücük (Assistant Professor)

  3. Information Systems Laboratory, Department of Electrical Engineering, Stanford University, Stanford, CA, 94305, USA

    Sydney R. Parker (Consulting Professor)

Authors
  1. Ahmet H. Kayran
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Unal Kücük
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sydney R. Parker
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kayran, A.H., Kücük, U. & Parker, S.R. Two-Dimensional Schur Algorithm. Multidimensional Systems and Signal Processing 9, 7–37 (1998). https://doi.org/10.1023/A:1008247520626

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008247520626

Search

Navigation