Bit Error Detection and Correction with Hamming Code Algorithm

Data communication performed at any time does not always go well, sometimes also happens that his name error when transmitting data. The detection and correction of errors in data transmission requires special algorithms in this study using the algorithm Hamming Code, the use of this algorithm due to ease in the detection and correction of bit damaged and is expected by this research easier for other researchers to develop algorithms Hamming Code for a variety of purposes in data transmission


I. INTRODUCTION
Process digital data transmission in communication can run safe premises but also there is an error [1] [2] [3]. Error result in changes to the content of data transferred. There is a wide -range logic to detect and correct the error. One way to detect errors that simply is by using Hamming Code single error correction [3] [4], this technique is a most convenient to find errors in bit data transmission [5] [6] [7] [8].
Hamming code is an error-detection method that can detect some errors, but it is only capable of single error correction [6]. This error detection method is suitable for use in situations where there is few randomized mistake [4]. Method Hamming Code inserts (n + 1) check bits into 2n data bits. This method uses XOR (Exclusive -OR) in the error detection process [1] [3] [7]. Input and output data from the method of Hamming Code in the form of binary numbers, This study tried to detecting and correcting the error with a length of 8 bits of data.

Communication
Digital communication is something that is important in a communications infrastructure that is being built [9], a simple basic communication model is as follows :

Figure 1. Basic Communication
The following is a description of Figure 1 [9]: a. The source is a tool to generate the data so that it can be transmitted. b. Transmitter serves to convert the data into the form of an analog signal to be transmitted. Often the data generated from the source system is not transmitted directly in its original form. A transmitter is quite moving, and marking information in the same way as to produce a signal -a signal electro -magnetic that can transmit over multiple sequential transmission systems. c. Source and Transmitter are part of Source System. d. Transmission system, in the form of a single transmission line or a complex network that connects the source to the destination. e. Receiver serves to convert an analog signal that receive in the form of digital data. The receiver receives signals from the transmission system and incorporates it into a specific shape that can be captured by the goal. For example, a modem will receive an analog signal coming from the network or the transmission path and converting it into a digital bit streams. f. Destination serves to capture data generated by the receiver. g. Receiver and Destination are part of the Destination System.
The data transmission process in detail [9] can be seen in the figure below: The following is a description of Figure 1 [9]: a. Information in the input. b. Data which is input. c. The signal will be transmitted in the form of an analog signal. d. Signal received in the shape of an analog signal. e. Data output. f. Information output.

Error Correction
At the time of data transmission system, there is the possibility of corrupted data (data error) [1] [4] [6] [7] [9]. The receiver will correct data error through a process of error detection and error correction. Error detection process performed by the transmitter by adding a few extra bits into data to be transmitted. Error detection and correction process often used in CD Players, High-speed modems, and cellular phones.

Hamming Code
Method Hamming Code is one method of error detection and error correction the most simple. This method uses logic operation XOR (Exclusive -OR) in the process of error detection, and the process of error correction, while input and output of data from the method of Hamming Code in the form of binary numbers [   If not, then the number of errors is only one position, and results of operations are the data contained errors.

III. RESULTS AND DISCUSSION
A To understand the process of completion method of Hamming Code can be seen in the following example.
C2 = see the position of second bit from the right of the member position where the bit value is 1, unless the post of the check bits. Take all data bits in that position.
C3 = see the position of the third bit from the right of the member position where the bit value is 1 unless the post of the check bits. Take all data bits in that position   Data input : Values check bits for data input, Once processed, the data input into, Then followed the process of calculation to output data as follows,  Position 10 is the position of the data M6, mean scores on the 6th position in the output data contains errors, data output shown as bellow:

IV. CONCLUSION
Research by the author using Hamming Code is only capable of correcting single error correction, then data input and output on the method of Hamming Code must be a result of the powers of 2n with n must be greater than one with a length of data input and output of Hamming Code must be at least equal to 4 bits, and also Hamming Code unable to check the position of the data error (bad bit) more than one.