By Topic

Bit and Power Allocation for Goodput Optimization in Coded Parallel Subchannels With ARQ

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Devillers, B. ; Commun. & Remote Sensing Lab., Univ. Catholique de Louvain, Louvain-la-Neuve ; Louveaux, J. ; Vandendorpe, L.

This paper addresses the problem of adaptively allocating the bits and the power among a set of parallel subchannels. A frame-oriented transmission with convolutional coding, hard Viterbi decoding, and automatic repeat request (ARQ) retransmission protocol is considered. The objective is to maximize the number of information bits delivered without error to the user by unit of time, or goodput. This criterion is a tradeoff between the bit rate and bit error probability criteria. First, a mathematical expression for the goodput of the system is presented. Then, using that expression, different bit and power allocation strategies are derived and compared. It turns out that having an equal bit error rate (BER) on each subchannel is near-optimal in terms of goodput. Finally, we prove that the waterfilling solution with adequate signal to noise ratio (SNR) gap value (or equivalently adequate target BER value) is near-optimal. We analytically show how this SNR gap value depends on the convolutional code used, the frame length, the type of ARQ protocol used, the available transmit power, and the subchannel gains.

Published in:

Signal Processing, IEEE Transactions on  (Volume:56 ,  Issue: 8 )