Fire codes operate because of the careful selection of the CRC-generating polynomial. These special polynomials contain two prime-polynomial factors, each of which helps locate a detected error. Knowing the location of a transmitted error modulo and the degree of each of these prime-polynomial factors, you can apply the Chinese remainder theorem to locate the exact bit error. Although the math sounds complex, you can easily implement it with high-speed D flip-flops and XOR gates. If a 32-bit fire-code-protected block contains two errors separated by exactly 11 bits, the fire code fails to correct the errors.
Google: fire code error correction
Interested:
Comments:
See also:
| file: /techref/method/error/firecodes.htm, 1KB, , updated: 2008/10/18 14:31, local time: 2008/12/1 18:36,
38.103.63.55:LOG IN
|
| ©2008 These pages are served without commercial sponsorship. (No popup ads, etc...).Bandwidth abuse increases hosting cost forcing sponsorship or shutdown. This server aggressively defends against automated copying for any reason including offline viewing, duplication, etc... Please respect this requirement and DO NOT RIP THIS SITE. Questions? Please DO link to this page! Digg it! <A HREF="http://www.sxlist.com/techref/method/error/firecodes.htm"> Fire codes</A> |
| Did you find what you needed? |
Welcome to sxlist.com!sales, advertizing, & kind contributors just like you! Please don't rip/copy (here's why Copies of the site on CD are available at minimal cost. |
|
.