14,892 research outputs found
Approximations of the packet error rate under slow fading in direct and relayed links
Most of the existing literature on performance evaluation of fading channels is concentrated on either the symbol error rate of the links, or the outage capacity. We present in this technical report approximation techniques for the packet error rate of quasi-static fading channels. This model applies when the channel coherence time is larger than the signaling time and leads to multiple symbols experiencing the same fading state during a packet transmission. We start by giving a closed-form upper bound on the asymptotic \emph{coding gain} of the packet error rate in quasi-static fading channels. Using the fact that the asymptotic formulation is inversible with respect to the mean signal-to-noise ration (SNR), we present a \emph{packet error outage} metric, with applications to channels where links are subject to both fading and log-normal shadowing effects simultaneously. We then show that a \emph{unit step approximation} can be derived for the packet error rate of block fading channels, that closely matches the numerical computation of the packet error rate in a tractable closed-form expression. Using the asymptotic approximation method, we derive the optimal power allocation for different relaying protocols, especially when optimal combination of the symbols received at the destination may not be possible
Outage Capacity and Optimal Transmission for Dying Channels
In wireless networks, communication links may be subject to random fatal
impacts: for example, sensor networks under sudden power losses or cognitive
radio networks with unpredictable primary user spectrum occupancy. Under such
circumstances, it is critical to quantify how fast and reliably the information
can be collected over attacked links. For a single point-to-point channel
subject to a random attack, named as a \emph{dying channel}, we model it as a
block-fading (BF) channel with a finite and random delay constraint. First, we
define the outage capacity as the performance measure, followed by studying the
optimal coding length such that the outage probability is minimized when
uniform power allocation is assumed. For a given rate target and a coding
length , we then minimize the outage probability over the power allocation
vector \mv{P}_{K}, and show that this optimization problem can be cast into a
convex optimization problem under some conditions. The optimal solutions for
several special cases are discussed.
Furthermore, we extend the single point-to-point dying channel result to the
parallel multi-channel case where each sub-channel is a dying channel, and
investigate the corresponding asymptotic behavior of the overall outage
probability with two different attack models: the independent-attack case and
the -dependent-attack case. It can be shown that the overall outage
probability diminishes to zero for both cases as the number of sub-channels
increases if the \emph{rate per unit cost} is less than a certain threshold.
The outage exponents are also studied to reveal how fast the outage probability
improves over the number of sub-channels.Comment: 31 pages, 9 figures, submitted to IEEE Transactions on Information
Theor
On the Computation of the Higher Order Statistics of the Channel Capacity over Generalized Fading Channels
The higher-order statistics (HOS) of the channel capacity
, where denotes the
order of the statistics, has received relatively little attention in the
literature, due in part to the intractability of its analysis. In this letter,
we propose a novel and unified analysis, which is based on the moment
generating function (MGF) technique, to exactly compute the HOS of the channel
capacity. More precisely, our mathematical formalism can be readily applied to
maximal-ratio-combining (MRC) receivers operating in generalized fading
environments (i.e., the sum of the correlated noncentral chi-squared
distributions / the correlated generalized Rician distributions). The
mathematical formalism is illustrated by some numerical examples focussing on
the correlated generalized fading environments.Comment: Submitted to IEEE Wireless Communications Letter, February 18, 201
Average Rate of Downlink Heterogeneous Cellular Networks over Generalized Fading Channels - A Stochastic Geometry Approach
In this paper, we introduce an analytical framework to compute the average
rate of downlink heterogeneous cellular networks. The framework leverages
recent application of stochastic geometry to other-cell interference modeling
and analysis. The heterogeneous cellular network is modeled as the
superposition of many tiers of Base Stations (BSs) having different transmit
power, density, path-loss exponent, fading parameters and distribution, and
unequal biasing for flexible tier association. A long-term averaged maximum
biased-received-power tier association is considered. The positions of the BSs
in each tier are modeled as points of an independent Poisson Point Process
(PPP). Under these assumptions, we introduce a new analytical methodology to
evaluate the average rate, which avoids the computation of the Coverage
Probability (Pcov) and needs only the Moment Generating Function (MGF) of the
aggregate interference at the probe mobile terminal. The distinguishable
characteristic of our analytical methodology consists in providing a tractable
and numerically efficient framework that is applicable to general fading
distributions, including composite fading channels with small- and mid-scale
fluctuations. In addition, our method can efficiently handle correlated
Log-Normal shadowing with little increase of the computational complexity. The
proposed MGF-based approach needs the computation of either a single or a
two-fold numerical integral, thus reducing the complexity of Pcov-based
frameworks, which require, for general fading distributions, the computation of
a four-fold integral.Comment: Accepted for publication in IEEE Transactions on Communications, to
appea
Finite-Blocklength Bounds on the Maximum Coding Rate of Rician Fading Channels with Applications to Pilot-Assisted Transmission
We present nonasymptotic bounds on the maximum coding rate achievable over a
Rician block-fading channel for a fixed packet size and a fixed packet error
probability. Our bounds, which apply to the scenario where no a priori channel
state information is available at the receiver, allow one to quantify the
tradeoff between the rate gains resulting from the exploitation of
time-frequency diversity and the rate loss resulting from fast channel
variations and pilot-symbol overhead
Short Packets over Block-Memoryless Fading Channels: Pilot-Assisted or Noncoherent Transmission?
We present nonasymptotic upper and lower bounds on the maximum coding rate
achievable when transmitting short packets over a Rician memoryless
block-fading channel for a given requirement on the packet error probability.
We focus on the practically relevant scenario in which there is no \emph{a
priori} channel state information available at the transmitter and at the
receiver. An upper bound built upon the min-max converse is compared to two
lower bounds: the first one relies on a noncoherent transmission strategy in
which the fading channel is not estimated explicitly at the receiver; the
second one employs pilot-assisted transmission (PAT) followed by
maximum-likelihood channel estimation and scaled mismatched nearest-neighbor
decoding at the receiver. Our bounds are tight enough to unveil the optimum
number of diversity branches that a packet should span so that the energy per
bit required to achieve a target packet error probability is minimized, for a
given constraint on the code rate and the packet size. Furthermore, the bounds
reveal that noncoherent transmission is more energy efficient than PAT, even
when the number of pilot symbols and their power is optimized. For example, for
the case when a coded packet of symbols is transmitted using a channel
code of rate bits/channel use, over a block-fading channel with block
size equal to symbols, PAT requires an additional dB of energy per
information bit to achieve a packet error probability of compared to
a suitably designed noncoherent transmission scheme. Finally, we devise a PAT
scheme based on punctured tail-biting quasi-cyclic codes and ordered statistics
decoding, whose performance are close ( dB gap at packet error
probability) to the ones predicted by our PAT lower bound. This shows that the
PAT lower bound provides useful guidelines on the design of actual PAT schemes.Comment: 30 pages, 5 figures, journa
MGF Approach to the Analysis of Generalized Two-Ray Fading Models
We analyze a class of Generalized Two-Ray (GTR) fading channels that consist
of two line of sight (LOS) components with random phase plus a diffuse
component. We derive a closed form expression for the moment generating
function (MGF) of the signal-to-noise ratio (SNR) for this model, which greatly
simplifies its analysis. This expression arises from the observation that the
GTR fading model can be expressed in terms of a conditional underlying Rician
distribution. We illustrate the approach to derive simple expressions for
statistics and performance metrics of interest such as the amount of fading,
the level crossing rate, the symbol error rate, and the ergodic capacity in GTR
fading channels. We also show that the effect of considering a more general
distribution for the phase difference between the LOS components has an impact
on the average SNR.Comment: 14 pages, 8 Figures and 2 Tables. This work has been accepted for
publication at IEEE Transactions on Wireless Communications. Copyright (c)
2014 IEEE. Personal use of this material is permitted. However, permission to
use this material for any other purposes must be obtained from the IEEE by
sending a request to [email protected]
- …