# Hamming Code Pdf

Hamming code is technique developed by R.W. Hamming for error correction. This method corrects the error by finding the state at which the error has occurred.

Implementation of hamming code in FPGA. In Section V, hamming code implementation in TANNER EDA tools describes and depicts the synthesis result. Section VI is the conclusion. HAMMING CODE ALGORITHM - is as follows: 1. K parity bits are added to an n-bit data word, forming a code word of n+k bits 4. Hamming Codes are linear codes, and a Hamming Code will be described as a n,k q-ary Hamming Code, where q is the size of the base ﬁeld, F q. In other words an n,k q-ary Hamming Code is a linear subspace of the n-dimensional vector space over F q. As an introduction, here is a concrete construction of a 7,4 binary Hamming Code.

We’ll be covering the following topics in this tutorial:

### Hamming Code Tutorial Pdf

## Determining the positions of redundancy bits

Till now, we know the exact number of redundancy bits required to be embedded with the particular data unit.

We know that to detect errors in a 7 bit code, 4 redundant bits are required.

Now, the next task is to determine the positions at which these redundancy bits will be placed within the data unit.

• These redundancy bits are placed at the positions which correspond to the power of2.

• For example in case of 7 bit data, 4 redundancy bits are required, so making total number of bits as 11. The redundancy bits are placed in position 1, 2, 4 and 8 as shown in fig.

## Generating parity information

• In Hamming code, each r bit is the VRC for one combination of data bits. r_{l} is the VRC bit for one combination of data bits, r_{2} is the VRC for another combination of data bits and so on.

• Each data bit may be included in more than one VRC calculation.

• r_{l} bit is calculated using all bits positions whose binary representation includes a 1 in the rightmost position.

• r_{2} bit calculated using all the bit positions with a 1 in the second position and so on.

• Therefore the various r bits are parity bits for different combination of bits.

The various combinations are:

r_{l }: bits 1,3,5, 7, 9, 11

r_{2} : bits 2, 3, 6, 7, 10, 11

r_{4} : bits 4, 5, 6, 7

r_{8} : bits 8, 9, 10, 11

### Hamming Code Convert

## Example of Hamming Code Generation

Suppose a binary data 1001101 is to be transmitted. To implement hamming code for this, following steps are used:

1. Calculating the number of redundancy bits required. Since number of data bits is 7, the value of r is calculated as

2^{r}> m + r + 1

2^{4}> 7 + 4 + 1

Therefore no. of redundancy bits = 4

2. Determining the positions of various data bits and redundancy bits. The various r bits are placed at the position that corresponds to the power of 2 *i.e.* 1, 2, 4, 8

4. Thus data 1 0 0 1 1 1 0 0 1 0 1 with be transmitted.

## Error Detection & Correction

Considering a case of above discussed example, if bit number 7 has been changed from 1 to 0.The data will be erroneous.

Data sent: 1 0 0 1 1 1 0 0 1 0 1

### How To Do Hamming Code

Data received: 1 00 1 0 1 00 1 0 1 (seventh bit changed)

### Hamming Code Pdf

The receive takes the transmission and recalculates four new VRCs using the same set of bits used by sender plus the relevant parity (r) bit for each set as shown in fig.

Then it assembles the new parity values into a binary number in order of r position (r_{8}, r_{4}, *r _{2}, *r

_{1}).

In this example, this step gives us the binary number 0111. This corresponds to decimal 7. Therefore bit number 7 contains an error. To correct this error, bit 7 is reversed from 0 to 1.