Professional Documents
Culture Documents
Thesis Presentation Final
Thesis Presentation Final
4x 1
Synchronous
RAM
D Q D Q D Q D Q
Control Logic
LFSR implementation of
synchronous RAM
Error Detection and
Correction
Error detection is the ability to detect errors.
Error correction has an additional feature that
enables identification and correction of the errors.
Error detection always precedes error correction.
Both can be achieved by having extra or redundant
or check bits in addition to data deduce that there is
an error
Original Data is encoded with the redundant bit(s)
New data formed is known as code word
Hamming Algorithm
In 1950, R.W. Hamming described a general method for
constructing code with minimum distance of 3 ,now
called Hamming Code.
(n,k) Hamming codes. Minimum distance always 3. Thus
can detect 2 errors and correct one error. n=2^m-1,
k = n - m, m≥3 .
Maximum-length codes. For every k≥3 integer there
exists a maximum length code (n,k) with n = 2k – 1,
dmin = 2k-1.
Position of redundancy
bit’s in hamming code
d d d r8 d d d r4 d r2 r1
11 10 9 8 7 6 5 4 3 2 1
r4: bit’s 4 , 5 , 6 , 7
r8: bit’s 8 , 9 , 10 , 11
Example of redundancy bit
calculation
Error detection using
hamming code
Hamming Algorithm
16
Technology Schematic
Test Bench Waveform
Simulation Results (4 Bit-data
input)
Number of Slices: 2 out of 3584 0%
Number of IOs: 11
Modulation QPSK/OQPSK