No Arabic abstract
In this paper, we propose a deep learning aided list approximate message passing (AMP) algorithm to further improve the user identification performance in massive machine type communications. A neural network is employed to identify a suspicious device which is most likely to be falsely alarmed during the first round of the AMP algorithm. The neural network returns the false alarm likelihood and it is expected to learn the unknown features of the false alarm event and the implicit correlation structure in the quantized pilot matrix. Then, via employing the idea of list decoding in the field of error control coding, we propose to enforce the suspicious device to be inactive in every iteration of the AMP algorithm in the second round. The proposed scheme can effectively combat the interference caused by the suspicious device and thus improve the user identification performance. Simulations demonstrate that the proposed algorithm improves the mean squared error performance of recovering the sparse unknown signals in comparison to the conventional AMP algorithm with the minimum mean squared error denoiser.
The realization of practical intelligent reflecting surface (IRS)-assisted multi-user communication (IRS-MUC) systems critically depends on the proper beamforming design exploiting accurate channel state information (CSI). However, channel estimation (CE) in IRS-MUC systems requires a significantly large training overhead due to the numerous reflection elements involved in IRS. In this paper, we adopt a deep learning approach to implicitly learn the historical channel features and directly predict the IRS phase shifts for the next time slot to maximize the average achievable sum-rate of an IRS-MUC system taking into account the user mobility. By doing this, only a low-dimension multiple-input single-output (MISO) CE is needed for transmit beamforming design, thus significantly reducing the CE overhead. To this end, a location-aware convolutional long short-term memory network (LA-CLNet) is first developed to facilitate predictive beamforming at IRS, where the convolutional and recurrent units are jointly adopted to exploit both the spatial and temporal features of channels simultaneously. Given the predictive IRS phase shift beamforming, an instantaneous CSI (ICSI)-aware fully-connected neural network (IA-FNN) is then proposed to optimize the transmit beamforming matrix at the access point. Simulation results demonstrate that the sum-rate performance achieved by the proposed method approaches that of the genie-aided scheme with the full perfect ICSI.
We consider an ambient backscatter communication (AmBC) system aided by an intelligent reflecting surface (IRS). The optimization of the IRS to assist AmBC is extremely difficult when there is no prior channel knowledge, for which no design solutions are currently available. We utilize a deep reinforcement learning-based framework to jointly optimize the IRS and reader beamforming, with no knowledge of the channels or ambient signal. We show that the proposed framework can facilitate effective AmBC communication with a detection performance comparable to several benchmarks under full channel knowledge.
In a practical massive MIMO (multiple-input multiple-output) system, the number of antennas at a base station (BS) is constrained by the space and cost factors, which limits the throughput gain promised by theoretical analysis. This paper thus studies the feasibility of adopting the intelligent reflecting surface (IRS) to further improve the beamforming gain of the uplink communications in a massive MIMO system. Under such a novel system, the central question lies in whether the IRS is able to enhance the network throughput as expected, if the channel estimation overhead is taken into account. In this paper, we first show that the favorable propagation property for the conventional massive MIMO system without IRS, i.e., the channels of arbitrary two users are orthogonal, no longer holds for the IRS-assisted massive MIMO system, due to its special channel property that each IRS element reflects the signals from all the users to the BS via the same channel. As a result, the maximal-ratio combining (MRC) receive beamforming strategy leads to strong inter-user interference and thus even lower user rates than those of the massive MIMO system without IRS. To tackle this challenge, we propose a novel strategy for zero-forcing (ZF) beamforming design at the BS and reflection coefficients design at the IRS to efficiently null the inter-user interference. Under our proposed strategy, it is rigorously shown that even if the channel estimation overhead is considered, the IRS-assisted massive MIMO system can always achieve higher throughput compared to its counterpart without IRS, despite the fact that the favorable propagation property no longer holds.
Reconfigurable intelligent surfaces (RISs) have been recently considered as a promising candidate for energy-efficient solutions in future wireless networks. Their dynamic and lowpower configuration enables coverage extension, massive connectivity, and low-latency communications. Due to a large number of unknown variables referring to the RIS unit elements and the transmitted signals, channel estimation and signal recovery in RIS-based systems are the ones of the most critical technical challenges. To address this problem, we focus on the RIS-assisted multi-user wireless communication system and present a joint channel estimation and signal recovery algorithm in this paper. Specifically, we propose a bidirectional approximate message passing algorithm that applies the Taylor series expansion and Gaussian approximation to simplify the sum-product algorithm in the formulated problem. Our simulation results show that the proposed algorithm shows the superiority over a state-of-art benchmark method. We also provide insights on the impact of different RIS parameter settings on the proposed algorithms.
In this paper, we consider massive multiple-input-multiple-output (MIMO) communication systems with a uniform planar array (UPA) at the base station (BS) and investigate the downlink precoding with imperfect channel state information (CSI). By exploiting both instantaneous and statistical CSI, we aim to design precoding vectors to maximize the ergodic rate (e.g., sum rate, minimum rate and etc.) subject to a total transmit power constraint. To maximize an upper bound of the ergodic rate, we leverage the corresponding Lagrangian formulation and identify the structural characteristics of the optimal precoder as the solution to a generalized eigenvalue problem. As such, the high-dimensional precoder design problem turns into a low-dimensional power control problem. The Lagrange multipliers play a crucial role in determining both precoder directions and power parameters, yet are challenging to be solved directly. To figure out the Lagrange multipliers, we develop a general framework underpinned by a properly designed neural network that learns directly from CSI. To further relieve the computational burden, we obtain a low-complexity framework by decomposing the original problem into computationally efficient subproblems with instantaneous and statistical CSI handled separately. With the off-line pretrained neural network, the online computational complexity of precoding is substantially reduced compared with the existing iterative algorithm while maintaining nearly the same performance.