Abstract
In this paper, a set of cooperative non-orthogonal multiple access (NOMA) transmission schemes is proposed, in which two half-duplex relaying user terminals (UTs) successively deliver the AP signals toward two NOMA UTs. The successive relaying (SR) of two HD relays emulates the full-duplex (FD) relaying transmission such that the whole transmission of one data block is finished in one time slot. Different from FD relaying, where the removal of self-interference (SI) at the relay is challenging, the SR is suffering from cross-relay interference (CRI) between the two HD relays and the handling of this CRI is the key technical challenge. This CRI suppression is implemented by beamforming with multiple antennas at the relaying UTs, while the beamforming also does the role of maximizing the NOMA transmission efficiency. Two beamforming schemes are proposed, where the first method employs semi-definite relaxation (SDR) with four dimensional (4-D) search. Here, the four dimensions come from the four parameters reflecting the CRI levels at the relaying UTs and signal strengths at the NOMA UTs. This scheme alternates until the 4-D search range is reduced and the sum throughput rate saturates. The second method is computationally simpler than the first one since it avoids the SDR and alternation, and it finds the beamformer set in one shot calculation. Both schemes rely on zero forcing of the CRI. These two schemes along with the HDR relay-based cooperative NOMA scheme are compared in the numerical experiments, and the results exhibit their pros and cons in several aspects.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.