- Research
- Open Access

# Throughput analysis of buffer-constrained wireless systems in the finite blocklength regime

- M Cenk Gursoy
^{1}Email author

**2013**:290

https://doi.org/10.1186/1687-1499-2013-290

© Gursoy; licensee Springer. 2013

**Received: **24 April 2013

**Accepted: **29 October 2013

**Published: **21 December 2013

## Abstract

In this paper, a single point-to-point wireless link operating under queueing constraints in the form of limitations on the buffer violation probabilities is considered. The achievable 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. The performance of different transmission strategies (e.g., variable-rate, variable-power, and fixed-rate transmissions) is studied. Interactions and tradeoffs 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.

## Keywords

- Buffer violation probability
- Coding rate
- Decoding error probability
- Effective capacity
- Fading channels
- Finite blocklength regime
- Quality of service constraints
- Variable-rate/variable-power/fixed-rate transmissions

## 1 Introduction

Providing quality of service (QoS) guarantees in the form of limitations on the queueing delays or buffer violation probabilities is essential in many delay-sensitive wireless systems, e.g., voice over IP (VoIP), and wireless interactive and streaming video applications. Due to the importance of such QoS considerations, it is of significant interest to conduct an analysis and provide predictions for the performance levels of practical systems. In[1], effective capacity is proposed as a metric that can be employed to measure the performance in the presence of statistical QoS limitations. Effective capacity formulation uses the large deviations theory and incorporates the statistical QoS constraints by capturing the rate of decay of the buffer occupancy probability for large queue lengths. Hence, effective capacity can be regarded as the maximum throughput of a system operating under limitations on the buffer violation probability.

Recently, there has been much interest in the analysis of the effective capacity of fading channels (see, e.g.,[2–9]) in order to identify the performance of wireless systems operating under statistical queueing constraints. However, in almost all prior studies, the service rates of the queueing model (or equivalently the instantaneous transmission rates over the wireless channel) are assumed to be equal to the instantaneous capacity values, although channel coding is performed using a finite block of symbols. Moreover, transmissions are assumed to be reliable with no decoding errors. However, it is important to note that error-free communication at the rate of channel capacity is generally attained as the codeword length increases without bound. Therefore, when finite blocklength codes are employed, transmission is necessarily performed in the presence of decoding errors and possibly at rates less than the channel capacity in order to have high reliability or equivalently low error probability.

In[10] and[11], Negi and Goel addressed these considerations. They studied queueing and coding jointly and took explicitly into account decoding errors by considering the random coding exponents of error probabilities for rates less than the instantaneous channel capacity. For instance, in[10], they analyzed the maximization of the joint exponent of the decoding error and delay violation probability through the appropriate choice of the transmission rate for a given delay bound and constant arrival rate.

In this paper, we also depart from the idealistic assumptions of communicating arbitrarily reliably at channel capacity but follow an approach different from that of[10] and[11]. We consider channel coding rates achievable with finite blocklength codes and incorporate the decoding error probabilities and possible retransmission scenarios into the effective capacity formulation. This analysis is facilitated mainly by the recent results of Polyanskiy et al.[12], where the authors identified an approximate maximal achievable rate expression for a given error probability in the finite blocklength regime. This expression can be regarded as a second-order asymptotic approximation of the channel coding rate at large but finite blocklength values. We note that[13] and[14] also studied channel coding and achievable error probabilities at finite blocklengths by analyzing the mutual information density and its statistics. In[14], an outage analysis is performed by using the distribution of the mutual information density. In[15], a similar outage formulation is used to determine the optimal physical-layer reliability and to identify the maximum Automatic Repeat reQuest (ARQ) throughput. On the other hand, neither of the above-mentioned papers have investigated the throughput in the finite blocklength regime when the systems operate under buffer constraints.

Our contributions in this paper can be summarized as follows. We determine the throughput achieved by different transmission strategies in the finite blocklength regime under constraints on the buffer violation probability. Initially, we consider a scenario in which the transmission rate is varied with the fading realizations while the error probability is kept fixed. The optimal error probability that maximizes the throughput is shown to be unique. We analyze the impact of the power adaptations. Then, we investigate the case in which the transmission rate is fixed and error probability varies over different transmission blocks. Through numerical results, we analyze the interactions between the throughput, queueing constraints, error probabilities, blocklength, signal-to-noise ratio, and different transmission strategies.

The remainder of the paper is organized as follows. Section 2 describes the fading channel model. In Section 3, we provide preliminaries on the effective capacity as a measure of the throughput under statistical QoS constraints. In Section 4, we provide our results on the effective throughput in the finite blocklength regime when the transmitter sends the data at a variable rate with fixed power. In Section 5, we investigate the throughput in scenarios in which power control is employed, or data is transmitted at fixed rate, or independent messages are sent over two parallel channels. We conclude in Section 6. Several proofs are relegated to the Appendix.

## 2 Channel model

*m*symbols and then change independently for the following block. Under this block-fading assumption, the channel input-output relation in one coherence block can be expressed as

**x**and

**y**are the

*m*-dimensional, complex, channel input and output vectors, respectively. The input is subject to an average power constraint, i.e.,$\mathbb{E}\{\parallel \mathbf{x}{\parallel}^{2}\}\le \mathit{\text{mP}}$.

