Experience-driven learning-based intelligent hybrid beamforming for massive MIMO mmWave communications

We have studied massive MIMO hybrid beamforming (HBF) for millimeter-wave (mmWave) communications, where the transceivers only have a few radio frequency chain (RFC) numbers compared to the number of antenna elements. We propose a hybrid beamforming design to improve the system’s spectral, hardware, and computational efficiencies, where finding the precoding and combining matrices are formulated as optimization problems with practical constraints. The series of analog phase shifters creates a unit modulus constraint, making this problem non-convex and subsequently incurring unaffordable computational complexity. Advanced deep reinforcement learning techniques effectively handle non-convex problems in many domains; therefore, we have transformed this non-convex hybrid beamforming optimization problem using a reinforcement learning framework. These frameworks are solved using advanced deep reinforcement learning techniques implemented with experience replay schemes to maximize the spectral and learning efficiencies in highly uncertain wireless environments. We developed a twin-delayed deep deterministic (TD3) policy gradient-based hybrid beamforming scheme to overcome Q-learning’s substantial overestimation. We assumed a complete channel state information (CSI) to design our beamformers and then challenged this assumption by proposing a deep reinforcement learning-based channel estimation method. We reduced hybrid beamforming complexity using soft target double deep Q-learning to exploit mmWave channel sparsity. This method allowed us to construct the analog precoder by selecting channel dominant paths. We have demonstrated that the proposed approaches improve the system’s spectral and learning efficiencies compared to prior studies. We have also demonstrated that deep reinforcement learning is a versatile technique that can unleash the power of massive MIMO hybrid beamforming in mmWave systems for next-generation wireless communication.     

Two-level-enforced security with hybrid precoding for multicast massive MIMO wiretap systems

Multicast hybrid precoding reaches a compromise among hardware complexity, transmission performance and wireless resource efficiency in massive MIMO systems. However, system security is extremely challenging with the appearance of eavesdroppers. Physical layer security (PLS) is a relatively effective approach to improve transmission and security performance for multicast massive MIMO wiretap systems. In this paper, we consider a transmitter with massive antennas transmits the secret signal to many legitimate users with multiple-antenna, while eavesdroppers attempt to eavesdrop the information. A fractional problem aims at maximizing sum secrecy rate is proposed to optimize secure hybrid precoding in multicast massive MIMO wiretap system. Because the proposed optimized model is an intractable non-convex problem, we equivalently transform the original problem into two suboptimal problems to separately optimize the secure analog precoding and secure digital precoding. Secure analog precoding is achieved by applying singular value decomposition (SVD) of secure channel. Then, employing semidefinite program (SDP), secure digital precoding with fixed secure analog precoding is obtained to ensure quality of service (QoS) of legitimate users and limit QoS of eavesdroppers. Complexity of the proposed SVD-SDP algorithm related to the number of transmitting antennas squared is lower compared with that of constant modulus precoding algorithm (CMPA) which is in connection with that number cubed. Simulation results illustrate that SVD-SDP algorithm brings higher sum secrecy rate than those of CMPA and SVD-SVD algorithm.     

Caching popularity-unknown contents for massive communication channels via deep Q-learning

In order to reduce the backhaul link pressure of wireless networks, edge caching technology has been regarded as a promising solution. However, with massive and dynamical communication connections, it is challenging to provide analytical caching solution to achieve the best performance, particularly when the requested contents are changing and their popularities are unknown. In this paper, we propose a deep Q-learning (DQN) method to address the issue of caching placement. Considering a content caching network containing multiple cooperating SBSs with unknown content popularity, we need to determine which content to cache and where to cache. Therefore, the learning network has to be designed for dual aims, one of which is to estimate the content popularities while the other is to assign contents to the proper channels. An elaborate DQN is proposed to make decisions to cache contents with limited storage space of base-station by considering channel conditions. Specifically, the content requests of users are first collected as one of the training samples of the learning network. Second, the channel state information for the massive links are estimated as the other training samples. Then, we train the network based on the proposed method thereby improving spectral efficiency of the entire system and reducing bit-error rate. Our major contribution is to contrive a caching strategy for enhanced performance in massive connection communications without knowing the content popularity. Numerical studies are performed to show that the proposed method acquires apparent performance gain over random caching in terms of average spectral efficiency and bit-error rate of the network.     

A novel deep deterministic policy gradient model applied to intelligent transportation system security problems in 5G and 6G network scenarios

Traffic congestion has been an actual problem in large cities, causing personal inconvenience and environmental pollution. To solve this problem, new applications for Intelligent Transportation System (ITS) have been created, to monitor actual traffic conditions. Therefore, fast, reliable and safe systems are desirable for creating a real intelligent transportation environment. Deep learning algorithms have been proposed for a better understanding of traffic behavior from a security-related perspective. Thus, we aim to maximize the safety problems using a deep learning algorithm, where a novel policy gradient model is presented for detecting vehicular misuse. The proposed model uses a triple network replay algorithm, maximizing the network convergence speed. Three networks are selected to optimize the policy network variables. Finally, the replay algorithm is partitioned with the aim of obtaining a faster model. Simulations on a real urban map are performed in a scenario with the integration of 5G or 6G networks. An architectural model for the integration of a Vehicular Ad-hoc Network (VANET) and cellular networks is determined in software-defined networking (SDN). The results show that the accuracy prediction of the proposed system presents better performance compared to related studies, where the proposed model increases its convergence speed and cumulative reward. Thus, the ITS improvement by the proposed deep learning algorithm increases the prediction accuracy, and reduces the transmission delay, treating the traffic path according to the congestion.     

基于压缩感知理论的大规模MIMO系统下行信道估计中的导频优化理论分析与算法设计

针对大规模多输入多输出(multiple input multiple output, MIMO)系统信道估计中的导频设计问题,在压缩感知理论框架下,提出了一种基于信道重构错误率最小化的自适应自相关矩阵缩减参数导频优化算法.首先以信道重构错误率最小化为目标,推导了正交匹配追踪(orthogonal matching pursuit, OMP)算法下信道重构错误率与导频矩阵列相关性之间的关系,并得出优化导频矩阵的两点准则,即导频矩阵列相关性期望和方差最小化;然后研究了优化导频矩阵的方法,并提出相应的自适应自相关矩阵缩减参数导频矩阵优化算法,即在每次迭代过程中,以待优化矩阵平均列相关程度是否减小作为判断条件,调整自相关矩阵缩减参数值,使参数不断趋近于理论最优.仿真结果表明,与采用Gaussian矩阵、Elad方法、低幂平均列相关方法得到的导频矩阵相比,本文所提方法具有更好的列相关性,且具有更低的信道重构错误率.