Multiple error detection and correction over GF(2m) using novel cross parity code

Communication becomes most important in today's life. The world is dreaded to think beyond any communication gadgets. Data communication basically involves transfers of data from one place to another or from one point of time to another. Error may be introduced by the channel which makes data unreliable for user. Hence we need different error detection and error correction schemes. Our need is to achieve High speed and low complexity. The proposed work is to detect and correct a multiple error using low complexity novel cross parity code at lower overhead over GF(2
^m
). It is able to correct m<;= D
_w
<;= 3
^m/2
-1 multiple error combination out of all the possible 2
^m
-1 error. Our proposed work is to test on 128 bit parallel and 163 bit (FIPT/NIST) standard word level GF multiplier and improve the efficiency of the circuit when compare to the existing work. Then we implement the design using VHDL, then simulated and synthesized using Modelsim SE 6 simulator and Xilinx ISE 6.3i respectively.