西安电子科技大学学报（自然科学版）2017，Vol.44Issue(1)：106-111,6.DOI:10.3969/j.issn.1001-2400.2017.01.019
低复杂度压缩感知中的快速观测方法
Fast sensing method in compressive sensing with low complexity
摘要
Abstract
The random sensing algorithms are hard for hardware implementation while the deterministic sensing algorithms have difficulty in acquiring large signals in the sensing systems of compressive sensing . This paper proposes a fast sensing method for compressive sensing with low complexity . The input signal is firstly permuted by an m‐sequence controlled interleaving device . Then the permuted signal is transformed by the fast Walsh‐Hadamard transform and down sampled to generate the measurements . Theoretical analysis indicates that the entries of the corresponding sensing matrices are asymptotically normally distributed . Simulation results show that the sensing performance of the corresponding matrices is almost the same as that of completely random sensing operators with a shorter computational time cost . The proposed method has good sensing performance and is easier for hardware implementation , which is meaningful in practice .关键词
压缩感知/快速观测/低复杂度/m序列Key words
compressive sensing/fast sensing/low-complexity/m-sequence分类
信息技术与安全科学引用本文复制引用
权磊,肖嵩,薛晓,李颖..低复杂度压缩感知中的快速观测方法[J].西安电子科技大学学报（自然科学版）,2017,44(1):106-111,6.基金项目
国家自然科学基金资助项目（61372069）；“111”工程资助项目 （）
