Performance Analysis of linear error correcting codes

1. Performance Analysis of linear error correcting codes Group Members • Shantharam Iyer • Nitish Sinha • Anjana Rao • Premkumar Iyangar

2. Project Objective Comparison of the performance(BER v/s.SNR) of different channel coding schemes for varying: • A) Sampling Frequency • B) Code rate(k/n) • C)Modulation schemes for a AWGN channel

3. Decode/ Error Correction Modulation Recovered Message Data Message Data Gaussian Noise Demodulation Experimental Setup Encode

4. Channel Coding Techniques Used 1)Parity Check Codes: Corrects up to 1 error & Detects up to 1 error 2) Hamming Codes: Corrects one error & Detects upto 2 errors 3) Cyclic Codes Corrects one or more errors, depending on generator polynomial matrix size (n x k) and syndrome table (size (2^n-k) x n) 4) BCH Codes Corrects one or more errors, depending on generator polynomial matrix (n x k, n=(2^m)-1,m>3)

5. Modulation Schemes Investigated • Amplitude Shift Keying (ASK) - Information is stored in the amplitude of the signal • Phase Shift Keying (PSK) - Information is stored in the phase (zero crossings of the signal)

6. Results and conclusions

7. Varying code rates (parity check)

8. Varying code rates: Hamming

9. Varying code rates:Cyclic

10. Varying Code Rates -BCH

11. Conclusions on varying code rates Observation:As code rates increase for Parity and Cyclic , BER increases

12. Varying bandwidth consumption (parity check)

13. Varying Bandwidth Consumption:Hamming

14. Varying bandwidth consumption:Cyclic

15. Varying Bandwidth Consumption (BCH)

16. Effect of coding

17. Effect of Coding

18. Comparison of coding schemes