Explicit constructions of RIP matrices and related problems

Abstract

Abstract. We give a new explicit construction of n × N matrices satisfying the Restricted Isometry Property (RIP). Namely, for some ε > 0, large N and any n satisfying N 1−ε ≤ n ≤ N , we construct RIP matrices of order k ≥ n 1/2+ε and constant δ = n −ε . This overcomes the natural barrier k = O(n 1/2 ) for proofs based on small coherence, which are used in all previous explicit constructions of RIP matrices. Key ingredients in our proof are new estimates for sumsets in product sets and for exponential sums with the products of sets possessing special additive structure. We also give a construction of sets of n complex numbers whose k-th moments are uniformly small for 1 ≤ k ≤ N (Turán's power sum problem), which improves upon known explicit constructions when (log N ) 1+o(1) ≤ n ≤ (log N ) 4+o(1) . This latter construction produces elementary explicit examples of n × N matrices that satisfy RIP and whose columns constitute a new spherical code; for those problems the parameters closely match those of existing constructions in the range (log N ) 1+o(1) ≤ n ≤ (log N ) 5/2+o(1) .

Construction of Sparse Binary Sensing Matrices Using Set Systems

“…The following proposition [9] relates the RIP constant δ k and μ. Candes [2] has shown that whenever φ satisfies RIP of order 3k with δ 3k < 1, the CS reconstruction error satisfies the following estimate…”

General similar sensing matrix pursuit: An efficient and rigorous reconstruction algorithm to cope with deterministic sensing matrix with high coherence

“…Coherence plays a central role in the sensing matrix construction, because small coherence implies the RIP [9]. In the early work of compressed sensing, the entries of the sensing matrix are generated by an independent identically distributed (i.i.d.)…”

Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition

“…Additive combinatorics also has important applications in e-voting [77,220]. Recently, Bourgain et al [51] gave a new explicit construction of matrices satisfying the Restricted Isometry Property (RIP) using ideas from additive combinatorics. RIP is related to the matrices whose behavior is nearly orthonormal (at least when acting on sufficiently sparse vectors); it has several applications, in particular, in compressed sensing [71,72,73].…”