Excavating
Patent
1997-03-03
1998-05-19
Elmore, Reba I.
Excavating
371 376, 371 377, 371 53, H03M 1300, G06F 1110
Patent
active
057545642
ABSTRACT:
Every word or bit received in a stream of bits may be checked to determine whether the end of a packet of bits has been located. The receiving system calculates a remainder polynomial r.sup.k (x)--a cyclic redundancy check, or CRC--for each word or bit and then evaluates whether r.sup.k (x) is equal to zero. If r.sup.k (x) is equal to zero, the end of a packet has been found. The remainder polynomial r.sup.k (x) is the remainder of a division of (i) a polynomial a.sup.k (x) defining the stream of bits ending in the bit or word for which r.sup.k (x) is calculated, by (ii) a defined generating polynomial g(x). The remainder polynomial r.sup.k (x) may be calculated without performing the polynomial division for each calculation by adding partial remainders that are functions of the r.sup.k (x) for the previous bit or word, or are available in a table. A shortened code may be used for the encoded data.
REFERENCES:
patent: 4498178 (1985-02-01), Ohhashi
patent: 4809273 (1989-02-01), Jackowski et al.
patent: 4890286 (1989-12-01), Hirose
patent: 5103451 (1992-04-01), Fossey
patent: 5121396 (1992-06-01), Irvin et al.
Elmore Reba I.
Harris Corporation
Moise Emmanuel L.
LandOfFree
Method of continuous calculation of cyclic redundancy check does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method of continuous calculation of cyclic redundancy check, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method of continuous calculation of cyclic redundancy check will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-1860746