21 January 2022 in IEEE Transactions on Vehicular Technology
As an important technique of enabling global access for 6G, low earth orbit satellite (LEO-Sat) communication is still facing the challenges of large path-loss, and severe Doppler effect. This paper studies the reliability performance of a downlink LEO-Sat communication system, where the orthogonal time frequency space (OTFS) scheme is employed to combat severe Doppler effect. Further, the unmanned aerial vehicle (UAV) based cooperative transmission is developed, in order to compensate for the large margin of path-loss caused by the long transmission distance. In particular, the closed-form expression for the outage probability of the OTFS based LEO-Sat transmission is derived, where the novel moment matching approach is used to closely approximate the PDF of a sum of shadowing Rician (SR) variables. Further, the condition of using UAV cooperation is obtained so that the positive reliability gain is guaranteed. Finally, both the theoretical analysis and simulation results show that, the OTFS scheme can significantly outperform the traditional OFDM scheme, while demanding to carefully address the trade-off between reliability improvement and implementation complexity determined by modulation size.
22 September 2017 in IEEE Transactions on Wireless Communications
This paper designs a novel non-orthogonal multiple access (NOMA) unicast–multicast system, where a number of unicast users (those who require different messages) and a group of multicast users (those who require identical message) share the same time/space/frequency resource. For the designed NOMA unicast–multicast system, an efficient two-phase cooperation strategy is proposed to improve the reliability of all users. In the first phase, the base station (BS) broadcasts a superposed message consisting of all users’ information. In the second phase, a multicast user is selected to forward the information intended by unsuccessfully decoded unicast and/or multicast users. Moreover, the multicast user selection is investigated under two different power allocation (PA) approaches: 1) fixed PA (FPA), in which the PA coefficients for both the phases are predetermined, and 2) dynamic PA (DPA), in which the PA coefficients for the first phase are predetermined, while the PA coefficients for the second phase are dynamically determined based on instantaneous channel information. Under the FPA approach, a best user selection (BUS) scheme (called F-BUS) is proposed to minimize the outage probability. Under the DPA approach, the local optimal PA coefficients for the second phase are derived in closed form first. Based on the derived PA coefficients, a BUS scheme (called D-BUS) is then proposed for outage probability minimization. To verify the reliability of the proposed cooperation strategy with employing the BUS schemes, we theoretically analyze the outage probability as well as diversity orders. It is shown that the proposed cooperation strategy achieves diversity orders equal to the number of multicast users, indicating that the inherent diversity orders offered by the multicast users are fully exploited. Finally, simulation results are presented to validate the theoretical results and demonstrate the advantages of the proposed cooperation strategy and the BUS schemes.
6 March 2020 in IEEE Transactions on Communications
This paper investigates the hybrid precoding design in millimeter-wave (mmWave) systems with a fully-adaptive-connected precoding structure, where a switch-controlled connection is deployed between every antenna and every radio frequency (RF) chain. To maximally enhance the energy efficiency (EE) of hybrid precoding under this structure, the joint optimization of switch-controlled connections and the hybrid precoders is formulated as a large-scale mixed-integer non-convex problem with high-dimensional power constraints. To efficiently solve such a challenging problem, we first decouple it into a continuous hybrid precoding (CHP) subproblem. Then, with the hybrid precoders obtained from the CHP subproblem, the original problem can be equivalently reformulated as a discrete connection-state (DCS) problem with only 0-1 integer variables. For the CHP subproblem, we propose an alternating hybrid precoding (AHP) algorithm. Then, with the hybrid precoders provided by the AHP algorithm, we develop a matching assisted fully-adaptive hybrid precoding (MA-FAHP) algorithm to solve the DCS problem. It is theoretically shown that the proposed MA-FAHP algorithm always converges to a stable solution with the polynomial complexity. Finally, simulation results demonstrate the superior performance of the proposed MA-FAHP algorithm in terms of EE and beampattern.
30 January 2018 in IEEE Transactions on Signal Processing
This paper investigates the relay hybrid precoding design in millimeter-wave (mmWave) massive MIMO systems. The optimal design of the relay hybrid precoding is highly non-convex, due to the six-order polynomial objective function, six-order polynomial constraint, and constant-modulus constraints. To efficiently solve this challenging non-convex problem, we first reformulate it into three quadratic subproblems, where one of the subproblems is convex and the other two are non-convex. Then, we propose an iterative successive approximation (ISA) algorithm to attain the high-approximate optimal solution to the original problem. Specifically, in the proposed ISA algorithm, we first convert the two non-convex subproblems to convex ones by the relaxation of the constant-modulus constraints, and then we solve the three corresponding convex subproblems iteratively. We theoretically prove that the ISA algorithm converges to a Karush-Kuhn-Tucker (KKT) point of the original problem. Simulation results demonstrate that the proposed ISA algorithm achieves good performance in terms of achievable rate in both full-connected and sub-connected relay hybrid precoding systems.
8 October 2018 in IEEE Transactions on Communications
This paper proposes a novel design of cooperative non-orthogonal layered multicast multiple access in a heterogeneous network, where the information is encoded into the messages of high-priority (HP) and low-priority (LP). Two types of multicast users coexist in the network: 1) regular users (RUs), which are located far away from the base-station (BS) and expect to decode only the HP message (due to the weak channels); 2) advanced users (AUs), which are located close to the BS and expect to decode both HP and LP messages. To improve the reliability of layered multicast, we consider that the successful AUs (those AUs who successfully decode the HP and LP messages) serve as potential relays to assist other AUs/RUs. Based on this idea, two novel cooperation strategies are proposed for different cases of channel information availability. For each proposed strategy, we derive closed-form exact outage probabilities of AUs and RUs, and then further analyze their diversity orders. Moreover, considering that the layered multicast is outage-constrained, we theoretically evaluate the energy consumption of both strategies and demonstrate their energy saving gains over the direct nonorthogonal multiple access for layered multicast. Finally, our theoretical analysis is verified by numerical results, and the advantages of the proposed strategies are also demonstrated.
30 November 2021 in IEEE Communications Letters
This letter investigates the secure beamforming (BF) of a two-user uplink non-orthogonal multiple access system aided by an intelligent reflecting surface (IRS). In this system, both users send messages to the base station while emitting artificial noise that confuses the eavesdropper. To improve the security with ensuring the max-min fairness, the joint BF optimization of the users and the IRS is formulated as a quadratic-fractional problem (QFP). By reformulating the QFP into a fraction-eliminated problem, we further obtain the active and passive BF sub-problems that can be iteratively solved by a proposed multi-beam cyclic optimization algorithm. Simulation results demonstrate the superior performance of the proposed algorithm.