An upper bound is obtained for the restoration error variance of a sample restoration method for autoregressive processes that was presented by A.J.E.M. Janssen et al. (ibid., vol.ASSP-34, p.317-30, Apr. 1986). The upper bound derived is lower if the autoregressive process has poles close to the unit circle of the complex plane. This situation corresponds to a peaky signal spectrum. The bound is valid for the case in which one sample is unknown in a realization of an autoregressive process of arbitrary finite orde
The problem of estimating lost sample values in discrete-time signals is considered. The problem is ...
We consider the problem of estimating lost sample values in discrete—time signals. The problem is tr...
The exact statistics of the estimated reflection coefficients for an autoregressive process are diff...
An upper bound is obtained for the restoration error variance of a sample restoration method for aut...
This paper presents an adaptive algorithm for the restoration of lost sample values in discrete-time...
The authors present an adaptive algorithm for the restoration of lost sample values in discrete-time...
The authors present an adaptive algorithm for the restoration of lost sample values in discrete-time...
The authors present an adaptive algorithm for the restoration of lost sample values in discrete-time...
The authors present an adaptive algorithm for the restoration of lost sample values in discrete-time...
Algorithms for the restoration of unknown samples at known positions embedded in a neighborhood of k...
Algorithms for the restoration of unknown samples at known positions embedded in a neighborhood of k...
This paper presents an adaptive algorithm for the restoration of lost sample values in discrete-time...
Abstract-This paper presents an adaptive algorithm for the resto-ration of lost sample values in dis...
Algorithms for the restoration of unknown samples at known positions embedded in a neighborhood of k...
Algorithms for the restoration of unknown samples at known positions embedded in a neighborhood of k...
The problem of estimating lost sample values in discrete-time signals is considered. The problem is ...
We consider the problem of estimating lost sample values in discrete—time signals. The problem is tr...
The exact statistics of the estimated reflection coefficients for an autoregressive process are diff...
An upper bound is obtained for the restoration error variance of a sample restoration method for aut...
This paper presents an adaptive algorithm for the restoration of lost sample values in discrete-time...
The authors present an adaptive algorithm for the restoration of lost sample values in discrete-time...
The authors present an adaptive algorithm for the restoration of lost sample values in discrete-time...
The authors present an adaptive algorithm for the restoration of lost sample values in discrete-time...
The authors present an adaptive algorithm for the restoration of lost sample values in discrete-time...
Algorithms for the restoration of unknown samples at known positions embedded in a neighborhood of k...
Algorithms for the restoration of unknown samples at known positions embedded in a neighborhood of k...
This paper presents an adaptive algorithm for the restoration of lost sample values in discrete-time...
Abstract-This paper presents an adaptive algorithm for the resto-ration of lost sample values in dis...
Algorithms for the restoration of unknown samples at known positions embedded in a neighborhood of k...
Algorithms for the restoration of unknown samples at known positions embedded in a neighborhood of k...
The problem of estimating lost sample values in discrete-time signals is considered. The problem is ...
We consider the problem of estimating lost sample values in discrete—time signals. The problem is tr...
The exact statistics of the estimated reflection coefficients for an autoregressive process are diff...