A quasi-cyclic compressed sensing delay estimation algorithm based on progressive edge-growth

Time delay estimation (TDE) is a hot research topic in wireless location technology. Compressed sensing (CS) theory has been widely applied to image reconstruction and direction of arrival estimation since it was proposed in 2004. The sparse model can be constructed in time domain for estimating the time delay by using the CS theory. The measurement matrix plays a crucial role in the processing of signal reconstruction which is the core problem of CS theory. Therefore the research in the measurement matrix has becomes a hotspot in recent years. The existing measurement matrix is mainly divided into two categories, i.e., random measurement matrix and deterministic measurement matrix. The performance of random measurement matrix has bottlenecks. Firstly, because of the redundant measurement matrix data, the generation and storage of the random number put forward a high requirement for hardware. Secondly the random matrix can only satisfy the restricted isometry property in a statistical sense. The research of the deterministic measurement matrix is of great value under this background. The parity check matrix of low density parity check (LDPC) code has good performance in CS theory. However, the method of randomly selecting non-zero element position has a certain probability to generate a measurement matrix with a short loop structure during generating LDPC code measurement matrix. The robustness of the reconstruction performance decreases with the increase of iteration times. A novel quasi-cyclic CS algorithm based on progressive edge-growth is constructed to estimate the time delay. The purpose of this article is to deal with the need to store a large number of data in existing measurement matrix during time delay, by using the CS theory. The algorithm presented here can achieve TDE in a high precision. First, the theoretical bridge between CS and the maximum likelihood decoding is established. And the design criterion of measurement matrix based on the LDPC code is derived. The sparse measurement matrix with quasi-cyclic structure is constructed by introducing the idea of progressive edge-growth. Finally, the orthogonal matching pursuit algorithm is used to estimate the time delay. Furthermore, the computational complexity of the algorithm and the data storage of the measurement matrix are analyzed theoretically. Simulations show that the correct reconstruction probability of the proposed approach is higher than those of the Gauss random matrix and random LDPC matrix under the same dimension. Compared with the random LDPC matrix, the proposed method can improve performance at the expense of less complexity under the condition of the same data storage.