Deterministic Construction of Toeplitzed Structurally Chaotic Matrix for Compressed Sensing

被引:21
作者
Zeng, Li [1 ]
Zhang, Xiongwei [1 ]
Chen, Liang [2 ]
Cao, Tieyong [1 ]
Yang, Jibin [1 ]
机构
[1] PLA Univ Sci & Technol, Coll Command Informat Syst, Nanjing, Jiangsu, Peoples R China
[2] PLA Univ Sci & Technol, Coll Commun Engn, Nanjing, Jiangsu, Peoples R China
关键词
Compressed sensing; Deterministic sensing matrix; Incoherent sampling; Restricted isometry property; Mutual coherence; Asymptotical normal distribution; SIGNAL RECOVERY;
D O I
10.1007/s00034-014-9873-7
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The construction of sensing matrix is a fundamental issue in compressed sensing (CS). This paper introduces a new deterministic construction, referred to as Toeplitzed structurally chaotic matrix (TSCM), which possesses the advantages of both random and structural sensing matrices. We derive the matrix by first multiplying an orthonormal matrix with a chaotic-based Toeplitz matrix, and then subsampling the resultant matrix to obtain the structural one. Theoretically, we show that the entries of the TSCM are asymptotically normally distributed with that of arbitrary sparsifying matrices, yielding low mutual coherence that guarantees faithful recovery. Moreover, the proposed scheme is implementation friendly and hardware efficient, since its entries have almost no randomness and are easy to generate. Extensive numerical results via Matlab suggest that the TSCM outperforms the state-of-the-art matrix schemes and demonstrate its promising potentials.
引用
收藏
页码:797 / 813
页数:17
相关论文
共 39 条
[1]   Matrices With Small Coherence Using p-Ary Block Codes [J].
Amini, Arash ;
Montazerhodjat, Vahid ;
Marvasti, Farokh .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2012, 60 (01) :172-181
[2]   Toeplitz-structured compressed sensing matrices [J].
Bajwa, Waheed U. ;
Haypt, Jarvis D. ;
Raz, Gil M. ;
Wright, Stephen J. ;
Nowak, Robert D. .
2007 IEEE/SP 14TH WORKSHOP ON STATISTICAL SIGNAL PROCESSING, VOLS 1 AND 2, 2007, :294-+
[3]   Compressive sensing [J].
Baraniuk, Richard G. .
IEEE SIGNAL PROCESSING MAGAZINE, 2007, 24 (04) :118-+
[4]   New Bounds for Restricted Isometry Constants [J].
Cai, T. Tony ;
Wang, Lie ;
Xu, Guangwu .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (09) :4388-4394
[5]   Decoding by linear programming [J].
Candes, EJ ;
Tao, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (12) :4203-4215
[6]   Sparsity and incoherence in compressive sampling [J].
Candes, Emmanuel ;
Romberg, Justin .
INVERSE PROBLEMS, 2007, 23 (03) :969-985
[7]  
Candès EJ, 2008, IEEE SIGNAL PROC MAG, V25, P21, DOI 10.1109/MSP.2007.914731
[8]   Quantitative robust uncertainty principles and optimally sparse decompositions [J].
Candès, Emmanuel J. ;
Romberg, Justin .
FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 2006, 6 (02) :227-254
[9]   Near-optimal signal recovery from random projections: Universal encoding strategies? [J].
Candes, Emmanuel J. ;
Tao, Terence .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (12) :5406-5425
[10]   Stable signal recovery from incomplete and inaccurate measurements [J].
Candes, Emmanuel J. ;
Romberg, Justin K. ;
Tao, Terence .
COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS, 2006, 59 (08) :1207-1223