Longitudinal redundancy check

Wikipedia, the free encyclopedia - Cite This Source

In telecommunication, a longitudinal redundancy check (LRC) or horizontal redundancy check is a form of redundancy check that is applied independently to each of a parallel group of bit streams. The data must be divided into transmission blocks, to which the additional check data is added.

The term usually applies to a single parity bit per bit stream, although it could also be used to refer to a larger Hamming code. While simple longitudinal parity can only detect errors, it can be combined with additional error control coding, such as a transverse redundancy check, to correct errors.

A longitudinal redundancy check for a sequence of characters may be computed in software by the following algorithm:

       Set LRC = 0

       For each character c in the string

do

           Set LRC = LRC XOR c

       end do

An 8-bit LRC such as this is equivalent to a cyclic redundancy check using the polynomial x⁸+1, but the independence of the bit streams is less clear when looked at that way.

An example of a protocol that uses such an XOR-based longitudinal redundancy check character is the IEC 62056-21 standard for electrical meter reading. /**

Java example for LRC calculation
/

public int calculateLrc (int[] finalPrepared){ int starter = 0;

for (int count = 0; count

References

Wikipedia, the free encyclopedia © 2001-2006 Wikipedia contributors (Disclaimer)
This article is licensed under the GNU Free Documentation License.
Last updated on Friday March 07, 2008 at 00:31:39 PST (GMT -0800)
View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation