Full Spark Frames

Details Full Spark Frames Full Spark Frames

2011-10-17

arxiv.org/abs/1110.3548v2

Mathematics

Functional Analysis

26 pages

Scientific paper

Finite frame theory has a number of real-world applications. In applications like sparse signal processing, data transmission with robustness to erasures, and reconstruction without phase, there is a pressing need for deterministic constructions of frames with the following property: every size-M subcollection of the M-dimensional frame elements is a spanning set. Such frames are called full spark frames, and this paper provides new constructions using the discrete Fourier transform. Later, we prove that full spark Parseval frames are dense in the entire set of Parseval frames, meaning full spark frames are abundant, even if one imposes an additional tightness constraint. Finally, we prove that testing whether a given matrix is full spark is hard for NP under randomized polynomial-time reductions, indicating that deterministic full spark constructions are particularly significant because they guarantee a property which is otherwise difficult to check.

Affiliated with

Also associated with

No associations

Rating

Full Spark Frames does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Full Spark Frames, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Full Spark Frames will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-317129