Wenjun Jiang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Wenjun Jiang has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Xiaojun Yuan
University of Electronic Science and Technology of China
11 shared publications - Chenchen Liu
University of Electronic Science and Technology of China
3 shared publications - Yong Zuo
College of Electronic Science and Technology, National University of Defense Technology, Changsha, China
2 shared publications Boyu Teng
National Key Laboratory of Wireless Communications, University of Electronic Science and Technology of China, Chengdu, China
1 shared publication- Boyu Teng
National Key Laboratory of Wireless Communications, University of Electronic Science and Technology of China, Chengdu, China
1 shared publication - Chang Cai
Department of Information Engineering, The Chinese University of Hong Kong, Shatin, Hong Kong
1 shared publication
Latest Publications
- 10 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 44 (07338716) , 3575-3590
Joint Activity Detection and Channel Estimation for Massive Connectivity: Where Message Passing Meets Score-Based Generative Priors
Massive connectivity supports the sporadic access of a vast number of devices without requiring prior permission from the base station (BS). In such scenarios, the BS must perform joint activity detection and channel estimation (JADCE) prior to data reception. Message passing algorithms have emerged as a prominent solution for JADCE under a Bayesian inference framework. The existing message passing algorithms, however, typically rely on some hand-crafted and overly simplistic priors of the wireless channel, leading to significant channel estimation errors and reduced activity detection accuracy. In this paper, we focus on the problem of JADCE in a multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) grant-free random access network. We propose to incorporate a more accurate channel prior learned by score-based generative models (a.k.a. diffusion models) into message passing, so as to push towards the performance limit of JADCE. Specifically, we develop a novel turbo message passing (TMP) framework that models the entire channel matrix as a super node, rather than factorizing it element-wise. This design enables the seamless integration of score-based generative models as a minimum mean-squared error (MMSE) denoiser. The variance of the denoiser, which is essential in message passing, can also be learned through score-based generative models. Our approach, termed score-based TMP for JADCE (STMP-JADCE), takes full advantages of the powerful generative prior and, meanwhile, benefits from the fast convergence speed of message passing. Numerical simulations show that STMP-JADCE drastically enhances the activity detection and channel estimation performance compared to the state-of-the-art baseline algorithms.
- 10 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 44 (07338716) , 3575-3590
Joint Activity Detection and Channel Estimation for Massive Connectivity: Where Message Passing Meets Score-Based Generative Priors
Massive connectivity supports the sporadic access of a vast number of devices without requiring prior permission from the base station (BS). In such scenarios, the BS must perform joint activity detection and channel estimation (JADCE) prior to data reception. Message passing algorithms have emerged as a prominent solution for JADCE under a Bayesian inference framework. The existing message passing algorithms, however, typically rely on some hand-crafted and overly simplistic priors of the wireless channel, leading to significant channel estimation errors and reduced activity detection accuracy. In this paper, we focus on the problem of JADCE in a multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) grant-free random access network. We propose to incorporate a more accurate channel prior learned by score-based generative models (a.k.a. diffusion models) into message passing, so as to push towards the performance limit of JADCE. Specifically, we develop a novel turbo message passing (TMP) framework that models the entire channel matrix as a super node, rather than factorizing it element-wise. This design enables the seamless integration of score-based generative models as a minimum mean-squared error (MMSE) denoiser. The variance of the denoiser, which is essential in message passing, can also be learned through score-based generative models. Our approach, termed score-based TMP for JADCE (STMP-JADCE), takes full advantages of the powerful generative prior and, meanwhile, benefits from the fast convergence speed of message passing. Numerical simulations show that STMP-JADCE drastically enhances the activity detection and channel estimation performance compared to the state-of-the-art baseline algorithms.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 74, 3317-3332
Low-Complexity Neural Pursuit for Line Spectral Estimation
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 74, 3317-3332
Low-Complexity Neural Pursuit for Line Spectral Estimation
- Open Access
- 30 December 2025
- Published by Institution of Engineering and Technology (IET) in Electronics Letters
- Vol. 62 (1)
Deep‐Learned Channel Estimation for MIMO‐OFDM System by Exploiting Frequency‐Space Correlation
In massive MIMO–OFDM systems, the accurate acquisition of channel state information is crucial for ensuring reliable data transmission. As the antenna array size and signal bandwidth increase, wireless channel often exhibits sparsity in the angular and delay domains. However, the random distribution of spatial angles poses a persistent challenge for convolutional neural networks to extract spatial features effectively for channel estimation. To address this issue, we proposes a novel channel estimation network termed the attentive residual autoencoder network. Leveraging an autoencoder architecture enhanced with attention mechanisms and residual connections, the proposed method effectively captures frequency‐space correlation. Numerical results show that the proposed algorithm significantly outperforms existing channel estimation methods.
- 30 December 2025
- Published by Institution of Engineering and Technology (IET) in Electronics Letters
- Vol. 62 (1)
Open AccessDeep‐Learned Channel Estimation for MIMO‐OFDM System by Exploiting Frequency‐Space Correlation
In massive MIMO–OFDM systems, the accurate acquisition of channel state information is crucial for ensuring reliable data transmission. As the antenna array size and signal bandwidth increase, wireless channel often exhibits sparsity in the angular and delay domains. However, the random distribution of spatial angles poses a persistent challenge for convolutional neural networks to extract spatial features effectively for channel estimation. To address this issue, we proposes a novel channel estimation network termed the attentive residual autoencoder network. Leveraging an autoencoder architecture enhanced with attention mechanisms and residual connections, the proposed method effectively captures frequency‐space correlation. Numerical results show that the proposed algorithm significantly outperforms existing channel estimation methods.
- 29 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 15 (21622337) , 171-175
Scene Structure Based Neural Radio-Frequency Radiance Fields for Channel Knowledge Map Construction
Channel knowledge map (CKM), as an emerging technology for environment-aware communication, corresponds transmitter/receiver locations to wireless channel states and can be used for the acquisition of channel state information (CSI) in wireless communications. However, accurately and efficiently constructing this location-to-channel mapping remains a key challenge. Inspired by the success of neural radio-frequency radiance fields (NeRF2) in predicting the spatial spectrum, we propose NeRF2 with scene structure (NeRF2-SS), which uses the scene structure as strong prior information in the neural network to predict the spatial spectrum. Specifically, NeRF2-SS introduces two new modules: 1) a scene structure based sampling method concentrating samples near the surfaces of the scatterers, and 2) a lightweight network architecture that distinctly processes near-surface and free-space samples. Simulation results show that NeRF2-SS achieves high-precision spatial spectrum prediction with an 85-90% reduction in inference latency compared to NeRF2.
- 29 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 15 (21622337) , 171-175
Scene Structure Based Neural Radio-Frequency Radiance Fields for Channel Knowledge Map Construction
Channel knowledge map (CKM), as an emerging technology for environment-aware communication, corresponds transmitter/receiver locations to wireless channel states and can be used for the acquisition of channel state information (CSI) in wireless communications. However, accurately and efficiently constructing this location-to-channel mapping remains a key challenge. Inspired by the success of neural radio-frequency radiance fields (NeRF2) in predicting the spatial spectrum, we propose NeRF2 with scene structure (NeRF2-SS), which uses the scene structure as strong prior information in the neural network to predict the spatial spectrum. Specifically, NeRF2-SS introduces two new modules: 1) a scene structure based sampling method concentrating samples near the surfaces of the scatterers, and 2) a lightweight network architecture that distinctly processes near-surface and free-space samples. Simulation results show that NeRF2-SS achieves high-precision spatial spectrum prediction with an 85-90% reduction in inference latency compared to NeRF2.
- 26 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 24 (7) , 6240-6256
Interference-Cancellation-Based Channel Knowledge Map Construction and Its Applications to Channel Estimation
Channel knowledge map (CKM) is viewed as a digital twin of wireless channels, providing location-specific channel knowledge for environment-aware communications. A fundamental problem in CKM-assisted communications is how to construct the CKM efficiently. Current research focuses on interpolating or predicting channel knowledge based on error-free channel knowledge from measured regions, ignoring the extraction of channel knowledge. This paper addresses this gap by unifying the extraction and representation of channel knowledge. We propose a novel CKM construction framework that leverages the received signals of the base station (BS) as online and low-cost data. Specifically, we partition the BS coverage area into spatial grids. The channel knowledge per grid is represented by a set of multi-path powers, delays, and angles, based on the principle of spatial consistency. In extracting these channel parameters, the challenges lie in strong intercell interference and non-linear relationships between received signals and channel parameters. To address these issues, we formulate the problem of CKM construction into a problem of Bayesian inference, employing a interference-activity prior model to characterize the path-loss differences of interferers. Under the Bayesian inference framework, we develop a hybrid messagepassing algorithm for the interference-cancellation-based CKM construction. Based on the CKM, we obtain the joint frequency-space covariance of the user channel and design a CKM-assisted Bayesian channel estimator. The computational complexity of the channel estimator is substantially reduced by exploiting the CKM-derived covariance structure. Numerical results show that the proposed CKM provides accurate channel parameters at low signal-to-interference-plus-noise ratio (SINR) and that the CKM-assisted channel estimator significantly outperforms state-of-the-art counterparts.
- 26 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 24 (7) , 6240-6256
Interference-Cancellation-Based Channel Knowledge Map Construction and Its Applications to Channel Estimation
Channel knowledge map (CKM) is viewed as a digital twin of wireless channels, providing location-specific channel knowledge for environment-aware communications. A fundamental problem in CKM-assisted communications is how to construct the CKM efficiently. Current research focuses on interpolating or predicting channel knowledge based on error-free channel knowledge from measured regions, ignoring the extraction of channel knowledge. This paper addresses this gap by unifying the extraction and representation of channel knowledge. We propose a novel CKM construction framework that leverages the received signals of the base station (BS) as online and low-cost data. Specifically, we partition the BS coverage area into spatial grids. The channel knowledge per grid is represented by a set of multi-path powers, delays, and angles, based on the principle of spatial consistency. In extracting these channel parameters, the challenges lie in strong intercell interference and non-linear relationships between received signals and channel parameters. To address these issues, we formulate the problem of CKM construction into a problem of Bayesian inference, employing a interference-activity prior model to characterize the path-loss differences of interferers. Under the Bayesian inference framework, we develop a hybrid messagepassing algorithm for the interference-cancellation-based CKM construction. Based on the CKM, we obtain the joint frequency-space covariance of the user channel and design a CKM-assisted Bayesian channel estimator. The computational complexity of the channel estimator is substantially reduced by exploiting the CKM-derived covariance structure. Numerical results show that the proposed CKM provides accurate channel parameters at low signal-to-interference-plus-noise ratio (SINR) and that the CKM-assisted channel estimator significantly outperforms state-of-the-art counterparts.
- 5 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 24 (5) , 4174-4189
Hybrid Vector Message Passing for Cascaded Channel Estimation in RIS-Aided Multi-User MIMO-OFDM Systems
This paper investigates the fundamental problem of cascaded channel estimation in reconfigurable intelligent surface (RIS) aided multi-user (MU) multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems. To address the high pilot overhead required by existing methods, we introduce appropriate auxiliary variables to decompose the received signal model into a subcarrier-wise bilinear sub-model and two linear sub-models with respect to the MU-to-RIS and RIS-to-base-station (BS) cascaded channels. The proposed model decomposition maintains the matrix factorization structure of the two cascaded channels and avoids the problem of parameter expansion in exiting methods. In the two linear sub-models, in addition, the cascaded channels are transformed into the delay-angle domain to leverage the joint sparsity. Based on the established models, we consider the problem of simultaneously estimating the MU-to-RIS and RIS-to-BS channel matrices as a bilinear estimation problem. To tackle this problem, we formulate a Bayesian inference framework and develop a hybrid message-passing (HVMP) algorithm to achieve approximate Bayesian inference by leveraging the Bethe method. Notably, the HVMP algorithm infers the two cascaded channels iteratively, where the covariance of each cascaded channel matrix is estimated to characterize the correlation of the matrix elements. Simulation results show that the proposed algorithm achieves accurate channel estimation with low pilot overhead while state-of-the-art baseline schemes exhibit poor performance. Furthermore, the proposed algorithm can approach the estimation oracle bound of the MU-to-RIS (or RIS-to-BS) channel which assumes perfect knowledge of the RIS-to-BS (or MU-to-RIS) channel.
- 5 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 24 (5) , 4174-4189
Hybrid Vector Message Passing for Cascaded Channel Estimation in RIS-Aided Multi-User MIMO-OFDM Systems
This paper investigates the fundamental problem of cascaded channel estimation in reconfigurable intelligent surface (RIS) aided multi-user (MU) multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems. To address the high pilot overhead required by existing methods, we introduce appropriate auxiliary variables to decompose the received signal model into a subcarrier-wise bilinear sub-model and two linear sub-models with respect to the MU-to-RIS and RIS-to-base-station (BS) cascaded channels. The proposed model decomposition maintains the matrix factorization structure of the two cascaded channels and avoids the problem of parameter expansion in exiting methods. In the two linear sub-models, in addition, the cascaded channels are transformed into the delay-angle domain to leverage the joint sparsity. Based on the established models, we consider the problem of simultaneously estimating the MU-to-RIS and RIS-to-BS channel matrices as a bilinear estimation problem. To tackle this problem, we formulate a Bayesian inference framework and develop a hybrid message-passing (HVMP) algorithm to achieve approximate Bayesian inference by leveraging the Bethe method. Notably, the HVMP algorithm infers the two cascaded channels iteratively, where the covariance of each cascaded channel matrix is estimated to characterize the correlation of the matrix elements. Simulation results show that the proposed algorithm achieves accurate channel estimation with low pilot overhead while state-of-the-art baseline schemes exhibit poor performance. Furthermore, the proposed algorithm can approach the estimation oracle bound of the MU-to-RIS (or RIS-to-BS) channel which assumes perfect knowledge of the RIS-to-BS (or MU-to-RIS) channel.
- 24 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 24 (3) , 2203-2217
Scalable Near-Field Localization Based on Partitioned Large-Scale Antenna Array
This paper studies a localization system, where an extremely large-scale antenna array (ELAA) is deployed at the base station (BS) to locate a user equipment (UE) residing in the near-field (Fresnel) region. We propose a novel algorithm, named array partitioning-based location estimation (APLE), for scalable near-field localization. The APLE algorithm is developed based on the basic assumption that, by partitioning the ELAA into multiple subarrays, the UE can be approximated as in the far-field region of each subarray. We establish a Bayeian inference framework based on the geometric constraints between the UE location and the angles of arrivals (AoAs) at different subarrays. Then, the APLE algorithm is designed based on the message-passing principle for the localization of the UE. APLE exhibits linear computational complexity with the number of BS antennas, leading to a significant reduction in complexity compared to existing methods. We further propose an enhanced APLE (E-APLE) algorithm that refines the location estimate obtained from APLE by following the maximum likelihood principle. The E-APLE algorithm achieves superior localization accuracy compared to APLE while maintaining a linear complexity with the number of BS antennas. Numerical results demonstrate that the proposed APLE and E-APLE algorithms outperform the existing baselines in terms of both localization accuracy and computational complexity.
- 24 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 24 (3) , 2203-2217
Scalable Near-Field Localization Based on Partitioned Large-Scale Antenna Array
This paper studies a localization system, where an extremely large-scale antenna array (ELAA) is deployed at the base station (BS) to locate a user equipment (UE) residing in the near-field (Fresnel) region. We propose a novel algorithm, named array partitioning-based location estimation (APLE), for scalable near-field localization. The APLE algorithm is developed based on the basic assumption that, by partitioning the ELAA into multiple subarrays, the UE can be approximated as in the far-field region of each subarray. We establish a Bayeian inference framework based on the geometric constraints between the UE location and the angles of arrivals (AoAs) at different subarrays. Then, the APLE algorithm is designed based on the message-passing principle for the localization of the UE. APLE exhibits linear computational complexity with the number of BS antennas, leading to a significant reduction in complexity compared to existing methods. We further propose an enhanced APLE (E-APLE) algorithm that refines the location estimate obtained from APLE by following the maximum likelihood principle. The E-APLE algorithm achieves superior localization accuracy compared to APLE while maintaining a linear complexity with the number of BS antennas. Numerical results demonstrate that the proposed APLE and E-APLE algorithms outperform the existing baselines in terms of both localization accuracy and computational complexity.
- 20 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 13 (8) , 2125-2129
Learning-Based Block-Wise Planar Channel Estimation for Time-Varying MIMO OFDM
In this paper, we propose a learning-based blockwise planar channel estimator (LBPCE) with high accuracy and low complexity to estimate the time-varying frequency-selective channel of a multiple-input multiple-output (MIMO) orthogonal frequency-division multiplexing (OFDM) system. First, we establish a block-wise planar channel model (BPCM) to characterize the correlation of the channel across subcarriers and OFDM symbols. Specifically, adjacent subcarriers and OFDM symbols are divided into several sub-blocks, and an affine function (i.e., a plane) with only three variables (namely, mean, time-domain slope, and frequency-domain slope) is used to approximate the channel in each sub-block, which significantly reduces the number of variables to be determined in channel estimation. Second, we design a 3D dilated residual convolutional network (3D-DRCN) that leverages the time-frequency-space-domain correlations of the channel to further improve the channel estimates of each user. Numerical results demonstrate that the proposed significantly outperforms the state-of-the-art estimators and maintains a relatively low computational complexity.
- 20 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 13 (8) , 2125-2129
Learning-Based Block-Wise Planar Channel Estimation for Time-Varying MIMO OFDM
In this paper, we propose a learning-based blockwise planar channel estimator (LBPCE) with high accuracy and low complexity to estimate the time-varying frequency-selective channel of a multiple-input multiple-output (MIMO) orthogonal frequency-division multiplexing (OFDM) system. First, we establish a block-wise planar channel model (BPCM) to characterize the correlation of the channel across subcarriers and OFDM symbols. Specifically, adjacent subcarriers and OFDM symbols are divided into several sub-blocks, and an affine function (i.e., a plane) with only three variables (namely, mean, time-domain slope, and frequency-domain slope) is used to approximate the channel in each sub-block, which significantly reduces the number of variables to be determined in channel estimation. Second, we design a 3D dilated residual convolutional network (3D-DRCN) that leverages the time-frequency-space-domain correlations of the channel to further improve the channel estimates of each user. Numerical results demonstrate that the proposed significantly outperforms the state-of-the-art estimators and maintains a relatively low computational complexity.
- 3 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 23 (9) , 12368-12381
Deep Active Learning for mmWave Array-Based Multi-Source AoA Tracking
In this paper, we investigate the problem of tracking the angles of arrival (AoAs) of multiple sources in millimeter wave (mmWave) systems with a limited number of radio frequency (RF) chains. Considering the time-varying nature of the channel, we propose a deep neural network (DNN)-based active learning scheme for adaptive analog beamforming and multi-source AoA tracking. The proposed scheme consists of a DNN-based beamformer and a subspace tracking-based multiple signal classification (MUSIC) estimator. Specifically, the DNN generates the beamformer using soft AoA estimates from the previous time block, and the MUSIC estimator exploits the measured signal by the beamformer to estimate the AoAs in the current time block. The proposed scheme is first applied to the uniform linear array (ULA) scenario, and then extended to the uniform rectangular array (URA) scenario. Particularly, in the URA scenario, to reduce the computational complexity, we modify the reduced-dimension MUSIC (RD-MUSIC) algorithm to a beam-space form. Furthermore, we adopt a partially connected analog beamforming scheme for the large-scale URA scenario to further reduce the hardware costs. We conduct numerical experiments to evaluate the tracking performance of the proposed scheme in the ULA and URA scenarios, and show that the proposed scheme significantly outperforms the existing codebook-based beamformer methods.
- 3 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 23 (9) , 12368-12381
Deep Active Learning for mmWave Array-Based Multi-Source AoA Tracking
In this paper, we investigate the problem of tracking the angles of arrival (AoAs) of multiple sources in millimeter wave (mmWave) systems with a limited number of radio frequency (RF) chains. Considering the time-varying nature of the channel, we propose a deep neural network (DNN)-based active learning scheme for adaptive analog beamforming and multi-source AoA tracking. The proposed scheme consists of a DNN-based beamformer and a subspace tracking-based multiple signal classification (MUSIC) estimator. Specifically, the DNN generates the beamformer using soft AoA estimates from the previous time block, and the MUSIC estimator exploits the measured signal by the beamformer to estimate the AoAs in the current time block. The proposed scheme is first applied to the uniform linear array (ULA) scenario, and then extended to the uniform rectangular array (URA) scenario. Particularly, in the URA scenario, to reduce the computational complexity, we modify the reduced-dimension MUSIC (RD-MUSIC) algorithm to a beam-space form. Furthermore, we adopt a partially connected analog beamforming scheme for the large-scale URA scenario to further reduce the hardware costs. We conduct numerical experiments to evaluate the tracking performance of the proposed scheme in the ULA and URA scenarios, and show that the proposed scheme significantly outperforms the existing codebook-based beamformer methods.
- 3 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 71 (1053587X) , 1683-1698
Simultaneous Active and Passive Information Transfer for RIS-Aided MIMO Systems: Iterative Decoding and Evolution Analysis
This paper investigates the potential of reconfigurable intelligent surface (RIS) for passive information transfer in a RIS-aided multiple-input multiple-output (MIMO) system. We propose a novel simultaneous active and passive information transfer (SAPIT) scheme. In SAPIT, the transmitter (Tx) and the RIS deliver information simultaneously, where the RIS information is carried through the RIS phase shifts embedded in reflected signals. We introduce the coded modulation technique at the Tx and the RIS. The main challenge of the SAPIT scheme is to simultaneously detect the Tx signals and the RIS phase coefficients at the receiver. To address this challenge, we introduce appropriate auxiliary variables to convert the original signal model into two linear models with respect to the Tx signals and one entry-by-entry bilinear model with respect to the RIS phase coefficients. With this auxiliary signal model, we develop a message-passing-based receiver algorithm. Furthermore, we analyze the fundamental performance limit of the proposed SAPIT-MIMO transceiver. Notably, we establish the state evolution to predict the receiver performance in a large-size system. We further analyze the achievable rates of the Tx and the RIS, which provides insight into the code design for sum-rate maximization. Numerical results validate our analysis and show that the SAPIT scheme outperforms the passive beamforming counterpart in achievable sum rate of the Tx and the RIS.
- 3 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 71 (1053587X) , 1683-1698
Simultaneous Active and Passive Information Transfer for RIS-Aided MIMO Systems: Iterative Decoding and Evolution Analysis
This paper investigates the potential of reconfigurable intelligent surface (RIS) for passive information transfer in a RIS-aided multiple-input multiple-output (MIMO) system. We propose a novel simultaneous active and passive information transfer (SAPIT) scheme. In SAPIT, the transmitter (Tx) and the RIS deliver information simultaneously, where the RIS information is carried through the RIS phase shifts embedded in reflected signals. We introduce the coded modulation technique at the Tx and the RIS. The main challenge of the SAPIT scheme is to simultaneously detect the Tx signals and the RIS phase coefficients at the receiver. To address this challenge, we introduce appropriate auxiliary variables to convert the original signal model into two linear models with respect to the Tx signals and one entry-by-entry bilinear model with respect to the RIS phase coefficients. With this auxiliary signal model, we develop a message-passing-based receiver algorithm. Furthermore, we analyze the fundamental performance limit of the proposed SAPIT-MIMO transceiver. Notably, we establish the state evolution to predict the receiver performance in a large-size system. We further analyze the achievable rates of the Tx and the RIS, which provides insight into the code design for sum-rate maximization. Numerical results validate our analysis and show that the SAPIT scheme outperforms the passive beamforming counterpart in achievable sum rate of the Tx and the RIS.