Experiment: 3
Baseband Channel Coding and Decoding:
Part A: Forward Error Correction (DAY :1):
Exp 1: Uncoded transmission over Binary Symmetric Channel (BSC)channel.
1) Take a text file of size 1KB of your choice.
2) Read the input text file and convert it to a binary string of say length M.
3) Transmit it through a BSC with error probability p.
4) At the receiver say you receive ‘y’.
5) Calculate bit error rate with respect to p. Repeat the experiment with different
values of p say p=0.01 to 0.2. Plot BER vs p.
6) Now using ‘y’ retrieve the text file.
7) In the reconstructed text file compute percentage of modified characters with
respect to the input text file. Plot it with respect to the different p values.
Exp 2: Understanding the concept of coding, error detection and correction using
Repetition (3,1), and Hamming (7,4) Codes over BSC.
1) Take the same text file and convert it to a Binary string of say length M. (Same procedure
as above).
2) Divide the Binary string into different chunks of length k bits.
3) Encode each chunk into n bits codeword using Repetition (3,1), and Hamming (7,4)
Codes.
4) Transmit the encoded sequence over a BSC channel with probability p.
5) Say you receive ‘y’, using y retrieve the original binary string using
(I) Majority decoding for Repetition code.
(ii) Syndrome based decoding for Hamming code.
6) Compute the no. of errors you can detect and correct.
7) Calculate BER with respect to p. Repeat the experiment with different values of p say
p=0.01 to 0.2. Plot BER vs p.
8) Compare BER of all three cases: i) Uncoded ii) Repetition code iii) Hamming Code.
9) Now using ‘y’, retrieve the text file. In the reconstructed text file compute percentage of
modified characters with respect to the input text file. Plot it with respect to the different p
for all 3 cases: i) Uncoded ii) Repetition code iii) Hamming Code.
Exp 3: Understanding concept of coding in error detection and correction using Repetition
(3,1), and Hamming (7,4) Codes over AWGN channel and performance of uncoded and
coded systems in presence of Gaussian noise.
1) Generate a random bit stream and divide it into chunks of size k bits.
2) Encode each chunk using Repetition (3,1), and Hamming (7,4) Codes.
3) Modulate using BPSK (Binary Phase shift Keying).
4) Add AWGN noise with different Eb/N0 ratio.
5) Demodulate received symbols to bits using threshold detection or hard decision
decoder.
6) Say you receive ‘y’, using y retrieve the original binary string using
(I) Majority decoding for Repetition code.
ii) Soft decision Decoding for Repetition code.
(iii) Syndrome based decoding for Hamming code.
7) Compare BER of all three cases: i) Uncoded ii) Repetition code with both hard and soft
decision decoding iii) Hamming Code at different Eb/N0 values.
7) Take Eb/N0=20 dB and find the theoretical BER of the above schemes and compare
with experimental results.
