Download as pdf or txt
Download as pdf or txt
You are on page 1of 4

CAPACITY IN AWGN

Consider a discrete-time
time AWGN channel with channel input/output relationship y[i] = x[i] +
n[i], where x[i] is the channel input at time i, y[i] is the corresponding channel output, and
n[i] is a white Gaussian noise random process. Assume a channel bandwidth B and received
signal power P. The received signal
signal-to-noise ratio (SNR) – the power in x[i] divided by the
power in n[i] – is constant and given by γ = P/N0B, where N0/2 is the power spectral density
(PSD) of the noise. The capacityity of this channel is given by Shannon’s well
well-known
known formula [

Capacity of Flat Fading Channels

Since Ṗ/N0B (ratio of received power to noise power spectral density) is a constant term ,
then the distribution of g[i] determines the distribution of SNR. The channel gain g[i], also
called CSI (Channel Side Information). So, the Capacity of flat fading channel , depend on
the following
1. Channel distribution Information (CDI) is known at Tx. & Rx.
2. Receiver knows CSI.
3. Tx. & Rx. Knows CSI.
Transmitter
ter and receiver CSI allow the transmitter to adapt both its power and rate to the channel
gain at time i, leading to the highest capacity of the three scenarios.
Channel Distribution Information Known
Solving the capacity with input distribution can be q quite
uite complicated depending on the nature of
the fading distribution. Also fading correlation introduces channel memoryand this makes finding
the solution even more difficult. For these reasons, finding the capacity-achieving
capacity achieving input distribution
and corresponding
nding capacity of fading channels under CDI remains an open problem for almost all
channel distributions.
Channel Side Information at Receiver
where the CSI g[i] is known to the receiver at time i. In this case there are two channel capacity
definitions are
e defined: Shannon capacity, also called ergodic capacity, and capacity with outage.
SHANNON (ERGODIC) CAPACITY

Note that this formula is a probabilistic average: the capacity C is equal to Shannon capacity for an
AWGN channel with SNR γ, given by B log2(1 + γ ) and averaged over the distribution of γ.
The Shannon capacity of a fading channel with receiver CSI only is less than the Shannon capacity of
an AWGN channel with the same average SNR. In other words, fading reduces Shannon capacity
when only the receiver has CSI.
CAPACITY WITH OUTAGE
Capacity with outage : is defined as the maximum rate that can be transmitted over the channel with
some outage probability corresponding to the probability that the transmission cannot be decoded
with negligible error probability. Since the transmitter does not know the CSI, the transmitter fixes a
minimum received SNR γmin.
If the received SNR is below γmin then the bits received over that transmission burst cannot be
decoded correctly and the receiver declares an outage.
outage. The probability of outage is thus
Pout = p(γ <γmin)The average rate correctly received over many transmission bursts is Cout =
(1−Pout)B log2(1+γmin).

CSI KNOWN TO TRANSMITTER AND RECEIVER


If both the transmitter and receiver have CSI then the transmitter
transmitter can adapt its transmission strategy
relative to this CSI.In this case there is no capacity versus outage where the transmitter sends bits
that cannot be decoded, since the transmitter knows the channel and thus will send bits that can be
decoded correctly. The shannons capacity in this case would be

CODER AND DECODER


The codewords associated with each γj are thus multiplexed together for transmission and
then demultiplexed at the channel output. This effectively reduces the time
time-varying
varying channel
to a set of time-invariant
invariant channels in parallel, The average rate on the channel is just the sum
of rates associated
ated with each of the γj channels weighted by p(γj).
p(γj) By employing unique
coding and decoding the SNR and the code capacity can be improved, the data rate sent over
the channel for that instantaneous SNR also increases.

POWER ADAPTATION STRATEGY -In thee scenario of channel power allocation, the water
water-
filling algorithm can allocate power for multiple channels according to the specific situation of the
channel, effectively improvingSNR and throughput. When the SNR reduce below threshold, the
SNR.The amount of power allocated for a given γ
signal power is increased to maintain the threshold SNR.The
equals 1/γ0 − 1/γ,
γ, the amount of water between the bottom of the bowl (1/γ ) and the constant
water line (1/γ0 ).

The power is increased till the threshold SNR is reached, otherwise power remains unaltered.
The capacity after power allocation is

CAPACITY OF FREQUENCY-SELECTIVE
SELECTIVE FADING CHANNELS

Time-Invariant Channels :Consider


Consider a time-invariant
time channel with frequency
ncy response H(f ), as shown
in Figure 4.9. Assume a total transmit power constraint P.When the channel is time invariant , it is
typically assumed that H(f) is known at both the Tx. and Rx. Here, we will assume that the fading is
block fading, so the channel
nel will appear as a set of AWGN channel in parallel with SNR : in the

jth channel.

The capacity C =

You might also like