*h*is the complex-valued fading coefficient with finite second moment, i.e.,$\mathbb{E}\{{|h|}^{2}\}<\infty $. We assume that both the receiver and transmitter have perfect channel side information (CSI) and hence perfectly know the instantaneous realizations of the fading coefficients. However, the assumption of perfect CSI at the transmitter is relaxed in Section 5.2. Finally,

**n**represents the Gaussian noise vector whose components are independent and identically distributed (i.i.d.), complex, circularly symmetric, Gaussian random variables with mean zero and variance

*N*

_{0}, i.e.,$\mathbf{n}\sim \mathcal{C}\mathcal{N}(0,{N}_{0}{\mathbf{I}}_{m})$, where

**I**

_{ m }denotes the

*m*×

*m*identity matrix. We define the transmitted signal-to-noise ratio as

Note that the received instantaneous signal-to-noise ratio for a given fading coefficient *h* is |*h*|^{2}SNR.

## 3 Throughput under statistical queueing constraints

*constant*arrival rate that a given service process can support in order to guarantee a statistical QoS requirement specified by the QoS exponent

*θ*

^{a}. If we define

*Q*as the stationary queue length, then

*θ*is the decay rate of the tail of the distribution of the queue length

*Q*:

*q*

_{max}, we have the following approximation for the buffer violation probability:

Hence, while larger *θ* corresponds to more strict QoS constraints, smaller *θ* implies looser QoS guarantees. Similarly, if *D* denotes the steady state delay experienced in the buffer, then$P(D\ge {d}_{max})\approx {e}^{-\theta \delta {d}_{max}}$ for large *d*_{max}, where *δ* is determined by the arrival and service processes[4]. Therefore, effective capacity formulation provides the maximum constant arrival rates that can be supported by the time-varying wireless channel under the queue length constraint$P(Q\ge {q}_{max})\le {e}^{-\theta {q}_{\mathit{\text{max}}}}$ for large *q*_{
max
} or the delay constraint$P(D\ge {d}_{max})\le {e}^{-\theta \delta {d}_{max}}$ for large *d*_{max}. Since the average arrival rate is equal to the average departure rate when the queue is in steady state[16], effective capacity can also be seen as the maximum throughput in the presence of such constraints.

where$S[t]={\sum}_{i=1}^{t}{R}_{i}$ is the time-accumulated service process and {*R*_{
i
},*i* = 1,2,…} denotes the discrete-time stationary and ergodic stochastic service process. We would like to note that in the remainder of the paper, we will refer to *R*_{E} as the effective rate rather than the effective capacity since *R*_{E} in our setup is the throughput when the service rates are equal to the approximate channel coding rates in the finite blocklength regime.

## 4 Effective throughput with finite blocklength codes

### 4.1 Throughput in fading channels under QoS constraints

*m*channel uses) with error probability 0 <

*ε*< 1, signal-to-noise ratio (SNR), and coding blocklength

*m*is shown to have the following asymptotic expression ([12], Theorem 54):

*Q*-function. Denoting the rate in bits per channel use by$\stackrel{\u0304}{r}$, we can write

where the approximation is accurate for sufficiently large *m*. Note that the above results are for the AWGN channel with real input and real output.

*m*symbols, during which the fading stays fixed. Under these assumptions, coding over a fading Gaussian channel can be seen as coding over a real Gaussian channel (with a certain channel gain) using a coding blocklength of 2

*m*. The following arguments provide a detailed description of this approach. Knowing the channel fading coefficient

*h*, the receiver can multiply the received signal with${e}^{-j{\theta}_{h}}$, where

*θ*

_{ h }is the phase of

*h*and obtain

^{b}

**x**

_{ r },${\stackrel{~}{\mathbf{n}}}_{r}$, and${\stackrel{~}{\mathbf{y}}}_{i}$,

**x**

_{ i },${\stackrel{~}{\mathbf{n}}}_{i}$ denote the real and imaginary components, respectively, of the output vector$\stackrel{~}{\mathbf{y}}$, input vector

**x**, and noise vector$\stackrel{~}{\mathbf{n}}$. It can be easily verified that$\stackrel{~}{\mathbf{n}}=\mathbf{n}{e}^{-j{\theta}_{h}}$ has the same statistics as

**n**and hence$\stackrel{~}{\mathbf{n}}\sim \mathcal{C}\mathcal{N}\left(0,{N}_{0}{\mathbf{I}}_{m}\right)$. Now, the above channel input-output relation can also be written as

*m*-dimensional vectors, the above channel model is a real Gaussian channel with 2

*m*dimensional input and output and with channel gain |

*h*|. Note that the real and imaginary noise components${\stackrel{~}{\mathbf{n}}}_{r}$ and${\stackrel{~}{\mathbf{n}}}_{i}$ are independent due to the assumption of the circular symmetry of the additive complex Gaussian noise. For this channel, the coding rate (in bits per

*m*channel uses) in the

*i*

^{th}block achieved with block error probability

*ε*is

*h*

_{ i }denotes the fading coefficient in the

*i*

^{th}block. Note that the expression in (10) is obtained from that in (5) by replacing

*m*with 2

*m*, and the signal-to-noise ratio with$\text{SNR}{|{h}_{i}|}^{2}=\frac{P}{{N}_{0}}{|{h}_{i}|}^{2}$, which is the received signal-to-noise ratio in the

*i*

^{th}block. Now, the normalized rate in bits per channel use is approximately

*m*for which$\frac{O(log2m)}{m}$ is negligible. Henceforth, we assume that the instantaneous transmission rate in each coherence block of the fading channel is given by the expression in (11). Since the block error rate is

*ε*, this rate is attained with probability 1 -

*ε*. We assume that the receiver reliably detects the errors, employs a simple ARQ mechanism, and sends a negative acknowledgement requesting the retransmission of the message in case of an erroneous reception. Therefore, the data rate is effectively zero when error occurs. Under this assumption, the service rate (in bits per

*m*channel uses) in each block is

*ε*, blocklength

*m*, and QoS exponent

*θ*as

where$\stackrel{\u0304}{r}$ is given in (11), and the expectation is with respect to |*h*|^{2}. The effective rate expression in (13) is easily derived from (4) by noting that the service rate {*R*_{
i
}} is an i.i.d. process due to the facts that the fading process is i.i.d. in different blocks, and the noise is an i.i.d. process leading to the independence of error events in different blocks.

Note that the effective rate is a function of the QoS exponent *θ*, blocklength *m*, SNR, and error probability *ε*. Since we assume that coding is performed in each coherence interval, the blocklength *m* is determined by the statistics of the fading process. The value of *θ* is dictated by the application requirements, and SNR depends on the power budget. Given the values of these parameters, the remaining parameter *ε* can be optimized to maximize the throughput.

**Proposition 1.**

*Assume that the values of m*,

*θ*> 0,

*and SNR*> 0

*are fixed. Then, the function*

*is strictly convex in ε*, *and therefore, the optimal value of ε that minimizes this function or equivalently maximizes the effective rate in (13) is unique. Moreover, the effective rate R*_{E} *in (13) is a quasiconcave function of ε*.

*Proof*. See Appendix 1.

*Remark 1*. Note that the strict convexity result indicates that the optimal error probability *ε*^{∗} is unique and can be easily found using standard convex optimization methods. The analysis and the resulting *ε*^{∗} provide guidelines on the design of the channel codes and what their strength and protection level should be. Note that large *ε* implies that the transmitter attempts to transmit the data at a high rate but at the risk of more frequent errors and hence retransmissions. On the other hand, if *ε* is small, the reliability of the transmissions is high but the instantaneous transmission rate is low. In either of these extreme regimes, the resulting throughput is low, which is not favorable in a buffer/delay limited system. The above result shows that a balance is struck at a unique value of the error probability, and this point can be identified without much difficulty for given buffer constraints specified by *θ*. Indeed, as will be seen in the numerical results, *ε*^{∗} is not vanishingly small, indicating that some relatively small but nonzero error probability and hence some retransmissions are allowed to improve the throughput of the system.

*θ*> 0. If there are no QoS constraints and hence

*θ*= 0, then the effective rate becomes

where$\stackrel{\u0304}{r}$ is given in (11). Note that *R*_{E}(0) is the average transmission rate averaged over the fading states. Below, we show that *R*_{E}(0) is a strictly concave function of *ε*.

**Proposition 2.**

*Assume that the values of m and SNR*> 0

*are fixed. Then, the function*

*is strictly concave in ε, and therefore the optimal value of ε that maximizes this effective rate is unique*.

*Proof*. See Appendix 2.

### 4.2 Numerical results

Next, we provide numerical examples to illustrate the results. Although the preceding analysis is applicable to any fading distribution with finite power, we consider a Rayleigh fading channel in the numerical analysis and assume that the fading power *z* = |*h*|^{2} is exponentially distributed with unit mean (i.e., has the probability density function *f*_{
z
}(*z*) = *e*^{-z}).

*ε*in the Rayleigh fading channel. In the figure, SNR=0 dB, and the blocklength

*m*= 1,000. We provide curves for different values of the QoS exponent

*θ*> 0. In all cases, we immediately observe the strict convexity of the curves, confirming the result in Proposition 1. Indeed, the optimal error probabilities that minimize Ψ(

*ε*) are unique and are equal to

*ε*

^{∗}= 0.0127,0.0061,0.0084 for

*θ*= 0.001,0.01,0.1, respectively. It is also interesting to see that the optimal error probabilities are not vanishingly small and are around 0.01.

*ε*. The other parameters are the same as in Figure1. Notice that we have also included in this figure the throughput curve for the case in which

*θ*= 0. Note that if

*θ*= 0, the system does not have any queueing constraints. In Proposition 2, we have shown that

*R*

_{E}(0) is a strictly concave function of

*ε*, and the optimal

*ε*

^{∗}that maximizes

*R*

_{E}(0) is unique. The strict concavity is observed in Figure2. The optimal value of the error probability in the case of

*θ*= 0 is

*ε*

^{∗}= 0.0171. For

*θ*> 0, the effective rate curves are not necessarily concave. In Figure2, we observe that these curves are quasiconcave as predicted by Proposition 1, and they are maximized at a unique

*ε*

^{∗}. The optimal error probabilities for the cases in which

*θ*> 0 are equal to the same ones obtained in Figure1. At the optimal error probabilities, the maximum effective rate values are

