Bit loading algorithms for cooperative OFDM systems

37Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We investigate the resource allocation problem for an OFDM cooperative networkwith a single source-destination pair and multiple relays. Assuming knowledge of theinstantaneous channel gains for all links in the entire network, we propose several bit andpower allocation schemes aiming at minimizing the total transmission power under a target rateconstraint. First, an optimal and efficient bit loading algorithm is proposed when the relay nodeuses the same subchannel to relay the information transmitted by the source node. To furtherimprove the performance gain, subchannel permutation, in which the subchannels are reallocatedat relay nodes, is considered. An optimal subchannel permutation algorithm is first proposed andthen an efficient suboptimal algorithm is considered to achieve a better complexity-performancetradeoff. A distributed bit loading algorithm is also proposed for ad hoc networks. Simulationresults show that significant performance gains can be achieved by the proposed bit loadingalgorithms, especially when subchannel permutation is employed.

Cite

CITATION STYLE

APA

Gui, B., & Cimini, L. J. (2008). Bit loading algorithms for cooperative OFDM systems. Eurasip Journal on Wireless Communications and Networking, 2008. https://doi.org/10.1155/2008/476797

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free