Search

This paper considers the finite-order filter design problem for the source and multiple full-duplex (FD) relays in a cooperative communication system under frequency-selective fading channels. The goal is to optimize the source and relay filters such that the end-to-end signal-to-interference-plus-noise ratio (SINR) of minimum mean-squared error decision-feedback equalizer (MMSE-DFE) can be maximized. The resultant design problem is very difficult since we need to deal with self interference (SI), inter-relay interference (IRI), and inter-symbol interference (ISI) at the same time. Novel designs are then proposed to overcome the difficulty in this work. Transforming the signals into the frequency domain and using some optimization techniques, we first theoretically derive the power spectrum of the source filter and the spectrums of the relay filters. Then, the finite-order design is developed to approach the derived spectrums. Based on the weighted least-square (WLS) criterion, the Steiglitz-McBride method is exploited to obtain the filter coefficients in finite lengths. Numerical results demonstrated that complete removal of SI may not be a good strategy; preserving a certain amount of SI at each relay instead provides better SINR performance. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the application of the non-orthogonal multiple access (NOMA) technique into the unmanned aerial vehicle (UAV) aided relay networks. Specifically, we first incorporate the NOMA protocol with the decode-and-forward (DF) relay protocol to enhance the performance of the cell edge users in a macrocell network. Theoretical analysis indicates that the NOMA-DF-relay protocol outperforms the conventional orthogonal multiple access (OMA) based DF-relay protocol in terms of data rate. To fully exploit the advantages of the proposed protocol, we formulate a joint UAV height optimization, channel allocation, and power allocation problem with the objective to maximize the total data rate of the cell edge users under the coverage of the UAV. For solving the formulated problem effectively, we first analyze its property and employ the golden section method to propose a general framework to obtain the optimal height of the UAV. Then, we design a low-complexity iterative algorithm to solve the joint channel-and-power allocation problem based on the matching theory and the Lagrangian dual decomposition technique. Finally, simulation results demonstrate that the NOMA-DF-relay protocol is superior to the OMA-DF-relay protocol even when the system parameters are not optimized, and the proposed algorithms can further significantly improve the network performance in comparison with the other schemes. [ABSTRACT FROM AUTHOR]

We consider a multi-pair two-way full-duplex (FD) amplify-and-forward relaying, where multiple FD multi-input multi-output (MIMO) users exchange information via a shared FD massive MIMO relay. We derive a closed-form spectral efficiency (SE) lower-bound for maximal-ratio combining/maximal-ratio transmission relay processing considering spatially correlated relay and user antennas, which most of the existing works have ignored. The derived SE lower-bound is applicable for arbitrary number of relay antennas, and simplifies to the following results available in the literature i) the asymptotic SE for number of relay antennas tending to infinity; and ii) the SE lower-bound with independent relay antennas and single-antenna users. We use this SE lower-bound to maximize the non-convex SE, which is of matrix fractional form. We optimize SE by approximating it as concave-convex function, and then by applying matrix quadratic transformation. We numerically validate the SE lower-bound for various system configurations and also characterize their performance for different spatial correlation and interference values. We investigate the gains achieved by the optimal SE over equal power allocation. [ABSTRACT FROM AUTHOR]

We consider a full-duplex (FD) decode-and-forward system in which the time-switching protocol is employed by the multiantenna relay to receive energy from the source and transmit information to the destination. The instantaneous throughput is maximized by optimizing receive and transmit beamformers at the relay and the time-split parameter. We study both optimum and suboptimum schemes. The reformulated problem in the optimum scheme achieves closed-form solutions in terms of transmit beamformer for some scenarios. In other scenarios, the optimization problem is formulated as a semidefinite relaxation problem and a rank-one optimum solution is always guaranteed. In the suboptimum schemes, the beamformers are obtained using maximum ratio combining, zero-forcing, and maximum ratio transmission. When beamformers have closed-form solutions, the achievable instantaneous and delay-constrained throughput are analytically characterized. Our results reveal that beamforming increases both the energy harvesting and loop interference suppression capabilities at the FD relay. Moreover, simulation results demonstrate that the choice of the linear processing scheme as well as the time-split plays a critical role in determining the FD gains. [ABSTRACT FROM AUTHOR]

Simultaneous wireless information and power transfer (SWIPT) can lead to uninterrupted network operation by integrating radio frequency (RF) energy harvesting with data communication. In this paper, we consider a two-hop source-relay-destination network and investigate the efficient usage of a decode-and-forward (DF) relay for SWIPT toward the energy-constrained destination. In particular, by assuming a Rician fading environment, we jointly optimize power allocation (PA), relay placement (RP), and power splitting (PS) so as to minimize outage probability under the harvested power constraint at the destination node. We consider the two possible cases of source-to-destination distance: (1) small distance with direct information transfer link; and (2) relatively large distance with no direct reachability. Analytical expressions for individual and joint optimal PA, RP, and PS are obtained by exploiting convexity of outage minimization problem for the no direct link case. In case of direct source-to-destination link, multipseudoconvexity of joint-optimal PA, RP, and PS problem is proved, and alternating optimization is used to find the global optimal solution. Numerical results show that the joint optimal solutions, although strongly influenced by the harvested power requirement at the destination, can provide respectively 64% and 100% outage improvement over the fixed allocation scheme for without and with direct link. [ABSTRACT FROM AUTHOR]

In this paper, we provide a comprehensive study of secrecy transmission in decode-and-forward (DF) relay networks subjected to slow fading. With only channel distribution information (CDI) of the wiretap channels, we aim at maximizing secrecy throughput of the two-hop transmission under a secrecy outage constraint through optimizing transmission region, rate parameters of the wiretap codes and power allocation between the source and relay. We propose fixed transmission parameter scheme (FTPS) and variable transmission parameter scheme (VTPS), which are based on the CDI and instantaneous channel state information of the main channels, respectively. In both schemes, source and relay use the same codeword, and the eavesdropper can use maximum ratio combining (MRC) reception. To improve the secrecy throughput, we further propose VTPS-D1 and VTPS-D2 schemes, where the source and relay either use independent codewords with identical code rates, or different codebooks with different code rates so that the eavesdropper can only decode the two-hop signals individually rather than using MRC. We provide explicit results on the design for all proposed schemes. Numerical results and comparisons on the secrecy throughput of these schemes are presented to reveal their respective superiorities and give some insights into the choice of design scheme. [ABSTRACT FROM PUBLISHER]