By Topic

Two-dimensional spectral factorization with applications in recursive digital filtering

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ekstrom, M.P. ; University of California, Livermore, CA, USA ; Woods, J.W.

The concept of spectral factorization is extended to two dimensions in such a way as to preserve the analytic characteristics of the factors. The factorization makes use of a homomorphic transform procedure due to Wiener. The resulting factors are shown to be recursively computable and stable in agreement with one-dimensional (1-D) spectral factorization. The factors are not generally two-dimensional (2-D) polynomials, but can be approximated as such. These results are applied to 2-D recursive filtering, filter design, and a computationally attractive stability test for recursive filters.

Published in:

Acoustics, Speech and Signal Processing, IEEE Transactions on  (Volume:24 ,  Issue: 2 )