Orthogonal matching pursuit(OMP for short)algorithm is a popular method of sparse signal recovery in compressed sensing.This paper applies OMP to the sparse polynomial reconstruction problem.Distinguishing from classi...Orthogonal matching pursuit(OMP for short)algorithm is a popular method of sparse signal recovery in compressed sensing.This paper applies OMP to the sparse polynomial reconstruction problem.Distinguishing from classical research methods using mutual coherence or restricted isometry property of the measurement matrix,the recovery guarantee and the success probability of OMP are obtained directly by the greedy selection ratio and the probability theory.The results show that the failure probability of OMP given in this paper is exponential small with respect to the number of sampling points.In addition,the recovery guarantee of OMP obtained through classical methods is lager than that of ℓ_(1)-minimization whatever the sparsity of sparse polynomials is,while the recovery guarantee given in this paper is roughly the same as that of ℓ_(1)-minimization when the sparsity is less than 93.Finally,the numerical experiments verify the availability of the theoretical results.展开更多
Introducing frequency agility into a distributed multipleinput multiple-output(MIMO)radar can significantly enhance its anti-jamming ability.However,it would cause the sidelobe pedestal problem in multi-target paramet...Introducing frequency agility into a distributed multipleinput multiple-output(MIMO)radar can significantly enhance its anti-jamming ability.However,it would cause the sidelobe pedestal problem in multi-target parameter estimation.Sparse recovery is an effective way to address this problem,but it cannot be directly utilized for multi-target parameter estimation in frequency-agile distributed MIMO radars due to spatial diversity.In this paper,we propose an algorithm for multi-target parameter estimation according to the signal model of frequency-agile distributed MIMO radars,by modifying the orthogonal matching pursuit(OMP)algorithm.The effectiveness of the proposed method is then verified by simulation results.展开更多
基金supported by the National Natural Science Foundation of China(Grant No.12071019).
文摘Orthogonal matching pursuit(OMP for short)algorithm is a popular method of sparse signal recovery in compressed sensing.This paper applies OMP to the sparse polynomial reconstruction problem.Distinguishing from classical research methods using mutual coherence or restricted isometry property of the measurement matrix,the recovery guarantee and the success probability of OMP are obtained directly by the greedy selection ratio and the probability theory.The results show that the failure probability of OMP given in this paper is exponential small with respect to the number of sampling points.In addition,the recovery guarantee of OMP obtained through classical methods is lager than that of ℓ_(1)-minimization whatever the sparsity of sparse polynomials is,while the recovery guarantee given in this paper is roughly the same as that of ℓ_(1)-minimization when the sparsity is less than 93.Finally,the numerical experiments verify the availability of the theoretical results.
文摘Introducing frequency agility into a distributed multipleinput multiple-output(MIMO)radar can significantly enhance its anti-jamming ability.However,it would cause the sidelobe pedestal problem in multi-target parameter estimation.Sparse recovery is an effective way to address this problem,but it cannot be directly utilized for multi-target parameter estimation in frequency-agile distributed MIMO radars due to spatial diversity.In this paper,we propose an algorithm for multi-target parameter estimation according to the signal model of frequency-agile distributed MIMO radars,by modifying the orthogonal matching pursuit(OMP)algorithm.The effectiveness of the proposed method is then verified by simulation results.
