[Semester 1] Error Correction Flashcards

1
Q

Redundant bits

A

Extra bits that are added to the output

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Redundant bits check for…

A

Data loss

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

How do you measure the number of redundant bits needed?

A

Use a XOR gate to compare the expected output with the actual output

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Hamming distance

A

The minimum number of substitutions needed to change one output to the other (i.e. number of different bits)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Check bits

A

Number of redundant bits needed to correct an error

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Check bits are located in powers of…

A

2 (1, 2, 4, …)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Parity bits

A

Extra bits added to ensure the number of 1s is even/odd

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

True or false: Parity bits check the data address to look for errors

A

False! By using parity bits, you can check for errors without knowing the location of the data.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly