Tags |
|
|
Links |
|
|
Casual Articles - History of the Computer - Memory Error Correction Codes Part 2 of 2
What's the first thing you look for when buying a product or service online? Ok, after the price? ;-)That's right - testimonials! Rave reviews from other people who have used the product or service that you're considering investing in can make a huge difference in whether or not you take out your credit card, right?When pot
For aspiring and experienced speakers alike, each aspect of credibility is to be closely guarded and continually built upon. This series of articles will focus on 15 facets of credibility that must exist for all speakers to succeed over the long run. “Instant Credibility” must continue to be nurtured for a career to continue. If you are
101 1010 becomes
1-0-1 C4-1-0-1 C3-0-c2-c1
The new check bits are used to generate parity for their appropriate bits. C1 checks each alternate bit, C2 checks each alternate 2 bits, C3 checks each alternate 4 bits, C4 checks each alternate 8 bits.
101 C101 C0CC
1=1 =1=1 =0=C - C1 is a 1 to make odd parity
10= =10= =0C= - C2 is a 1 to make odd parity
=== =101 C=== - C3 is a 1 to make odd parity
101 C=== ==== - C4 is a 1 to make odd parity
Thus the ECC (Error Correction Code) is 1111, and the word becomes
101 1101 1011
Just for security we can add a parity bit for this new word (can't be too careful!)
1101 1101 1011 The overall parity bit is not considered in the coding.
This word, which has grown from 7 bits to 12 bits can now be written to memory. When we need to read the data from memory we can check the bit pattern to see if we have a problem. For example suppose bit 7 in our word has dropped, and is now 0. Once again we generate the ECC to compare with the one
Incentive Plans Should Be UniversalGet your entire staff to pull in the same direction by designing your incentive plan to include all employees at some level of participation and only after a temporary evaluation period with the company (often 90 days). Many plans include part timers as well as full timers but at a somewhat lesse
101 1010 becomes
1-0-1 C4-1-0-1 C3-0-c2-c1
The new check bits are used to generate parity for their appropriate bits. C1 checks each alternate bit, C2 checks each alternate 2 bits, C3 checks each alternate 4 bits, C4 checks each alternate 8 bits.
101 C101 C0CC
1=1 =1=1 =0=C - C1 is a 1 to make odd parity
10= =10= =0C= - C2 is a 1 to make odd parity
=== =101 C=== - C3 is a 1 to make odd parity
101 C=== ==== - C4 is a 1 to make odd parity
Thus the ECC (Error Correction Code) is 1111, and the word becomes
101 1101 1011
Just for security we can add a parity bit for this new word (can't be too careful!)
1101 1101 1011 The overall parity bit is not considered in the coding.
This word, which has grown from 7 bits to 12 bits can now be written to memory. When we need to read the data from memory we can check the bit pattern to see if we have a problem. For example suppose bit 7 in our word has dropped, and is now 0. Once again we generate the ECC to compare with the on
Moving companies involved in crimes and scams generally get their clients mainly from Internet web sites that let you enter in your basic moving information, and then send the information to the so-called moving companies. The moving companies will give you a low-ball bid. When the movers actually show up, it's too late for you to save y
1=1 =1=1 =0=C - C1 is a 1 to make odd parity
10= =10= =0C= - C2 is a 1 to make odd parity
=== =101 C=== - C3 is a 1 to make odd parity
101 C=== ==== - C4 is a 1 to make odd parity
Thus the ECC (Error Correction Code) is 1111, and the word becomes
101 1101 1011
Just for security we can add a parity bit for this new word (can't be too careful!)
1101 1101 1011 The overall parity bit is not considered in the coding.
This word, which has grown from 7 bits to 12 bits can now be written to memory. When we need to read the data from memory we can check the bit pattern to see if we have a problem. For example suppose bit 7 in our word has dropped, and is now 0. Once again we generate the ECC to compare with the on
Google is using a crawler specially for their AdWords advertising system that automatically spiders and analyzes the content of advertising that is displayed on the Google Network or other websites. The name of the new crawler is AdsBot-Google. If you see such an entry in your web logs then you know, your web site has been visited by thi
101 1101 1011
Just for security we can add a parity bit for this new word (can't be too careful!)
1101 1101 1011 The overall parity bit is not considered in the coding.
This word, which has grown from 7 bits to 12 bits can now be written to memory. When we need to read the data from memory we can check the bit pattern to see if we have a problem. For example suppose bit 7 in our word has dropped, and is now 0. Once again we generate the ECC to compare with the on
Some people say that the resume is THE most important part of the job changing process, while others say it’s the cover letter and even others say it’s the interview. The truth is that they are all right and wrong!It’s like asking what is more important in a car, the brake pedal, the gas pedal or the steering wheel. Obviously yo
1101 0001 0011 - the parity bit is incorrect, showing even parity. The ECC we read out is 1111 (same as we wrote). Generate the new ECC.
101 C001 C0CC
1=1 =0=1 =0=C - C1 is 0 to make odd parity
10= =00= =0C= - C2 is 0 to make odd parity
=== =001 C=== - C3 is 0 to make odd parity
101 C=== ==== - C4 is 1 to make odd parity
Our new ECC is 1000, while the one we read out was 1111. We now perform an XOR (eXclusive OR) of these two ECCs. This means, where we have a 1 bit in one bit position, but not both, the result is a 1.
1111 - read out
1000 - generated
---- - XOR
0111 - result - C4=0, C1-3=1
The result is called the Error Syndrome, and is used to correct the failing bit. In this case we have bits C1, C2, and C3 = 1. This gives us decimal 1+2+4=7. The seventh bit is flipped from 0 to 1, restoring the original data. The ECC bits are stripped off and the data bits passed on.
Like all error detection systems, the
HTTP = HTML link (for blogs, profiles,phorums):
<a href="http://www.casualarticles.com/article/170277/casualarticles-History-of-the-Computer--Memory-Error-Correction-Codes-Part-2-of--2.html">History of the Computer - Memory Error Correction Codes Part 2 of 2</a>
BB link (for phorums):
[url=http://www.casualarticles.com/article/170277/casualarticles-History-of-the-Computer--Memory-Error-Correction-Codes-Part-2-of--2.html]History of the Computer - Memory Error Correction Codes Part 2 of 2[/url]
Related Articles:
Sales Compensation: Creating Performance Clarity
Why Al Turnquist Belongs on the Who's Who of Internet Marketing
The Other in Fiction - Creating Wonderfully Wicked Villains
Bookmark it:
|