deposit_your_work

Throughput Maximization for ARQ-like Systems in Fading Channels with Coding and Queuing Delay Constraints

Files in this item

Files Size Format View
Ahm2004Nov5Throughput.PDF 588.8Kb application/pdf Thumbnail

Show full item record

Item Metadata

Title: Throughput Maximization for ARQ-like Systems in Fading Channels with Coding and Queuing Delay Constraints
Author: Ahmed, Nadeem; Baraniuk, Richard G.
Type: Conference Paper
Citation: N. Ahmed and R. G. Baraniuk,"Throughput Maximization for ARQ-like Systems in Fading Channels with Coding and Queuing Delay Constraints," in Asilomar Conference on Signals, Systems, and Computers,, pp. 1463-1467.
Abstract: Practical delay-limited communication systems often employ retransmission algorithms such as ARQ to ensure reliable communications in fading channels. Maximizing the communications throughput in such systems can cause excessive queueing delays due to the random number of retransmission attempts required for each codeword. In this paper we consider the problem of delay-limited throughput maximization with a constraint on the expected waiting-time, which incorporates both queueing and coding delays. We explore the trade-off between queueing and coding delays and propose a novel queue management technique for fading channels.
Date Published: 2004-11-01

This item appears in the following Collection(s)

  • ECE Publications [1034 items]
    Publications by Rice University Electrical and Computer Engineering faculty and graduate students
  • DSP Publications [508 items]
    Publications by Rice Faculty and graduate students in digital signal processing.