*R*

_{E}= 0.7750,0.6256,0.2246,0.0329 bits/channel use for

*θ*= 0,0.001,0.01,0.1, respectively. Note that increasing

*θ*leads to more stringent QoS constraints, and we observe that the effective rate and hence the effective throughput diminish as

*θ*increases. This trend is also clearly seen in Figure3, where we plot the maximum effective rate values (i.e., effective rate at the optimal error probability

*ε*

^{∗}) as a function of

*θ*.

*ε*

^{∗}as a function of

*θ*. This is depicted in Figure4. Here, we observe that as

*θ*increases and therefore the QoS limitations become more stringent, the value of

*ε*

^{∗}initially decreases sharply. Hence, the transmitter opts for more reliable but low-rate transmissions. On the other hand, as

*θ*increases beyond approximately 0.028, the trend reverses and

*ε*

^{∗}starts to increase. The transmitter increases the transmission rate at the cost of increased

*ε*

^{∗}and hence more retransmissions. When

*θ*exceeds 0.298,

*ε*

^{∗}starts decreasing again. Note that for high values of

*θ*, the effective rate is small. This small effective rate can be supported by low-rate transmissions. Hence, when

*θ*is high beyond a threshold, the transmitter chooses to transmit at low rates and keep the error probability and the number of retransmissions low as well.

*m*for

*θ*= 0 and

*θ*= 0.001. The solid-lined curves correspond to the effective rate in (13) optimized over

*ε*. The dashed curves correspond to the effective rate of the ideal model in which the service rate is equal to the instantaneous capacity, i.e.,

*ε*= 0. Here, we have interesting observations. When

*θ*= 0 and the ideal model is considered, then the effective rate is${R}_{\mathrm{E}}(0)={\mathbb{E}}_{{|h|}^{2}}\{{log}_{2}(1+\text{SNR}{|h|}^{2})\}$, which is the ergodic capacity of the fading channel and is clearly independent of the blocklength. On the other hand, if the service rate is given by$\stackrel{\u0304}{r}$ in (11), the effective rate${R}_{\mathrm{E}}(0)=(1-\epsilon ){\mathbb{E}}_{{|h|}^{2}}\{\stackrel{\u0304}{r}\}$ increases with blocklength

*m*as seen in Figure5. In the presence of QoS constraints, i.e., when

*θ*> 0, we have stark differences. Under the idealistic assumption of transmitting at the instantaneous capacity with no errors, we see from the behavior of the dashed curve for

*θ*= 0.001 that effective rate decreases with increasing

*m*. The reason is that since

*m*is the coherence duration over which the fading state remains fixed, larger

*m*corresponds to slower fading, and slow fading is detrimental for buffer-constrained systems. In a slow-fading scenario, deep fading can be persistent, causing long durations of low rate transmissions, leading to buffer overflows. In the finite blocklength regime, as seen in the behavior of the solid-lined curve of the case of

*θ*= 0.001, there is a certain tradeoff. Initially, increasing

*m*improves the performance as this allows the system to perform transmissions with longer codewords and to have higher transmission rates. However, if

*m*increases beyond a threshold, slowness of the fading starts to degrade the performance.

In all cases in Figure5, the gap between the dashed and solid-lined curves diminishes as *m* increases since the idealistic model becomes more accurate. On the other hand, for moderate values of *m* (e.g., when *m* < 2,000), the idealistic assumptions lead to significant overestimations of the performance.

*θ*= 0,0.001, and 0.01. We see that for fixed

*θ*, increasing the SNR improves the throughput and also the reliability of the transmissions by lowering the error probabilities.

## 5 The impact of different transmission strategies

Heretofore, we have considered the scenario where the transmitter knows the fading coefficients {*h*_{
i
}} and performs variable-rate transmission with the same average power *P* in each coherence block of *m* channel uses. Next, we investigate the throughput achieved with other transmission strategies such as employing power control, transmitting data at fixed rates, and sending independent messages over two parallel channels.

### 5.1 Power control

*μ*(SNR,

*θ*,|

*h*|

^{2}). With this adaptation policy, the transmission rate is

*μ*(SNR,

*θ*,|

*h*|

^{2}) in (11). Finding the optimal power adaptation policy that maximizes$\stackrel{\u0304}{r}$ or the effective rate${R}_{\mathrm{E}}(\theta )=-\frac{1}{m\theta}{log}_{e}{\mathbb{E}}_{{|h|}^{2}}\left\{\epsilon +(1-\epsilon ){e}^{-\theta m\stackrel{\u0304}{r}}\right\}$ is in general a difficult task due to the facts that both the first and second terms on the right-hand side of (18) are concave functions. Hence,$\stackrel{\u0304}{r}$ is neither concave nor convex. For this reason, we resort to suboptimal strategies. One viable policy,

*μ*

^{∗}, is the one that maximizes the effective rate when the service process is assumed to be equal to the instantaneous capacity log(1 +

*μ*(SNR,

*θ*,|

*h*|

^{2})|

*h*|

^{2}) with zero error probability, i.e.,

*μ*

^{∗}is derived in[2] and is given by

