BPSK modulation is the simplest of all the M-PSK techniques. An insight into the derivation of error rate performance of an optimum BPSK receiver is essential as it serves as a stepping stone to understand the derivation for other comparatively complex techniques like QPSK,8-PSK etc..

Understanding the concept of Q function and error function is a pre-requisite for this section of article.

The ideal constellation diagram of a BPSK transmission (Figure 1) contains two constellation points located equidistant from the origin. Each constellation point is located at a distance $latex \sqrt{Es} $ from the origin, where E_{s} is the BPSK symbol energy. Since the number of bits in a BPSK symbol is always one, the notations – symbol energy (E_{s}) and bit energy (E_{b}) can be used interchangeably (E_{s}=E_{b}).

Assume that the BPSK symbols are transmitted through an AWGN channel characterized by variance = N_{0}/2 Watts. When 0 is transmitted, the received symbol is represented by a Gaussian random variable ‘r’ with mean=S_{0} = $latex \sqrt{Es} $ and variance =N_{0}/2. When 1 is transmitted, the received symbol is represented by a Gaussian random variable – r with mean=S_{1}= $latex \sqrt{Es} $ and variance =N_{0}/2. Hence the conditional density function of the BPSK symbol (Figure 2) is given by,

$latex \begin{matrix}

f(r\mid 0_T)=\frac{1}{\sqrt{\pi N_0}}exp\left \{ -\frac{\left( \hat{r}-\hat{s}_0\right )^2}{N_0} \right \} \;\;\;\;\;\rightarrow (1A)

\\

\\ f(r\mid 1_T)=\frac{1}{\sqrt{\pi N_0}}exp\left \{ -\frac{\left( \hat{r}-\hat{s}_1\right )^2}{N_0} \right \}\;\;\;\;\;\rightarrow (1B)

\end{matrix} &s=1&fg=0000A0$

An optimum receiver for BPSK can be implemented using a correlation receiver or a matched filter receiver (Figure 3). Both these forms of implementations contain a decision making block that decides upon the bit/symbol that was transmitted based on the observed bits/symbols at its input.

When the BPSK symbols are transmitted over an AWGN channel, the symbols appears smeared/distorted in the constellation depending on the SNR condition of the channel. A matched filter or that was previously used to construct the BPSK symbols at the transmitter. This process of projection is illustrated in Figure 4. Since the assumed channel is of Gaussian nature, the continuous density function of the projected bits will follow a Gaussian distribution. This is illustrated in Figure 5.

After the signal points are projected on the basis function axis, a decision maker/comparator acts on those projected bits and decides on the fate of those bits based on the threshold set. For a BPSK receiver, if the a-prior probabilities of transmitted 0’s and 1’s are equal (P=0.5), then the decision boundary or threshold will pass through the origin. If the a-priori probabilities are not equal, then the optimum threshold boundary will shift away from the origin.

Considering a binary symmetric channel, where the a-priori probabilities of 0’s and 1’s are equal, the decision threshold can be conveniently set to T=0. The comparator, decides whether the projected symbols are falling in region A or region B (see Figure 4). If the symbols fall in region A, then it will decide that 1 was transmitted. It they fall in region B, the decision will be in favor of ‘0’.

For deriving the performance of the receiver, the decision process made by the comparator is applied to the underlying distribution model (Figure 5). The symbols projected on the $latex \phi $ axis will follow a Gaussian distribution. The threshold for decision is set to T=0. A received bit is in error, if the transmitted bit is ‘0’ & the decision output is ‘1’ and if the transmitted bit is ‘1’ & the decision output is ‘0’.

This is expressed in terms of probability of error as,

Or equivalently,

$latex P(error) = P(1_D,0_T) + P(0_D,1_T) \;\;\;\;\;\;\;\;\rightarrow (3) &s=1&fg=0000A0$

By applying Bayes Theorem, the above equation is expressed in terms of conditional probabilities as given below,

$latex P(error) = P(0_T) P( 1_D \mid 0_T ) + P(1_T) P(0_D \mid 1_T) \;\;\;\rightarrow (4) &s=1&fg=0000A0$

Since a-prior probabilities are equal P(0_{T})= P(1_{T}) =0.5, the equation can be re-written as

Intuitively, the integrals represent the area of shaded curves as shown in Figure 6. From the previous article, we know that the area of the shaded region is given by Q function.

For the continuous density functions given in equation 1A, the mean=S_{0} = $latex \sqrt{Es} $ and variance =N_{0}/2, the area of region of error in Figure 6a is given by

$latex P( 1_D \mid 0_T ) = Q\left (\sqrt{\frac{E_s}{N_0/2}}\right) \;\;\;\;\;\;\;\;\rightarrow (7) &s=1&fg=0000A0$

Similarly,

$latex P( 0_D \mid 1_T ) = Q\left(\sqrt{\frac{E_s}{N_0/2}}\right) \;\;\;\;\;\;\;\;\rightarrow (8) &s=1&fg=0000A0$

From (4), (6), (7) and (8),

For BPSK, since E_{s}=E_{b}, the probability of symbol error (P_{s}) and the probability of bit error (P_{b}) are same. Therefore, expressing the P_{s} and P_{b} in terms of Q function and also in terms of complementary error function :

$latex P_s=P_b= Q\left(\sqrt{\frac{2E_s}{N_0}}\right) = Q\left(\sqrt{\frac{2E_b}{N_0}}\right) \;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\rightarrow (11) &s=1&fg=0000A0$

$latex P_s=P_b= 0.5 \; erfc\left(\sqrt{\frac{E_s}{N_0}}\right) = 0.5 \; erfc\left(\sqrt{\frac{E_b}{N_0}}\right) \;\;\rightarrow (12)&s=1&fg=0000A0$

### Reference:

### See Also

[1] Simulation of BER Vs Eb/N0 for BPSK modulation over AWGN in Matlab

Pingback: Performance comparison of Digital Modulation techniques » GaussianWaves()

Pingback: Channel Capacity & Shannon’s theorem – demystified | GaussianWaves()

Pingback: BER Vs Eb/N0 for QPSK modulation over AWGN | GaussianWaves()

Pingback: Simulation of Symbol Error Rate Vs SNR performance curve for 64-QAM in AWGN | GaussianWaves()

Pingback: Constructing a rectangular constellation for 16-QAM | GaussianWaves()

Pingback: BER Vs Eb/N0 for BPSK modulation over AWGN | GaussianWaves()

Pingback: Q function and Error functions | GaussianWaves()

Pingback: Simulation of Symbol Error Rate Vs SNR performance curve for 16-QAM in AWGN | GaussianWaves()

Pingback: Non-central Chi-squared Distribution | GaussianWaves()

Pingback: Chi-Squared Distribution | GaussianWaves()

Pingback: Uniform Random Variables and Uniform Distribution | GaussianWaves()

Pingback: Random Variables, CDF and PDF | GaussianWaves()

Pingback: QPSK modulation and Demodulation | GaussianWaves()