Papers
Topics
Authors
Recent
Search
2000 character limit reached

Expansions from frame coefficients with erasures

Published 4 Feb 2016 in math.FA | (1602.01656v1)

Abstract: We propose a new approach to the problem of recovering signal from frame coefficients with erasures. Such problems arise naturally from applications where some of the coefficients could be corrupted or erased during the data transmission. Provided that the erasure set satisfies the minimal redundancy condition, we construct a suitable synthesizing dual frame which enables us to perfectly reconstruct the original signal without recovering the lost coefficients. Such dual frames which compensate for erasures are described from various viewpoints. In the second part of the paper frames robust with respect to finitely many erasures are investigated. We characterize all full spark frames for finite-dimensional Hilbert spaces. In particular, we show that each full spark frames is generated by a matrix whose all square submatrices are nonsingular. In addition, we provide a method for constructing totally positive matrices. Finally, we give a method, applicable to a large class of frames, for transforming general frames into Parseval ones.

Summary

Paper to Video (Beta)

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.

Collections

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