Additive white Gaussian noise

The AWGN channel is represented by a series of outputs ${\displaystyle Y_{i}}$ at discrete-time event index ${\displaystyle i}$. ${\displaystyle Y_{i}}$ is the sum of the input ${\displaystyle X_{i}}$ and noise, ${\displaystyle Z_{i}}$, where ${\displaystyle Z_{i}}$ is independent and identically distributed and drawn from a zero-mean normal distribution with variance ${\displaystyle N}$ (the noise). The ${\displaystyle Z_{i}}$ are further assumed to not be correlated with the ${\displaystyle X_{i}}$.

${\displaystyle Z_{i}\sim {\mathcal {N}}(0,N)\,\!}$

${\displaystyle Y_{i}=X_{i}+Z_{i}.\,\!}$

The capacity of the channel is infinite unless the noise ${\displaystyle N}$ is nonzero, and the ${\displaystyle X_{i}}$ are sufficiently constrained. The most common constraint on the input is the so-called "power" constraint, requiring that for a codeword ${\displaystyle (x_{1},x_{2},\dots ,x_{k})}$ transmitted through the channel, we have:

${\displaystyle {\frac {1}{k}}\sum _{i=1}^{k}x_{i}^{2}\leq P,}$

where ${\displaystyle P}$ represents the maximum channel power. Therefore, the channel capacity for the power-constrained channel is given by:^{[clarification needed]}

${\displaystyle C=\max \left\{I(X;Y):f{\text{ s.t. }}E\left(X^{2}\right)\leq P\right\}\,\!}$

where ${\displaystyle f}$ is the distribution of ${\displaystyle X}$. Expand ${\displaystyle I(X;Y)}$, writing it in terms of the differential entropy:

${\displaystyle {\begin{aligned}&I(X;Y)=h(Y)-h(Y\mid X)\\[5pt]={}&h(Y)-h(X+Z\mid X)\\[5pt]={}&h(Y)-h(Z\mid X)\end{aligned}}\,\!}$

But ${\displaystyle X}$ and ${\displaystyle Z}$ are independent, therefore:

${\displaystyle I(X;Y)=h(Y)-h(Z)\,\!}$

Evaluating the differential entropy of a Gaussian gives:

${\displaystyle h(Z)={\frac {1}{2}}\log(2\pi eN)\,\!}$

Because ${\displaystyle X}$ and ${\displaystyle Z}$ are independent and their sum gives ${\displaystyle Y}$:

${\displaystyle E(Y^{2})=E((X+Z)^{2})=E(X^{2})+2E(X)E(Z)+E(Z^{2})\leq P+N\,\!}$

From this bound, we infer from a property of the differential entropy that

${\displaystyle h(Y)\leq {\frac {1}{2}}\log(2\pi e(P+N))\,\!}$

Therefore, the channel capacity is given by the highest achievable bound on the mutual information:

${\displaystyle I(X;Y)\leq {\frac {1}{2}}\log(2\pi e(P+N))-{\frac {1}{2}}\log(2\pi eN)\,\!}$

Where ${\displaystyle I(X;Y)}$ is maximized when:

${\displaystyle X\sim {\mathcal {N}}(0,P)\,\!}$

Thus the channel capacity ${\displaystyle C}$ for the AWGN channel is given by:

${\displaystyle C={\frac {1}{2}}\log \left(1+{\frac {P}{N}}\right)\,\!}$

Suppose that we are sending messages through the channel with index ranging from ${\displaystyle 1}$ to ${\displaystyle M}$, the number of distinct possible messages. If we encode the ${\displaystyle M}$ messages to ${\displaystyle n}$ bits, then we define the rate ${\displaystyle R}$ as:

${\displaystyle R={\frac {\log M}{n}}\,\!}$

A rate is said to be achievable if there is a sequence of codes so that the maximum probability of error tends to zero as ${\displaystyle n}$ approaches infinity. The capacity ${\displaystyle C}$ is the highest achievable rate.

Consider a codeword of length ${\displaystyle n}$ sent through the AWGN channel with noise level ${\displaystyle N}$. When received, the codeword vector variance is now ${\displaystyle N}$, and its mean is the codeword sent. The vector is very likely to be contained in a sphere of radius ${\textstyle {\sqrt {n(N+\varepsilon )}}}$ around the codeword sent. If we decode by mapping every message received onto the codeword at the center of this sphere, then an error occurs only when the received vector is outside of this sphere, which is very unlikely.

Each codeword vector has an associated sphere of received codeword vectors which are decoded to it and each such sphere must map uniquely onto a codeword. Because these spheres therefore must not intersect, we are faced with the problem of sphere packing. How many distinct codewords can we pack into our ${\displaystyle n}$-bit codeword vector? The received vectors have a maximum energy of ${\displaystyle n(P+N)}$ and therefore must occupy a sphere of radius ${\textstyle {\sqrt {n(P+N)}}}$. Each codeword sphere has radius ${\displaystyle {\sqrt {nN}}}$. The volume of an n-dimensional sphere is directly proportional to ${\displaystyle r^{n}}$, so the maximum number of uniquely decodeable spheres that can be packed into our sphere with transmission power P is:

