pith. sign in

arxiv: 1009.2955 · v1 · pith:R7FX64ZMnew · submitted 2010-09-15 · 💻 cs.IT · math.IT

Throughput Analysis of Buffer-Constrained Wireless Systems in the Finite Blocklength Regime

classification 💻 cs.IT math.IT
keywords blocklengthconstraintsthroughputfinitequeueingunderanalysiscodes
0
0 comments X
read the original abstract

In this paper, wireless systems operating under queueing constraints in the form of limitations on the buffer violation probabilities are considered. The throughput under such constraints is captured by the effective capacity formulation. It is assumed that finite blocklength codes are employed for transmission. Under this assumption, a recent result on the channel coding rate in the finite blocklength regime is incorporated into the analysis and the throughput achieved with such codes in the presence of queueing constraints and decoding errors is identified. Performance of different transmission strategies (e.g., variable-rate, variable-power, and fixed-rate transmissions) is studied. Interactions between the throughput, queueing constraints, coding blocklength, decoding error probabilities, and signal-to-noise ratio are investigated and several conclusions with important practical implications are drawn.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.