where$\beta =\frac{\theta m}{{log}_{e}2}$, and *α* is chosen such that the average long-term signal-to-noise ratio constraint,${E}_{{|h|}^{2}}\{\mu (\text{SNR},\theta ,{|h|}^{2})\}\le \text{SNR}$, is satisfied with equality. Note that this policy is close to the optimal one when the blocklength is large, and hence,$\stackrel{\u0304}{r}$ is close to log(1 + *μ*(SNR,*θ*,|*h*|^{2})|*h*|^{2}), and *ε* is close to zero.

*θ*for both fixed- and variable-power cases. In the fixed-power case, SNR = 0 dB in each coherence block. When power adaptation is employed, signal-to-noise ratio

*μ*(SNR,

*θ*,|

*h*|

^{2}) varies in each block while satisfying${\mathbb{E}}_{{|h|}^{2}}\{\mu (\text{SNR},\theta ,{|h|}^{2})\}\le \text{SNR}=0$ dB. The improved performance with power control is observed in the figure.

### 5.2 Fixed-rate transmissions

The analysis so far has assumed that the transmitter has perfect knowledge of the fading coefficients and can perform variable-rate and/or variable-power transmissions in each coherence block. On the other hand, it is practically interesting to consider cases in which the transmitter does not know the channel and send the information at a fixed rate. Additionally, the transmitter may prefer fixed-rate transmissions, even when it knows the channel, due to complexities in varying the transmission rate for each block. Motivated by these considerations, we assume in this section that the transmitter sends the information at the fixed rate${\stackrel{\u0304}{r}}_{f}$. Under this assumption, error probability *ε* varies with the fading realizations. The analysis in the previous sections have, on the other hand, considered the scenarios in which the error probability is fixed for all channel states.

*ε*is a function of the fading magnitude |

*h*|, signal-to-noise ratio SNR, and blocklength

*m*. The service rate (in bits per

*m*channel uses) is now

*m*, QoS exponent

*θ*, and fixed-rate

*r*

_{ f }, the effective rate in bits per channel use is

*θ*= 0, we have

*m*→

*∞*. We immediately see that

^{c}

*m*→

*∞*,

which is defined as the capacity with outage ([19], Section 4.2.3). Therefore, *R*_{E}(0) in (24) can be seen as the outage capacity in the finite blocklength regime. Furthermore, *R*_{E}(*θ*) in (23) can be regarded as the generalization of such a throughput measure to the scenario with QoS limitations.

*θ*. This is more clearly seen in Figure10, where the optimal effective rates (optimized over${\stackrel{\u0304}{r}}_{f}$) are plotted as a function of

*θ*. In this figure, we have curves for both fixed-rate and variable-rate transmissions. The effective rate for the variable-rate transmission is computed by maximizing (13) over

*ε*. It is interesting to observe that the fixed-rate transmissions perform worse than variable-rate transmissions for small values of

*θ*. However, for

*θ*> 0.13, the fixed-rate transmissions start outperforming. Hence, for high enough values of

*θ*, fixing the transmission rate and having the error probability vary in each block provide better performance than requiring the error probability to be fixed by varying the rate. Additionally, though not treated in this paper, another strategy in which both the error probability and transmission rate adapt and vary with the fading can bring forth improvements in the performance. Finally, in Figure11, we note that as

*θ*increases, the optimal fixed rate${\stackrel{\u0304}{r}}_{f}$, which maximizes

*R*

_{E}(

*θ*) in (23), diminishes.

### 5.3 Sending independent messages over two parallel channels

**x**= [

**x**

_{ r }

**x**

_{ i }] of length 2

*m*in

*m*channel uses. Another approach is to transmit two independent messages using codewords

**x**

_{ r }and

**x**

_{ i }selected from two independent codebooks. Note that, now, the codeword length is

*m*. These two independent codewords can be seen to be sent through two independent parallel channels:

*m*for each codeword, the transmitter sends the information through each channel in the

*i*

^{th}block duration at the following rate with block error probability

*ε*:

*p*is introduced to differentiate this rate from that in (11). Since errors occur independently in each channel, the service rate (in bits per

*m*channel uses) in each block duration of

*m*channel uses is

*ε*, blocklength

*m*, and QoS exponent

*θ*is

where${\overline{r}}_{p}$is given in (29).

In this case, it can again be easily shown that the error probability *ε* that maximizes the effective rate in (32) is unique. The following is a corollary to Proposition 1.

**Corollary 1.**

*Assume that the values of m, θ*> 0,

*and SNR*> 0

*are fixed. Then, the function*

*is strictly convex in ε, and therefore, the optimal value of ε that minimizes this function or equivalently maximizes the effective rate in (32) is unique. Moreover, R*_{E}*in (32) is a quasiconcave function of ε*.

*Proof*. See Appendix 3.

*θ*= 0, using two codewords, each of length

*m*provides lower throughput than using a single codeword of length 2

*m*. On the other hand, as we observe in Figure12, the throughput achieved by sending two codewords is higher if

*θ*increases beyond a threshold. Therefore, under strict QoS constraints, sending in each coherence block multiple codewords with shorter lengths may be preferable.

## 6 Conclusion

