You can simulate the BCH Code by using this C++ code. The procedure is very easy, just put:
- The number of t-error that can be corrected.
- "m" value from GF(2^m).
- Primitive polynomial equation.
- Generator polynomial from Primitive polynomial that you choose.
(recommended to use CodeBlocks for convenience)
Fig1. Input t-error capability; "m" value from GF(2^m); "p(x)" Primitive Polynomial; "g(x) Generator Polynomial";
Fig2. Galois Field Binary Polynomial Table and BER Result from GF(2^4); t=2; BCH Codes (15,7)
Fig3. BER Result For BCH (15,7,2)
Tag: Error Correcting Code; BCH Code C++;