Affordable Access

Access to the full text

Two-Dimensional Schur Algorithm

Authors
  • Kayran, Ahmet H.1
  • Kücük, Unal2
  • Parker, Sydney R.3
  • 1 Istanbul Technical University, Department of Electrical Engineering, Maslak, Istanbul o[80626, Turkey , Maslak, Istanbul o[80626
  • 2 Yildiz Technical University, Department of Electronics and Comm., Maslak, Istanbul, 80670, Turkey , Maslak, Istanbul
  • 3 Stanford University, Information Systems Laboratory, Department of Electrical Engineering, Stanford, CA, 94305, USA , Stanford
Type
Published Article
Journal
Multidimensional Systems and Signal Processing
Publisher
Kluwer Academic Publishers
Publication Date
Jan 01, 1998
Volume
9
Issue
1
Pages
7–37
Identifiers
DOI: 10.1023/A:1008247520626
Source
Springer Nature
Keywords
License
Yellow

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.

Report this publication

Statistics

Seen <100 times