.png){kind=icon}
.png){kind=icon}
Return
A periodically time-varying minimal partial realization algorithm based on twisting
.png){kind=icon}
PRE
AI
DOI：10.1016/S0005-1098(99)00064-3.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The 1975 paper of Meyer and Burrus gave necessary conditions on the coefficients of a periodically time-varying difference equation to generate a prespecified set of impulse responses. The main contribution of the present paper consists of an algorithm that constructs the coefficients of such a periodically time-varying realization of minimal lag. Thus the algorithm solves the minimal partial realization problem for the periodically time-varying (scalar) case. We use a general technique (twisting) for associating a time-invariant system with a periodically time-varying system in such a way that the time-step is preserved. The technique plays an essential role in the ideas underlying the algorithm. (C) 1999 Elsevier Science Ltd. All rights reserved.
Keywords:
impulse responses
linear systems
discrete-time systems
time-varying systems
difference equations
realisation theory
recursive algorithms
behaviour
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.