We have analyzed the performance of buffer-constrained wireless systems in the practical scenario in which transmissions are performed using finite blocklength codes with possible decoding errors at the receiver. Employing a recent result on coding rate in the finite blocklength regime, we have determined the effective rate expression as a function of the QoS exponent, coding blocklength, decoding error probability, and signal-to-noise ratio, and characterized the throughput under statistical QoS constraints. We have discussed different transmission strategies. In the case in which the transmission rate is varied and the error probability is kept fixed across different fading realizations, we have shown that the effective rate is maximized at a unique error probability. This optimal decoding error probability gives us insight on the required reliability of the channel codes. Through numerical results, we have investigated how the optimal effective rate and optimal error probability vary with the QoS exponent *θ*. We have also had interesting observations on the performance as a function of the blocklength. We have analyzed the throughput improvements through power adaptation. We have studied the practical scenario in which the transmitter sends the information at a fixed transmission rate. We have seen that while variable-rate schemes provide higher effective rate at low values of *θ*, fixed-rate transmissions start performing better as *θ* increases. Finally, we have noted that sending multiple codewords with shorter blocklengths in each coherence interval can become a favorable strategy under stringent QoS constraints.

## Endnotes

^{a}For time-varying arrival rates, effective capacity specifies the effective bandwidth of the arrival process that can be supported by the channel.

^{b} Note that multiplication of the channel output with${e}^{-j{\theta}_{h}}$ just rotates the output, is a reversible operation, and hence does not lead to any loss of information.

^{c}The interchange of the limit and the integral (or equivalently the expectation) can be easily justified by noting the boundedness of the *Q*-function, i.e., |*Q*(·)| ≤ 1, and invoking the dominated convergence theorem. Additionally, we implicitly assume that the random variable log2(1+SNR|*h*|^{2}) does not have a mass at${\stackrel{\u0304}{r}}_{f}$; hence,${\stackrel{\u0304}{r}}_{f}={log}_{2}(1+\text{SNR}{|h|}^{2})$ is a zero-probability event, and this event does not affect the expectation.

## Appendices

### Appendix 1: Proof of Proposition 1

We first prove the following Lemma.

**Lemma 1.**

*For fixed m, SNR*> 0,

*and*|

*h*|

^{2}> 0,

*is a strictly convex function of ε*.

*Proof*. We first express

*h*|

^{2}> 0, and

*θ*> 0, we have

*a*> 0. With the above definitions, we can write

*f*(

*ε*) with respect to

*ε*can easily be found as follows:

*Q*

^{-1}(

*ε*) with respect to

*ε*. Next, we employ several techniques used in ([15], Appendix 1) to prove the lemma. Note that for an invertible and differentiable function

*g*, we have

*g*(

*g*

^{-1}(

*x*)) =

*x*. Taking derivative of both sides of this equality leads us to

*g*

^{-1}with respect to

*x*, and$\u0121({g}^{-1}(x))$ is the derivative of

*g*evaluated at

*g*

^{-1}(

*x*). Following this approach and noting that

*ε*≤ 1. Differentiating${\stackrel{\u0307}{Q}}^{-1}(\epsilon )$ with respect to

*ε*, we obtain the second derivative as follows:

- (1)
*ε*< 1/2. First, we assume that*ε*< 1/2. Under this assumption, we have*Q*^{-1}(*ε*) > 0 and hence ${\stackrel{\u0308}{Q}}^{-1}(\epsilon )>0$. Together with the fact that ${\stackrel{\u0307}{Q}}^{-1}(\epsilon )<0$, we immediately see that$\stackrel{\u0308}{f}(\epsilon )>0\phantom{\rule{.5em}{0ex}}\text{for}\phantom{\rule{.5em}{0ex}}\epsilon <1/2.$(46) - (2)
*ε*> 1/2. Next, we analyze the case in which*ε*> 1/2 and therefore*Q*^{-1}(*ε*) < 0. We concentrate on the term inside the square parentheses in (41). Using (44) and (45), and defining*x*=*Q*^{-1}(*ε*) or equivalently*Q*(*x*) =*ε*, we can write$\begin{array}{l}a(1-\epsilon ){({\stackrel{\u0307}{Q}}^{-1}(\epsilon ))}^{2}-2{\stackrel{\u0307}{Q}}^{-1}(\epsilon )+(1-\epsilon ){\stackrel{\u0308}{Q}}^{-1}(\epsilon )\end{array}$(47)$\begin{array}{l}=a(1-\epsilon )2\pi {e}^{{({Q}^{-1}(\epsilon ))}^{2}}+2\sqrt{2\pi}{e}^{{({Q}^{-1}(\epsilon ))}^{2}/2}\\ \phantom{\rule{1em}{0ex}}+(1-\epsilon )2\pi {Q}^{-1}(\epsilon ){e}^{{({Q}^{-1}(\epsilon ))}^{2}}\end{array}$(48)$\begin{array}{l}=a(1-Q(x))2\pi {e}^{{x}^{2}}+2\sqrt{2\pi}{e}^{{x}^{2}/2}\\ \phantom{\rule{1em}{0ex}}+(1-Q(x))2\pi x{e}^{{x}^{2}}\end{array}$(49)$\begin{array}{l}={e}^{{x}^{2}/2}\left(2\pi (1-Q(x))(x+a){e}^{{x}^{2}/2}+2\sqrt{2\pi}\right)\end{array}$(50)$\begin{array}{l}\ge {e}^{{x}^{2}/2}\left(2\pi (1-Q(x))x{e}^{{x}^{2}/2}+2\sqrt{2\pi}\right)\end{array}$(51)$\begin{array}{l}\ge {e}^{{x}^{2}/2}\left(2\pi \frac{1}{\sqrt{2\pi}(-x)}{e}^{-{x}^{2}/2}x{e}^{{x}^{2}/2}+2\sqrt{2\pi}\right)\end{array}$(52)$\begin{array}{l}\ge {e}^{{x}^{2}/2}\left(-\sqrt{2\pi}+2\sqrt{2\pi}\right)\end{array}$(53)$\begin{array}{l}\ge {e}^{{x}^{2}/2}\left(\sqrt{2\pi}\right)>0.\end{array}$(54)