${\displaystyle {\frac {(n(P+N))^{n/2}}{(nN)^{n/2}}}=2^{(n/2)\log \left(1+P/N\right)}\,\!}$

By this argument, the rate R can be no more than ${\displaystyle {\frac {1}{2}}\log \left(1+{\frac {P}{N}}\right)}$.

In this section, we show achievability of the upper bound on the rate from the last section.

A codebook, known to both encoder and decoder, is generated by selecting codewords of length n, i.i.d. Gaussian with variance ${\displaystyle P-\varepsilon }$ and mean zero. For large n, the empirical variance of the codebook will be very close to the variance of its distribution, thereby avoiding violation of the power constraint probabilistically.

Received messages are decoded to a message in the codebook which is uniquely jointly typical. If there is no such message or if the power constraint is violated, a decoding error is declared.

Let ${\displaystyle X^{n}(i)}$ denote the codeword for message ${\displaystyle i}$, while ${\displaystyle Y^{n}}$ is, as before the received vector. Define the following three events:

1. Event ${\displaystyle U}$:the power of the received message is larger than ${\displaystyle P}$.
2. Event ${\displaystyle V}$: the transmitted and received codewords are not jointly typical.
3. Event ${\displaystyle E_{j}}$: ${\displaystyle (X^{n}(j),Y^{n})}$ is in ${\displaystyle A_{\varepsilon }^{(n)}}$, the typical set where ${\displaystyle i\neq j}$, which is to say that the incorrect codeword is jointly typical with the received vector.

An error therefore occurs if ${\displaystyle U}$, ${\displaystyle V}$ or any of the ${\displaystyle E_{i}}$ occur. By the law of large numbers, ${\displaystyle P(U)}$ goes to zero as n approaches infinity, and by the joint Asymptotic Equipartition Property the same applies to ${\displaystyle P(V)}$. Therefore, for a sufficiently large ${\displaystyle n}$, both ${\displaystyle P(U)}$ and ${\displaystyle P(V)}$ are each less than ${\displaystyle \varepsilon }$. Since ${\displaystyle X^{n}(i)}$ and ${\displaystyle X^{n}(j)}$ are independent for ${\displaystyle i\neq j}$, we have that ${\displaystyle X^{n}(i)}$ and ${\displaystyle Y^{n}}$ are also independent. Therefore, by the joint AEP, ${\displaystyle P(E_{j})=2^{-n(I(X;Y)-3\varepsilon )}}$. This allows us to calculate ${\displaystyle P_{e}^{(n)}}$, the probability of error as follows:

${\displaystyle {\begin{aligned}P_{e}^{(n)}&\leq P(U)+P(V)+\sum _{j\neq i}P(E_{j})\\&\leq \varepsilon +\varepsilon +\sum _{j\neq i}2^{-n(I(X;Y)-3\varepsilon )}\\&\leq 2\varepsilon +(2^{nR}-1)2^{-n(I(X;Y)-3\varepsilon )}\\&\leq 2\varepsilon +(2^{3n\varepsilon })2^{-n(I(X;Y)-R)}\\&\leq 3\varepsilon \end{aligned}}}$

Therefore, as n approaches infinity, ${\displaystyle P_{e}^{(n)}}$ goes to zero and ${\displaystyle R<I(X;Y)-3\varepsilon }$. Therefore, there is a code of rate R arbitrarily close to the capacity derived earlier.

Here we show that rates above the capacity ${\displaystyle C={\frac {1}{2}}\log \left(1+{\frac {P}{N}}\right)}$ are not achievable.

Suppose that the power constraint is satisfied for a codebook, and further suppose that the messages follow a uniform distribution. Let ${\displaystyle W}$ be the input messages and ${\displaystyle {\hat {W}}}$ the output messages. Thus the information flows as:

${\displaystyle W\longrightarrow X^{(n)}(W)\longrightarrow Y^{(n)}\longrightarrow {\hat {W}}}$

Making use of Fano's inequality gives:

${\displaystyle H(W\mid {\hat {W}})\leq 1+nRP_{e}^{(n)}=n\varepsilon _{n}}$ where ${\displaystyle \varepsilon _{n}\rightarrow 0}$ as ${\displaystyle P_{e}^{(n)}\rightarrow 0}$

Let ${\displaystyle X_{i}}$ be the encoded message of codeword index i. Then:

${\displaystyle {\begin{aligned}nR&=H(W)\\&=I(W;{\hat {W}})+H(W\mid {\hat {W}})\\&\leq I(W;{\hat {W}})+n\varepsilon _{n}\\&\leq I(X^{(n)};Y^{(n)})+n\varepsilon _{n}\\&=h(Y^{(n)})-h(Y^{(n)}\mid X^{(n)})+n\varepsilon _{n}\\&=h(Y^{(n)})-h(Z^{(n)})+n\varepsilon _{n}\\&\leq \sum _{i=1}^{n}h(Y_{i})-h(Z^{(n)})+n\varepsilon _{n}\\&\leq \sum _{i=1}^{n}I(X_{i};Y_{i})+n\varepsilon _{n}\end{aligned}}}$

Let ${\displaystyle P_{i}}$ be the average power of the codeword of index i:

${\displaystyle P_{i}={\frac {1}{2^{nR}}}\sum _{w}x_{i}^{2}(w)\,\!}$

where the sum is over all input messages ${\displaystyle w}$. ${\displaystyle X_{i}}$ and ${\displaystyle Z_{i}}$ are independent, thus the expectation of the power of ${\displaystyle Y_{i}}$ is, for noise level ${\displaystyle N}$:

${\displaystyle E(Y_{i}^{2})=P_{i}+N\,\!}$

And, if ${\displaystyle Y_{i}}$ is normally distributed, we have that

${\displaystyle h(Y_{i})\leq {\frac {1}{2}}\log {2\pi e}(P_{i}+N)\,\!}$

Therefore,

${\displaystyle {\begin{aligned}nR&\leq \sum (h(Y_{i})-h(Z_{i}))+n\varepsilon _{n}\\&\leq \sum \left({\frac {1}{2}}\log(2\pi e(P_{i}+N))-{\frac {1}{2}}\log(2\pi eN)\right)+n\varepsilon _{n}\\&=\sum {\frac {1}{2}}\log \left(1+{\frac {P_{i}}{N}}\right)+n\varepsilon _{n}\end{aligned}}}$

We may apply Jensen's equality to ${\displaystyle \log(1+x)}$, a concave (downward) function of x, to get:

${\displaystyle {\frac {1}{n}}\sum _{i=1}^{n}{\frac {1}{2}}\log \left(1+{\frac {P_{i}}{N}}\right)\leq {\frac {1}{2}}\log \left(1+{\frac {1}{n}}\sum _{i=1}^{n}{\frac {P_{i}}{N}}\right)\,\!}$

Because each codeword individually satisfies the power constraint, the average also satisfies the power constraint. Therefore,

${\displaystyle {\frac {1}{n}}\sum _{i=1}^{n}{\frac {P_{i}}{N}},\,\!}$

which we may apply to simplify the inequality above and get:

${\displaystyle {\frac {1}{2}}\log \left(1+{\frac {1}{n}}\sum _{i=1}^{n}{\frac {P_{i}}{N}}\right)\leq {\frac {1}{2}}\log \left(1+{\frac {P}{N}}\right).\,\!}$

Therefore, it must be that ${\displaystyle R\leq {\frac {1}{2}}\log \left(1+{\frac {P}{N}}\right)+\varepsilon _{n}}$. Therefore, R must be less than a value arbitrarily close to the capacity derived earlier, as ${\displaystyle \varepsilon _{n}\rightarrow 0}$.

In serial data communications, the AWGN mathematical model is used to model the timing error caused by random jitter (RJ).

The graph to the right shows an example of timing errors associated with AWGN. The variable Δt represents the uncertainty in the zero crossing. As the amplitude of the AWGN is increased, the signal-to-noise ratio decreases. This results in increased uncertainty Δt.^[1]

When affected by AWGN, the average number of either positive-going or negative-going zero crossings per second at the output of a narrow bandpass filter when the input is a sine wave is

${\displaystyle {\begin{aligned}&{\frac {\text{positive zero crossings}}{\text{second}}}={\frac {\text{negative zero crossings}}{\text{second}}}\\[8pt]={}&f_{0}{\sqrt {\frac {{\text{SNR}}+1+{\frac {B^{2}}{12f_{0}^{2}}}}{{\text{SNR}}+1}}},\end{aligned}}}$

where

ƒ₀ = the center frequency of the filter,

B = the filter bandwidth,

SNR = the signal-to-noise power ratio in linear terms.

In modern communication systems, bandlimited AWGN cannot be ignored. When modeling bandlimited AWGN in the phasor domain, statistical analysis reveals that the amplitudes of the real and imaginary contributions are independent variables which follow the Gaussian distribution model. When combined, the resultant phasor's magnitude is a Rayleigh-distributed random variable, while the phase is uniformly distributed from 0 to 2π.

The graph to the right shows an example of how bandlimited AWGN can affect a coherent carrier signal. The instantaneous response of the noise vector cannot be precisely predicted, however, its time-averaged response can be statistically predicted. As shown in the graph, we confidently predict that the noise phasor will reside about 38% of the time inside the 1σ circle, about 86% of the time inside the 2σ circle, and about 98% of the time inside the 3σ circle.^[1]

• Ground bounce
• Noisy-channel coding theorem
• Gaussian process