0
Longitudinal parity, sometime it is also called longitudinal redundancy check or horizontal parity, tries to solve the main weakness of simple parity.
The first step of this parity scheme involves grouping individual character together in a block, as fig given below 1.1fig.Each character (also called a row) in the block has its own parity bit. In addition, after a certain number of character are sent, a row of parity bits, or a block character check, is also sent. Each parity bit in this last row is a parity check for all the bits in the Colum above it. If one bit is altered in the Row 1, the parity bit at the end of row 1 signals an error. If two bits in Row 1 are flipped, the Row 1 parity check will not signal error, but two Colum parity checks will signal errors. By this way how longitudinal parity is able to detect more errors than simple parity.
Still curious? Ask our experts.
Chat with our AI personalities
Fran
Rafa
LaoAdd your answer:
Earn +20 pts
When parity detects an error what happens?
A parity error always causes the system to hault. On the screen, you see the error message parity error 1 (parity error on the motherboard) or parity error 2 (parity error on an expansion card)
What is the error detection technique that can detect errors with only one bit?
(a) simple parity check (b) two-dimensional parity check (c) crc (d) checksum
What is a fault tolerance measure known as disk striping with parity?
RAID-5 provides data redundancy by using parity. Parity is a calculated value used to reconstruct data after a failure. While data is being written to a RAID-5 volume, parity is calculated by doing an exclusive OR (XOR) procedure on the data. The resulting parity is then written to the volume.
How is the value of a parity bit assigned?
Count the number of '1's in a binary value. If this number is odd, the parity bit is 1 - otherwise it's 0. RMS
The circuit diagram for 3 bit parity generator?
gdfgfddffd
