Skip to main content

Binary PAM error probability extended to M-ary

Short answer

For polar binary PAM, P_e= Q(A/σ)= Q(√(2E_b/N_0)). For M-ary PAM with levels ±A,±3A,…±(M−1)A, P_e=2(1−1/M) Q(√(6E_s/(( M^2−1)N_0)).

Derive the expression for error probability for binary PAM system and extend it to M-ary system.

Binary PAM error probability

Assumptions: polar binary PAM; the sampled receiver output is +A+A for "1" and −A-A for "0"; additive Gaussian noise nn of zero mean and variance σ2\sigma^2; equal priors, so the threshold is 00.

y=±A+n,fN(n)=12πσe−n2/2σ2y = \pm A + n, \qquad f_N(n) = \frac{1}{\sqrt{2\pi}\sigma}e^{-n^2/2\sigma^2}
   f(y|0)            f(y|1)
     /\                /\
    /  \     |        /  \
 __/    \____|_______/    \__ y
    -A       0  threshold +A
          shaded tails = errors

Error when "1" is sent: y<0⇒n<−Ay < 0 \Rightarrow n < -A:

P(e∣1)=∫−∞−A12πσe−n2/2σ2dn=Q ⁣(Aσ)P(e|1) = \int_{-\infty}^{-A}\frac{1}{\sqrt{2\pi}\sigma}e^{-n^2/2\sigma^2}dn = Q\!\left(\frac{A}{\sigma}\right)

Error when "0" is sent: n>An > A, so by symmetry P(e∣0)=Q(A/σ)P(e|0) = Q(A/\sigma).

Pe=12P(e∣1)+12P(e∣0)=Q ⁣(Aσ)=12erfc ⁣(A2σ)P_e = \tfrac12P(e|1) + \tfrac12P(e|0) = Q\!\left(\frac{A}{\sigma}\right) = \frac12\text{erfc}\!\left(\frac{A}{\sqrt2\sigma}\right)

With a matched filter, A2/σ2=2Eb/N0A^2/\sigma^2 = 2E_b/N_0, so

Pe=Q ⁣(2EbN0)P_e = Q\!\left(\sqrt{\frac{2E_b}{N_0}}\right)

(For unipolar on-off PAM with levels 00 and AA, and threshold A/2A/2: Pe=Q(A/2σ)P_e = Q(A/2\sigma).)

Extension to M-ary PAM

Levels ±A,±3A,…,±(M−1)A\pm A, \pm3A, \dots, \pm(M-1)A (spacing 2A2A), with thresholds midway between adjacent levels.

  • Each of the M−2M-2 inner levels is in error if ∣n∣>A|n| > A: probability 2Q(A/σ)2Q(A/\sigma).
  • Each of the 2 outer levels can be in error on one side only: probability Q(A/σ)Q(A/\sigma).
Pe=(M−2) 2Q(A/σ)+2Q(A/σ)M=2(1−1M)Q ⁣(Aσ)P_e = \frac{(M-2)\,2Q(A/\sigma) + 2Q(A/\sigma)}{M} = 2\left(1-\frac1M\right)Q\!\left(\frac{A}{\sigma}\right)

The average symbol energy is Es=(M2−1)A2/3E_s = (M^2-1)A^2/3, so with a matched filter (σ2=N0/2\sigma^2 = N_0/2):

Pe=2(1−1M)Q ⁣(6Es(M2−1)N0)P_e = 2\left(1-\frac1M\right)Q\!\left(\sqrt{\frac{6E_s}{(M^2-1)N_0}}\right)

For M=2M=2 this reduces to the binary result. For a fixed EsE_s, a larger MM gives a larger PeP_e, but for a given bit rate the required bandwidth falls by a factor of log⁡2M\log_2 M.

✓ Answer checked by Claude Opus 5.5 (high effort)

All Communication Systems chapter 9 questions →