Abstract

A limited-feedback-based dynamic resource allocation algorithm is proposed for a relay cooperative network with orthogonal frequency-division-multiplexing (OFDM) modulation. A communication model where one source node communicates with one destination node assisted by one half-duplex decode-and-forward (DF) relay is considered in this paper. We first consider the selective DF scheme, in which some relay subcarriers will keep idle if they do not have the advantage of forwarding the received symbols. Furthermore, we consider the enhanced DF scheme where the idle subcarriers are used to transmit new messages at the source. We aim to maximize the system's instantaneous rate by jointly optimizing power allocation and subcarrier pairing on each subcarrier based on the Lloyd algorithm. Both sum and individual power constraints are considered. The joint optimization turns out to be a mixed integer programming problem. We then transform it into a convex optimization by continuous relaxation and achieve the solution in the dual domain. The performance of the proposed joint resource allocation algorithm is verified by simulations. We find that the proposed scheme outperforms the existing methods in various channel conditions. We also observe that only a few feedback bits can achieve most of the performance gain of the perfect channel-state-information (CSI)-based resource allocation algorithm at different levels of signal-to-noise ratio (SNR).

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.