.png){kind=icon}
Return
A numerical algorithm for stable 2D autoregressive filter design
.png){kind=icon}
OA
AI
DOI：10.1016/S0165-1684(03)00057-4.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Based on previous theoretical results we present in this paper a global estimation scheme for solving the stable 2D autoregressive filter problem. The different algorithms are based on the traditional Newton method and on the log barrier method that is employed in semi-definite programming. The Newton method is the faster one but the barrier method ensures that the iterates stay in the cone of positive semidefinites. In addition, a numerical test for the existence of a stable factorization of a two-variable squared magnitude response function is presented. (C) 2003 Elsevier Science B.V. All rights reserved.
Keywords:
autoregressive filter
AR process
bivariate stationary stochastic processes
structured matrix completions
two-variable Toeplitz matrix
two-variable polynomials
stability
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
10.0K
Citations:
1.7W
Organization
No organization information available
Cited Papers
ShareSaveEnhancement of relative sensitivity of photonic crystal fiber with high birefringence and low confinement loss.png)
Optik
OptikIF0
PREAI
ShareSaveShareSave no more
no more