In this paper, we apply angle-domain Doppler compensation for high-mobility wideband massive multi-input multi-output (MIMO) uplink communications. The time-varying multipath channel is considered between high-speed terminal and static base station (BS), where multiple Doppler frequency offsets (DFOs) are associated with distinct angle of departures (AoDs). With the aid of large-scale uniform linear array (ULA) at the transmitter, we design a beamforming network to generate multiple parallel beamforming branches, each transmitting signal pointing to one particular angle. Then, the transmitted signal in each branch will experience only one dominant DFO when passing over the time-varying channel, which can be easily compensated before transmission starts. We theoretically analyze the Doppler spread of the equivalent uplink channel after angle-domain Doppler compensation, which takes into account both the mainlobe and sidelobes of the transmit beam in each branch. It is seen that the channel time-variation can be effectively suppressed if the number of transmit antennas is sufficiently large. Interestingly, the asymptotic scaling law of channel variation is obtained, which shows that the Doppler spread is proportional to the maximum DFO and decreases approximately as 1/√M (M is the number of transmit antennas) when M is sufficiently large. Numerical results are provided to corroborate the proposed scheme.
21 October 2019 in IEEE Transactions on Vehicular Technology
As data relay satellites (DRSs) play an increasingly important supporting role in remote sensing missions, efficient coordination across space–ground multiresources becomes a significant problem. Owing to the implementation problem of the centralized coordinate methods, this paper studies a distributed coordinate resource scheduling method which is realizable in the current space network structure. To be specific, we first formulate the multiple resource coordination problem into an MILP problem based on a modified time-expanded graph. Then, the problem is transferred and decomposed into subproblems for remote sensing satellite (RSS) systems and DRS systems to solve distributedly. Afterwards, we propose a distributed iterative scheme for the RSS systems and DRS systems based on alternating direction method of multipliers (ADMM), in which only the schedule information of the inter-satellite links are required to exchange between RSS systems and DRS systems. Simulation results are provided to validate the effectiveness of our distributed coordinated resource scheduling algorithm.
19 January 2016 in International Journal of Communication Systems
In this paper, we investigate the joint beamforming and power allocation problem in multi-antenna Cellular Vehicle-to-Everything (C-V2X) networks under uncertain channel state information (CSI). Our objective is to minimize the beamforming vector at the base station and the transmit powers of vehicle users while satisfying probabilistic quality-of-service (QoS) constraints. To address the uncertainty of CSI, we first develop an ellipsoid-based uncertainty set learning approach, which models the uncertain CSI as a symmetric ellipsoid. Building on this uncertainty set, we propose a robust counterpart transformation method to reformulate the joint beamforming and power allocation problem into a deterministic semi-definite problem without probabilistic constraints. Through our analysis, the ellipsoid-based uncertainty set exhibits significant conservatism when applied to uncertain CSI with asymmetric distributions. To mitigate this conservatism, we propose a support vector clustering (SVC)-based uncertainty set learning approach, which can tightly enclose the distribution of uncertain CSI. To further simplify the spatial structure of the SVC-based uncertainty set, we develop a K-Medoids-based equivalent set construction (KMSC) approach, significantly reducing the number of variables in the resulting robust equivalent problem. Finally, we conduct extensive simulations to evaluate the performance of our proposed robust approaches and compare them with non-robust methods.
24 November 2025 in IEEE Transactions on Wireless Communications
In this work, we consider a covert communication scenario with multiple friendly interference nodes. The goal is to hide a legitimate communication link from a transmitter to a receiver under a warden’s surveillance. Firstly, we propose a novel strategy for generating artificial noise (AN) signals and formulate a corresponding design problem, aiming to minimize the adverse effects of AN on the legitimate receiver while enhancing communication covertness. Specifically, we optimize the basis matrix for AN signal space using statistical information of the involved channel coefficients, when precise channel state information are unavailable. Secondly, we analyze the geometric structure of the AN basis matrix constraint and transform the nonconvex problem into an unconstrained problem on the complex Stiefel manifold. Additionally, we develop a specialized Riemannian Stochastic Variance Reduced Gradient (R-SVRG) algorithm to tackle the problem. In the algorithm, the problem is solved with lower computational complexity compared to full gradient algorithm. Thirdly, we prove that the customized R-SVRG algorithm is theoretically guaranteed to be converge and that the solution is a stationary point of the optimization problem. In the end, simulation results demonstrate the superiority of the proposed AN signal generation strategy over traditional AN in terms of achieving higher covert communication rate.