# Fire code Data LinkError Detection / CorrectionMethod

Developed in the 1970's, Fire Codes are basically a tricky way of providing the same results as row and column parity or CRC. They are very fast to decode and check, and can be used to correct errors as well.

Fire codes operate because of the careful selection of the CRC-generating polynomial. (X^ 23 +1)( X^ 17 +X^3 +1) 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.

One of the simplest of these could be used as a direct replacement for a parity bit, used with each character in many existing systems, providing error correction instead of just the detection of erroneous characters.
```Data   * - - - - - - - *    * - - * - - - - * - - *
bits   - * - - - - - - *    - * - - * - - - * - - *
- - * - - - - - *    - - * - - * - - * - - *
- - - * - - - - *    - - - * - - * - * - - *
- - - - * - - - *    - - - - * - - * * - - *
- - - - - * - - *    - - - - - * - - X - - *
- - - - - - * - *    - - - - - - * - * * - *
- - - - - - - * *    - - - - - - - * * - * *
Parity = = = = = = = = P    = = = = = = = = ! = = !
```

Each parity bit is the XOR of parity for the data byte with which it is associated and parity for staggered bits from the eight previous bytes. Essentially, it is a clever way to obtain the same results as are provided by the use of row and column parity bits. (After the last byte of data, one extra byte, with the extra parity bit, is needed to provide parity for all the remaining diagonals.)

• US Patent 5,936,978

 file: /Techref/method/error/firecodes.htm, 3KB, , updated: 2009/1/23 11:33, local time: 2022/1/27 10:02, TOP NEW HELP FIND:  54.224.133.198:LOG IN

 ©2022 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! / MAKE! Fire codes

After you find an appropriate page, you are invited to your to this massmind site! (posts will be visible only to you before review) Just type a nice message (short messages are blocked as spam) in the box and press the Post button. (HTML welcomed, but not the <A tag: Instead, use the link box to link to another page. A tutorial is available Members can login to post directly, become page editors, and be credited for their posts.

Link? Put it here:
if you want a response, please enter your email address:
Attn spammers: All posts are reviewed before being made visible to anyone other than the poster.
 Did you find what you needed? "No. I'm looking for: " "No. Take me to the search page." "No. Take me to the top so I can drill down by catagory" "No. I'm willing to pay for help, please refer me to a qualified consultant" "No. But I'm interested. me at when this page is expanded."

 PICList 2022 contributors: o List host: MIT, Site host massmind.org, Top posters @20220127 * Page Editors: James Newton, David Cary, and YOU! * Roman Black of Black Robotics donates from sales of Linistep stepper controller kits. * Ashley Roll of Digital Nemesis donates from sales of RCL-1 RS232 to TTL converters. * Monthly Subscribers: Gregg Rew. on-going support is MOST appreciated! * Contributors: Richard Seriani, Sr.

.