关键词: 压缩感知, 快速观测, 低复杂度, m序列

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.

Key words: compressive sensing, fast sensing, low-complexity, m-sequence