Papers
Topics
Authors
Recent
Search
2000 character limit reached

On recovering missing values for sequences in a pathwise setting

Published 18 Apr 2016 in cs.IT, math.IT, math.ST, and stat.TH | (1604.04967v6)

Abstract: The paper suggests a frequency criterion of error-free recoverability of a missing value for sequences, i.e. discrete time processes, in a pathwise setting without probabilistic assumptions. The paper establishes error-free recoverability for classes of square-summable sequences with Z-transform vanishing at isolated points with a mild rate; the case of non-summable sequences is not excluded. The transfer functions for recovering algorithm are presented explicitly. Some robustness with respect to noise contamination is established for the suggested recovering algorithm.

Citations (5)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.