Convenient way for detecting check bits in hamming code

Abstract

When the data is transmitted through the channel, error mostly occurs in data which can be detected and corrected at the receiver side by using Hamming code. This technique is used now days in Wireless communication, in deep space communication etc, e.g. Fixed wireless broadband with high error rate where there is need of correction not only detection in the data. In this coding scheme the detection of data depend on the check/parity bits, these bits play a vital role in hamming code because they locate the position where the error has been occurred. These check bits are inserted into the data at specified position at the transmitter side.. But for the correction of data at receiver side without any need of retransmission, we need to find the value of check bits. And to find theses bits we design a matrix which gives us the values of check bits (0.1) with the help of data bits. Normally these bits can be found by using Ex-Or gate[16]. In this paper I have found these bits using another logic that is AND-OR logic., for the sake of convenience and knowledge. When the data is received at the receiver side and suppose error is occurred than at the receiver side again we need to find the check bits by repeating the process at transmitter side. Than will compare the check bits at transmitter and receiver side using a new logic, that is AND-OR logic, which will locate the position of error. And the data can be recovered easily without need of retransmission of data. © 2011 Springer-Verlag Berlin Heidelberg.