Skip to content

Commit fecb72c

Browse files
authored
Update README.md
1 parent 30ec523 commit fecb72c

1 file changed

Lines changed: 73 additions & 1 deletion

File tree

README.md

Lines changed: 73 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,2 +1,74 @@
11
# bpsk-ber [![License: MIT](https://img.shields.io/badge/License-MIT-blue.svg)](https://github.com/etfovac/bpsk-ber/blob/master/LICENSE) [![GitHub (pre-)release](https://img.shields.io/badge/release-1.0-yellow.svg)](https://github.com/etfovac/bpsk-ber/releases/tag/v1.0)
2-
bpsk-ber
2+
3+
### Keywords:
4+
5+
> BPSK, Binary Phase Shift Keying
6+
7+
> AWGN, Additive white Gaussian noise
8+
9+
> SNR, Signal to Noise Ratio
10+
11+
> BER, Bit Error Rate, POE, Probability Of Error
12+
13+
> Digital Signal processing
14+
15+
16+
## Basic Overview
17+
In digital phase modulation, the bits that need to be transmitted are coded in the carrier phase change.
18+
The simplest phase modulation, called Binary Phase Shift Keying (BPSK), uses two phases to encode two binary digits.
19+
20+
The BPSK modulator is implemented using an input data set (0 and 1) which is sent to the input of the BPSK encoder which has assigned voltages of -1V and + 1V to this bit sequence. The encoder output is multiplied by the carrier cosine signal.
21+
The integrator works as a low-pass filter and removes harmonics caused by multiplying the received signal by the carrier signal. The output of the integrator is led to a threshold detector which at the output reconstructs through 0 and 1.
22+
If the signal strength is sufficiently greater than the noise power at the link line, this detected bit string will be identical to the one sent.
23+
24+
MATLAB simulation that mathematically models the process of determining BER performs the following:
25+
1. Creating BPSK symbols +1 and -1 from a randomly generated bit sequence (given length)
26+
2. Adding white (Gaussian) noise (for a given difference between signal level and noise)
27+
3. Detection of the received signal based on the reception threshold
28+
4. Counting errors and drawing BER graphics
29+
30+
For the assessment of BER, BPSK coding in the basic frequency range was used, ie. modulation and demodulation were not simulated (moving the signal to a higher frequency, then back to baseband) due to the faster execution of the simulation and because the results are the same in both cases.
31+
32+
33+
34+
35+
### Flowchart
36+
<img src="https://github.com/etfovac/bpsk-ber/blob/master/graphics/bpsk_system.png" alt="bpsk_system">
37+
<img src="https://github.com/etfovac/bpsk-ber/blob/master/graphics/bpsk_signal.png" alt="bpsk_signal">
38+
39+
bit 1: s(t) = A cos(2πfct) = +A cos(2πfct)
40+
bit 0: s(t) = A cos(2πfct+ π) = -A cos(2πfct)
41+
42+
s(t) = A d(t) cos(2πfct)
43+
44+
r(t) = s(t) + n(t)
45+
46+
<img src="https://github.com/etfovac/bpsk-ber/blob/master/graphics/bpsk_snr_formula.png" alt="bpsk_snr_formula" width="150" height="50">
47+
<img src="https://github.com/etfovac/bpsk-ber/blob/master/graphics/bpsk_ber_formula.png" alt="bpsk_ber_formula" width="150" height="50">
48+
49+
### Results
50+
<img src="https://github.com/etfovac/bpsk-ber/blob/master/graphics/bpsk_system_fig1.png" alt="bpsk_system_fig1">
51+
<img src="https://github.com/etfovac/bpsk-ber/blob/master/graphics/bpsk_system_fig2.png" alt="bpsk_system_fig2">
52+
<img src="https://github.com/etfovac/bpsk-ber/blob/master/graphics/bpsk_ber_fig1.png" alt="bpsk_ber_fig1">
53+
54+
```
55+
BPSK simulation
56+
BPSK - num of data bits to transfer through the channel: 1000000
57+
BER = -0.484644 za SNR = -10
58+
BER = -0.542406 za SNR = -8
59+
BER = -0.622411 za SNR = -6
60+
BER = -0.731174 za SNR = -4
61+
BER = -0.884889 za SNR = -2
62+
BER = -1.105961 za SNR = 0
63+
BER = -1.425159 za SNR = 2
64+
BER = -1.902257 za SNR = 4
65+
BER = -2.618704 za SNR = 6
66+
BER = -3.782516 za SNR = 8
67+
BER = -5.301030 za SNR = 10
68+
```
69+
### Conclusion
70+
The probability of incorrect bit detection (BER) is practically lost for a large SNR and is of the order of 1/N (1 bit in the sequence).
71+
All BER curves follow the theoretical BER curve with small deviations.
72+
Therefore, the BER does not depend on the number of bits transmitted.
73+
The minimum SNR for which BPSK has 1 bit error depends on the total transmitted bits, so that for a larger number of transmitted bits, the SNR must be higher for the signal to be correctly reconstructed.
74+
For example. when transmitting 100 bits, it is enough for the SNR to exceed 4 dB so that there is no transmission error, while for the transmission of 100,000 bits, the SNR must exceed 8 dB.

0 commit comments

Comments
 (0)