*a*> 0 and hence

*x*+

*a*>

*x*. (52) is obtained by using the upper bound,

*x*=

*Q*

^{-1}(

*ε*) < 0, and (1-

*Q*(

*x*)) is multiplied above by

*x*< 0, enabling us to find a lower bound. From the above discussion, we conclude that

*ε*= 1/2 and hence

*Q*

^{-1}(

*ε*) =

*Q*

^{-1}(1/2) = 0, we have

and therefore$\stackrel{\u0308}{f}(1/2)>0$. Since$\stackrel{\u0308}{f}(\epsilon )>0$ for all *ε* ∈ [0,1], *f*(*ε*) is a strictly convex function of *ε*.

*h*|

^{2}> 0. Note that if either SNR = 0 or |

*h*|

^{2}= 0, the coding rate becomes$\stackrel{\u0304}{r}=0$, leading to

*ψ*(

*ε*) = 1. Since the nonnegative weighted sum (including infinite sums and integrals) of strictly convex functions is strictly convex ([20], Section 3.2.1) and since the addition of a constant (in the case of |

*h*|

^{2}= 0) does not have an impact on the strict convexity, we immediately conclude that

is strictly convex in *ε*, proving the first part of Proposition 1.

*ε*. A function

*f*is quasiconvex if and only if

*f*(

*δ*

*x*+ (1 -

*δ*)

*y*) ≤ max{

*f*(

*x*),

*f*(

*y*)} for any

*δ*∈ [0,1], and the negative of a quasiconvex function is quasiconcave[20]. Now, we can easily show for any

*ε*

_{1},

*ε*

_{2}∈ (0,1) and

*δ*∈ [0,1] that

where the inequality in (63) is obtained from the facts that Ψ is a convex function and hence Ψ(*δ* *ε*_{1} + (1 - *δ*)*ε*_{2}) ≤ *δ* Ψ(*ε*_{1}) + (1 - *δ*)Ψ(*ε*_{2}), and logarithm is a monotonically increasing function; (64) follows from the inequality *δ* Ψ(*ε*_{1}) + (1 - *δ*)Ψ(*ε*_{2}) ≤ max{Ψ(*ε*_{1}),Ψ(*ε*_{2})}; and (65) is again due to the monotonicity of the logarithm. Therefore, -*R*_{E} is quasiconvex and *R*_{E} is a quasiconcave function of *ε*.

### Appendix 2: Proof of Proposition 2

*Proof*. The proof is similar to that of Proposition 1 in Appendix 1 and will be kept brief. Let us first consider the function

*c*

_{1}= log

_{2}(1 + SNR|

*h*|

^{2}) and${c}_{2}=\sqrt{\frac{1}{m}\left(1-\frac{1}{{(\text{SNR}{|h|}^{2}+1)}^{2}}\right)}loge$. Note that if either SNR = 0 or |

*h*|

^{2}= 0, then

*c*

_{1}=

*c*

_{2}= 0 and

*ϕ*(

*ε*) = 0 for all

*ε*. Next, we consider the case in which SNR>0 and |

*h*|

^{2}> 0, and therefore

*c*

_{1}> 0 and

*c*

_{2}> 0

^{d}. The second derivative of

*ϕ*(

*ε*) with respect to

*ε*is

*ε*< 1/2,$\stackrel{\u0308}{\varphi}(\epsilon )<0$. For

*ε*> 1/2, we can show, employing the steps similar to those in (47) to (54), that

*x*=

*Q*

^{-1}(

*ε*). When

*ε*= 1/2, we have$\stackrel{\u0308}{\varphi}(\epsilon )=-2\sqrt{2\pi}{c}_{2}<0$. Since$\stackrel{\u0308}{\varphi}(\epsilon )<0$ for all

*ε*,

*ϕ*(

*ε*) is a strictly concave function of

*ε*when |

*h*|

^{2}>0 and SNR>0. As argued similarly in Appendix 1, since the nonnegative weighted sum of strictly concave functions is strictly concave[20], and since the addition of a constant (in the case of |

*h*|

^{2}= 0) does not have an impact on the strict concavity, we conclude that

is a strictly concave function of *ε*.

### Appendix 3: Proof of Corollary 1

