Computable performance guarantees for compressed sensing matrices

EURASIP Journal on Advances in Signal Processing

Table 2 Lower bound on k and execution time (Gaussian matrix with n=1024)

Matrix A	Pick-1	k(UB(α₂)^b)	k(α₁)	LP^a
(a) Lower bound on k
102×1024	2	3	2	2
205×1024	4	4	4	4
307×1024	5	6	5	5
410×1024	7	8	7	7
512×1024	9	10	9	9
614×1024	12	13	12	12
717×1024	16	17	15	16
819×1024	21	23	20	21
922×1024	32	36	30	32
(b) Execution time (Unit: second)
102×1024	237	24 h	237	200
205×1024	452	24 h	452	429
307×1024	796	24 h	796	723
410×1024	1207	24 h	1207	1073
512×1024	1952	24 h	1952	1600
614×1024	2150	24 h	2150	2217
717×1024	1337	24 h	1337	2992
819×1024	838	24 h	838	3904
922×1024	386	24 h	386	4730