Exploiting Structured Sparsity with Low Complexity Sparse Bayesian Learning for RIS-assisted MIMO Channel Estimation
As an emerging communication auxiliary technology, reconfigurable intelligent surface (RIS) is expected to play a significant role in the upcoming 6G networks. Due to its total reflection characteristics, it is challenging to implement conventional channel estimation algorithms. This work focuses on RIS-assisted MIMO communications. Although many algorithms have been proposed to address this issue, there are still ample opportunities for improvement in terms of estimation accuracy, complexity, and applicability. To fully exploit the structured sparsity of the multiple-input-multiple-output (MIMO) channels, we propose a new channel estimation algorithm called unitary approximate message passing sparse Bayesian learning with partial common support identification (UAMPSBL-PCI). Thanks to the mechanism of PCI and the use of UAMP, the proposed algorithm has a lower complexity while delivering enhanced performance relative to existing channel estimation algorithms. Extensive simulations demonstrate its excellent performance in various environments.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Structured Bayesian Compression for Deep Neural Networks Based on The Turbo-VBI Approach
With the growth of neural network size, model compression has attracted increasing interest in recent research. As one of the most common techniques, pruning has been studied for a long time. By exploiting the structured…
Model CompressionBilinear Subspace Variational Bayesian Inference for Joint Scattering Environment Sensing and Data Recovery in ISAC Systems
This paper considers a joint scattering environment sensing and data recovery problem in an uplink integrated sensing and communication (ISAC) system. To facilitate joint scatterers localization and multi-user (MU) chann…
Bayesian InferenceIntegrated sensing and communicationISACPositionS2TA: Exploiting Structured Sparsity for Energy-Efficient Mobile CNN Acceleration
Exploiting sparsity is a key technique in accelerating quantized convolutional neural network (CNN) inference on mobile devices. Prior sparse CNN accelerators largely exploit un-structured sparsity and achieve significan…
Enabling Unstructured Sparse Acceleration on Structured Sparse Accelerators
Exploiting sparsity in deep neural networks (DNNs) has been a promising area for meeting the growing computation requirements. To minimize the overhead of sparse acceleration, hardware designers have proposed structured …
Tensor DecompositionExploiting Unstructured Sparsity in Fully Homomorphic Encrypted DNNs
The deployment of deep neural networks (DNNs) in privacy-sensitive environments is constrained by computational overheads in fully homomorphic encryption (FHE). This paper explores unstructured sparsity in FHE matrix mul…