No Arabic abstract
The knowledge of channel covariance matrices is of paramount importance to the estimation of instantaneous channels and the design of beamforming vectors in multi-antenna systems. In practice, an abrupt change in channel covariance matrices may occur due to the change in the environment and the user location. Although several works have proposed efficient algorithms to estimate the channel covariance matrices after any change occurs, how to detect such a change accurately and quickly is still an open problem in the literature. In this paper, we focus on channel covariance change detection between a multi-antenna base station (BS) and a single-antenna user equipment (UE). To provide theoretical performance limit, we first propose a genie-aided change detector based on the log-likelihood ratio (LLR) test assuming the channel covariance matrix after change is known, and characterize the corresponding missed detection and false alarm probabilities. Then, this paper considers the practical case where the channel covariance matrix after change is unknown. The maximum likelihood (ML) estimation technique is used to predict the covariance matrix based on the received pilot signals over a certain number of coherence blocks, building upon which the LLR-based change detector is employed. Numerical results show that our proposed scheme can detect the change with low error probability even when the number of channel samples is small such that the estimation of the covariance matrix is not that accurate. This result verifies the possibility to detect the channel covariance change both accurately and quickly in practice.
Rate-Splitting Multiple Access (RSMA), relying on multi-antenna Rate-Splitting (RS) techniques, has emerged as a powerful strategy for multi-user multi-antenna systems. In this paper, RSMA is introduced as a unified multiple access for multi-antenna radar-communication (RadCom) system, where the base station has a dual communication and radar capability to simultaneously communicate with downlink users and probe detection signals to azimuth angles of interests. Using RS, messages are split into common and private parts, then encoded into common and private streams before being precoded and transmitted. We design the message split and the precoders for this RadCom system such that the Weighted Sum Rate (WSR) is maximized and the transmit beampattern is approximated to the desired radar beampattern under an average transmit power constraint at each antenna. We then propose a framework based on Alternating Direction Method of Multipliers (ADMM) to solve the complicated non-convex optimization problem. Results highlight the benefits of RSMA to unify RadCom transmissions and to manage the interference among radar and communications, over the conventional Space-Division Multiple Access (SDMA) technique.
Channel estimation is of crucial importance in massive multiple-input multiple-output (m-MIMO) visible light communication (VLC) systems. In order to tackle this problem, a fast and flexible denoising convolutional neural network (FFDNet)-based channel estimation scheme for m-MIMO VLC systems was proposed. The channel matrix of the m-MIMO VLC channel is identified as a two-dimensional natural image since the channel has the characteristic of sparsity. A deep learning-enabled image denoising network FFDNet is exploited to learn from a large number of training data and to estimate the m-MIMO VLC channel. Simulation results demonstrate that our proposed channel estimation based on the FFDNet significantly outperforms the benchmark scheme based on minimum mean square error.
Dual-Functional Radar-Communication (DFRC) system is an essential and promising technique for beyond 5G. In this work, we propose a powerful and unified multi-antenna DFRC transmission framework, where an additional radar sequence is transmitted apart from communication streams to enhance radar beampattern matching capability, and Rate-Splitting Multiple Access (RSMA) is adopted to better manage the interference. RSMA relies on multi-antenna Rate-Splitting (RS) with Successive Interference Cancellation (SIC) receivers, and the split and encoding of messages into common and private streams. We design the message split and the precoders of the radar sequence and communication streams to jointly maximize the Weighted Sum Rate (WSR) and minimize the radar beampattern approximation Mean Square Error (MSE) subject to the per antenna power constraint. An iterative algorithm based on Alternating Direction Method of Multipliers (ADMM) is developed to solve the problem. Numerical results first show that RSMA-assisted DFRC achieves a better tradeoff between WSR and beampattern approximation than Space-Division Multiple Access (SDMA)-assisted DFRC with or without radar sequence, and other simpler radar-communication strategies using orthogonal resources. We also show that the RSMA-assisted DFRC frameworks with and without radar sequence achieve the same tradeoff performance. This is because that the common stream is better exploited in the proposed framework. The common stream of RSMA fulfils the triple function of managing interference among communication users, managing interference between communication and radar, and beampattern approximation. Therefore, by enabling RSMA in DFRC, the system performance is enhanced while the system architecture is simplified since there is no need to use additional radar sequence and SIC. We conclude that RSMA is a more powerful multiple access for DFRC.
We derive new expressions for the connection probability and the average ergodic capacity to evaluate the performance achieved by multi-connectivity (MC) in an indoor ultra-wideband terahertz (THz) communication system. In this system, the user is affected by both self-blockage and dynamic human blockers. We first build up a three-dimensional propagation channel in this system to characterize the impact of molecular absorption loss and the shrinking usable bandwidth nature of the ultra-wideband THz channel. We then carry out new performance analysis for two MC strategies: 1) Closest line-of-sight (LOS) access point (AP) MC (C-MC), and 2) Reactive MC (R- MC). With numerical results, we validate our analysis and show the considerable improvement achieved by both MC strategies in the connection probability. We further show that the C-MC and R-MC strategies provide significant and marginal capacity gain relative to the single connectivity strategy, respectively, and increasing the number of the users associated APs imposes completely different affects on the capacity gain achieved by the C-MC and R-MC strategies. Additionally, we clarify that our analysis allows us to determine the optimal density of APs in order to maximize the capacity gain.
In this paper, we propose the joint interference cancellation, fast fading channel estimation, and data symbol detection for a general interference setting where the interfering source and the interfered receiver are unsynchronized and occupy overlapping channels of different bandwidths. The interference must be canceled before the channel estimation and data symbol detection of the desired communication are performed. To this end, we have to estimate the Effective Interference Coefficients (EICs) and then the desired fast fading channel coefficients. We construct a two-phase framework where the EICs and desired channel coefficients are estimated using the joint maximum likelihood-maximum a posteriori probability (JML-MAP) criteria in the first phase; and the MAP based data symbol detection is performed in the second phase. Based on this two-phase framework, we also propose an iterative algorithm for interference cancellation, channel estimation and data detection. We analyze the channel estimation error, residual interference, symbol error rate (SER) achieved by the proposed framework. We then discuss how to optimize the pilot density to achieve the maximum throughput. Via numerical studies, we show that our design can effectively mitigate the interference for a wide range of SNR values, our proposed channel estimation and symbol detection design can achieve better performances compared to the existing method. Moreover, we demonstrate the improved performance of the iterative algorithm with respect to the non-iterative counterpart.