21 November 2017 in IEEE Communications Letters
To enhance the spectral efficiency of non-orthogonal multiple access (NOMA) in massive multiple input multiple output (MIMO) systems, we propose a user pairing and pair scheduling (UPaS) algorithm, which can, simultaneously, pair the selected users and schedule suitable user pairs for data transmission. Through dividually selecting the first user and the second user for each user pair, the proposed algorithm can make sure that both the two users in each user pair can make the greatest contribution to the system sum rate. To suppress the inter-pair interference, we design an interference cancellation combining (ICC) matrix, which firstly breaks through the constraint between antenna numbers of base station (BS) and users. Theoretical analyses and computer simulations show that, the proposed algorithm has excellent sum rate and outage performance compared with traditional user pairing algorithms.
11 February 2021 in IEEE Access
Land mobile satellite communication and physical layer security are considered as the promising paradigms in beyond 5G networks. In this paper, we establish the multi-relay hybrid satellite-terrestrial systems (HSTSs) with artificial noise (AN) to investigate the reliability and security, in which the satellite sends signals to the terrestrial destination through multiple decode-and-forward relays and there exists an eavesdropper trying to overhear the useful information. In order to improve the overall system performance, two relay selection (RS) schemes: i) optimal relay-receiver pair selection (ORRPS) and ii) suboptimal relay selection (SRS) are considered. ORRPS selects an optimal relay-receiver pair and an AN signal to maximize the corresponding signal-to-interference-plus-noise ratios of ${R_{k}} \to D\left ({{R_{k} \to E} }\right)$ and the SRS refers to selecting a relay that optimize the instantaneous channel gain ${\left |{ {{h_{R_{k}D}}} }\right |^{2}}\left ({{{{\left |{ {{h_{R_{k}E}}} }\right |}^{2}}} }\right)$ among $K$ relays, with the traditional round-robin selection scheme as a benchmark for comparison. Furthermore, the exact closed-form analytical expressions of outage probability (OP) and intercept probability (IP) under different RS schemes are derived for AN and non-AN conditions. To obtain more insights, the asymptotic analysis for high signal-to-noise-ratio regime is carried out. Based on the asymptotic analysis of OP, the diversity orders of the HSTSs are obtained. The numerical results and theoretical analysis shown that: i) The reliability of TRRS scheme is the worst among the three RS schemes, and the reliability of ORRPS scheme is the best; ii) The AN technology can significantly improve the security of the system, although it has a little adverse affect on the reliability; iii) Infrequent light shadowing has the best reliability, frequent heavy shadowing has the worst outage performance, and the change of security is opposite; iv) The OP of SRS and ORRP schemes decreased with the increase of $K$ , while the IP changed on the contrary, and the reliability and security of TRRS scheme did not change obviously.
23 July 2019 in IEEE Transactions on Vehicular Technology
In the traditional interference channel (IC), each transmitter works in the mode of one-to-one. For serving more user terminals (UTs), a multiple-multicast network (MMN) is proposed, in which there are multiple transmitters, and each transmitter works in the mode of one-to-many. Thus, each UT would suffer from both the intra-transmitter and inter-transmitter interference. Given the transmitting and receiving degrees of freedom (DoFs), the desired signal would be more difficult to be separated from the numerous interference signals. For managing the interference, an interference subspace alignment (ISA) algorithm is proposed to decrease the dimension of the interference subspace. Different from the traditional iterative interference alignment (IA) algorithms, which iteratively calculate the precoding and receiving combining matrices to minimize the strength of interference, the ISA algorithm directly aligns the interference subspace spanned by the T-N transmitters within that spanned by the residual N transmitters, in which T denotes the number of all the transmitters, and N is the cardinality of the transmitter set used for IA. Now, the dimension of each UT's interference subspace is determined via N transmitters. During the subspace alignment, we respectively construct the composite interference channel state matrices for the T-N and N transmitters, and the composite precoding vector, which lies in the null space of the composite interference channel matrices. Thus, all the precoding matrices can be obtained once. After the subspace alignment, each UT's receiving combining matrix can be designed to lie in the null space of the aligned interference subspace. According to the simulation results, the proposed ISA algorithm can effectively suppress the interference and improve the system sum rate compared with the traditional interference management algorithms.
22 December 2016 in IEEE Communications Letters
In this letter, an uplink communication scenario in which one dual-antenna transmitter communicates with a receiver having massive antennas is considered. We propose a 2×2 space-time transmission scheme, which does not require any knowledge of instantaneous channel state information at either transmitter or receiver. Based on the non-coherent maximumlikelihood detector, we derive the pairwise error probability (PEP) performance and analyze its upper and lower bounds, which show the PEP decays exponentially with the number of receiving antennas. In addition, two criteria are obtained for designing the transmitting signal matrix S, i.e., the determinant and trace criteria of matrix SHS. With these criteria, we present a space-time signal design based on PSK constellation. Finally, computer simulations are performed to show how this design works, and numerical results validate the tightness of the upper and lower bounds when the number of receiving antennas is large.
30 April 2019 in KSII Transactions on Internet and Information Systems