*Proof*.From the proof of Proposition 1 in Appendix 1, it immediately follows that$\epsilon +(1-\epsilon ){e}^{-\theta m{\stackrel{\u0304}{r}}_{p}}$ is a strictly convex function of *ε*. Then,${(\epsilon +(1-\epsilon ){e}^{-\theta m{\stackrel{\u0304}{r}}_{p}})}^{2}$ is strictly convex due to the facts that *f*(*x*) = *x*^{2} is a strictly convex and increasing function of *x* and the composition *f*(*g*(*x*)) is strictly convex function when *g*(*x*) is a strictly convex function ([20], Section 3.2.4). Then, the strict convexity of${\mathbb{E}}_{{|h|}^{2}}\left\{{(\epsilon +(1-\epsilon ){e}^{-\theta m{\stackrel{\u0304}{r}}_{p}})}^{2}\right\}$ and quasiconcavity of the effective rate follow from the arguments employed at the end of Appendix 1.

## Declarations

### Acknowledgements

This work was supported by the National Science Foundation under grants CCF – 0546384 (CAREER), CNS – 0834753, and CCF-0917265. The material in this paper was presented in part at the 2011 IEEE International Conference on Communications (ICC), Kyoto, Japan.

## Authors’ Affiliations

## References

- Wu D, Negi R: Effective capacity: a wireless link model for support of quality of service.
*IEEE Trans. Wireless Commun*2003, 2(4):630-643.Google Scholar - Tang J, Zhang X: Quality-of-service driven power and rate adaptation over wireless links.
*IEEE Trans. Wireless Commun*2007, 6(8):3058-3068.View ArticleGoogle Scholar - Tang J, Zhang X: Quality-of-service driven power and rate adaptation for multichannel communications over wireless links.
*IEEE Trans. Wireless Commun*2007, 6(12):4349-4360.View ArticleGoogle Scholar - Tang J, Zhang X: Cross-layer-model based adaptive resource allocation for statistical QoS guarantees in mobile wireless networks.
*IEEE Trans. Wireless Commun*2008, 7: 2318-2328.View ArticleGoogle Scholar - Liu L, Parag P, Tang J, Chen W-Y, Chamberland J-F: Resource allocation and quality of service evaluation for wireless communication systems using fluid models.
*IEEE Trans. Inform. Theory*2007, 53(5):1767-1777.MathSciNetView ArticleGoogle Scholar - L Liu P, Parag J-F: Chamberland, Quality of service analysis for wireless user-cooperation networks.
*IEEE Trans. Inform. Theory*2007, 53(10):3833-3842.MathSciNetView ArticleGoogle Scholar - Gursoy MC, Qiao D, Velipasalar S: Analysis of energy efficiency in fading channel under QoS constrains.
*IEEE Trans. Wireless Commun*2009, 8(8):4252-4263.View ArticleGoogle Scholar - Qiao D, Gursoy MC, Velipasalar S: The impact of QoS constraints on the energy efficiency of fixed-rate wireless transmissions.
*IEEE Trans. Wireless Commun*2009, 8(12):5957-5969.View ArticleGoogle Scholar - Qiao D, Gursoy MC, Velipasalar S:
*Energy efficiency of fixed-rate wireless transmissions under queueing constraints and channel uncertainty. Paper presented at the IEEE Global Telecommunications Conference (GLOBECOM).*Honolulu, HI; 30 Nov–4 Dec 2009.Google Scholar - Negi R, Goel S:
*An information-theoretic approach to queuing in wireless channels with large delay bounds. Paper presented at the IEEE Global Telecommunications Conference (GLOBECOM).*Dallas, TX, USA; 29 Nov–3 Dec 2004.Google Scholar - Goel S, Negi R:
*Analysis of delay statistics for the queued-code. Paper presented at the IEEE International Conference on Communications (ICC).*Dresden, Germany; 14–18 Jun 2009.Google Scholar - Polyanskiy Y, Poor HV, Verdú S: Channel coding rate in the finite blocklength regime.
*IEEE Trans. Inform. Theory*2010, 56(5):2307-2359.MathSciNetView ArticleGoogle Scholar - Laneman JN:
*On the distribution of mutual information. Paper presented at the Workshop on Information Theory Applications (ITA).*San Diego, CA, USA; 13 Feb 2006.Google Scholar - Buckingham D, Valenti MC:
*The information-outage probability of finite-length codes over AWGN channels. Paper presented at the 42nd Annual Conference on Information Sciences and Systems (CISS).*Princeton, NJ,USA: ; 19–21 Mar 2008.Google Scholar - Wu P, Jindal N: Coding versus ARQ in fading channels: how reliable should the PHY be?
*IEEE Trans. Commun*2009, 59(12):3363-3374.View ArticleGoogle Scholar - Chang C-S, Zajic T:
*Effective bandwidths of departure processes from queues with time varying capacities. Paper presented at the IEEE INFOCOM.*Boston, MA, USA; 2–6 Apr 1995.Google Scholar - Chang C-S: Stability, queue length, and delay of deterministic and stochastic queuing networks.
*IEEE Trans. Auto. Control*1994, 39(5):913-931. 10.1109/9.284868View ArticleMATHGoogle Scholar - Chang C-S:
*Performance Guarantees in Communication Networks*. New York: Springer; 1995.Google Scholar - Goldsmith A:
*Wireless Communications*. Cambridge: Cambridge University Press; 2005.View ArticleGoogle Scholar - Boyd S, Vandenberghe L:
*Convex Optimization*. Cambridge: Cambridge University Press; 2004.View ArticleMATHGoogle Scholar

## Copyright

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.