1 / 2

Information Redundancy: Parity

Information Redundancy: Parity. 1- Bit-per-Word : multiple errors in the same word are not guaranteed to be detected (for instance, all bi-directional faults, all 0’s, all 1’s, etc…). 2- Bit-per-Byte (or Half-Byte) : detects several multiple errors per word:.

nash
Download Presentation

Information Redundancy: Parity

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Information Redundancy: Parity 1-Bit-per-Word: multiple errors in the same word are not guaranteed to be detected (for instance, all bi-directional faults, all 0’s, all 1’s, etc…) 2-Bit-per-Byte (or Half-Byte): detects several multiple errors per word: 3-Bit-per-Chip: the parity is associated with the word that is stored in a single chip (does not guarantee detection of multiple errors or whole chip failure).

  2. Information Redundancy: Parity 4-Bit-per-Multiple-Chips: detects the failure of a complete chip, BUT does not locate the chip. If a chip fails, only one bit per parity group is changed in all parity groups. 5-Two-Dimensional Parity: detects and corrects several errors on the matrix. vargas@computer.org

More Related