Processor in its socket on a red and black motherboard
Photo by Christian Wiediger on Unsplash

Computer Systems Structure

Hamming Code

Tick the boxes to set the bits of the received data word.

Hamming Error Correction Code Calculator
Bit position 12 11 10 09 08 07 06 05 04 03 02 01
Data(M) or Parity(C) M8 M7 M6 M5 C8 M4 M3 M2 C4 M1 C2 C1
Data Received
Hamming Code for Received Data
Error Position

Errors not found

How it works

The simplest of the error-correcting codes is the Hamming code devised by Richard Hamming at Bell Laboratories. To clarify the concept involved, the calculator was developed that finds the position of a single-bit error in an 8-bit word stored with four check bits. Inverting the bit in that position corrects the word. Two errors cannot be corrected: the calculator names a wrong position or reports more than one error.

Karnaugh Map

Tick the cells where the function F(A, B, C, D) is 1.

C′D′ C′D CD CD′ A′B′ A′B AB AB′

How it works

The map holds the 16 combinations of four variables so that neighbouring cells differ in one variable; the left and right edges are neighbours too, and so are the top and bottom ones. A group of 1, 2, 4, 8 or 16 neighbouring ones is a product of the variables that keep their value within the group. A prime implicant is a group that no larger group contains. The minimal form takes as few prime implicants as cover every one, and of such sets the one with the fewest letters. The map opens with the function of my practice works: F15 = Σ(5, 7, 10, 11, 13, 15).

From the course

  • Semesters 2 and 3
  • Lab work 6: Hamming error correction
  • Practice works 1 and 2: minimal forms with a Karnaugh map
  • Tools: Digital Works, 8085 and 8086 assembly

Useful resources

  1. Two's complement the article from the Wikipedia
  2. Hamming code the article from the Wikipedia
  3. Digital Works Software the circuits simulator for Windows
  4. EasyEDA the online circuits simulator