Dynamic Compressive Sensing based on RLS for Underwater Acoustic Communications
원문 초록
Sparse structures are widely recognized and utilized in channel estimation. Two typical mechanisms, namely proportionate updating (PU) and zero-attracting (ZA) techniques, achieve better performance, but their computational complexity are higher than non-sparse counterparts. In this paper, we propose a DCS technique based on the recursive least squares (RLS) algorithm which can simultaneously achieve improved performance and reduced computational complexity. Specifically, we develop the sparse adaptive subspace pursuit-improved RLS (SpAdSP-IRLS) algorithm by updating only the sparse structure in the IRLS to track significant coefficients. The complexity of the SpAdSP-IRLS algorithm is successfully reduced to $\mathcal{O}(L^2+2L(s+1)+10s)$, compared with the order of $\mathcal{O}(3L^2+4L)$ for the standard RLS. Here, $L$ represents the length of the channel, and $s$ represents the size of the support set. Our experiments on both synthetic and real data show the superiority of the proposed SpAdSP-IRLS, even though only $s$ elements are updated in the channel estimation.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Discrete and Continuous Difference of Submodular Minimization
Knockoff-Guided Compressive Sensing: A Statistical Machine Learning Framework for Support-Assured Signal Recovery
Sampling Innovation-Based Adaptive Compressive Sensing
Flexible Intelligent Metasurface-Aided Wireless Communications: Architecture and Performance
Modeling and Optimization for Flexible Cylindrical Arrays-Enabled Wireless Communications
Using Powerful Prior Knowledge of Diffusion Model in Deep Unfolding Networks for Image Compressive Sensing
토론
이 논문과 연결된 포럼 글이 아직 없습니다.