Obtaining cyclic redundancy code

Details Obtaining cyclic redundancy code Obtaining cyclic redundancy code

2007-02-06

2007-02-06

Decady, Albert (Department: 2138)

Error detection/correction and fault detection/recovery

Pulse or data error handling

Digital data error correction

C714S781000, C714S808000

Reexamination Certificate

active

10076975

ABSTRACT:
Cyclic redundancy codes are obtained to verify the integrity of a message transmitted between a sender and a receiver. One method for obtaining a cyclic redundancy code includes separating the message into segments. Remainders are obtained for those segments based on a generator polynomial. The remainders for those segments are multiplied by a segment-constant to obtain segment-remainders for each segment. The segment-remainders are accumulated into an accumulated-remainder. The accumulated-remainder is moduloed by the generator polynomial to obtain a remainder for the accumulated-remainder. The remainder for the accumulated-remainder is the cyclic redundancy code for the message.

REFERENCES:
patent: 5619516 (1997-04-01), Li et al.
patent: 5951707 (1999-09-01), Christensen et al.
patent: 6052815 (2000-04-01), Zook
patent: 6438724 (2002-08-01), Cox et al.
patent: 6820232 (2004-11-01), Kim et al.
patent: 0 609 595 (1994-08-01), None
Roginsky et al., Efficient computation of packet CRC from partial CRCs with application to the □□Cells-In-Frames protocol, 1998, Computer Communications 2 1, pp. 654-661.
Glaise et al., Fast CRC Calculation, 1993, IEEE.
Feldmeier, Fast Software Implementation of Error Detection Codes, Dec. 1995, IEEE/ACM□□Transactions on Networking, vol. 3, No. 6.
Glaise et al.,Fast CRC Calculation, 1993, IEEE.
Feldmeier,Fast Software Implementation of Error Detection Codes, Dec. 1995, IEEE/ACM Transactions on Networking, vol. 3, No. 6.
Glaise,A two-step computation of cyclic redundancy code CRC-32 for ATM networks, Nov. 1997, IBM J. Res. Develop., vol. 41 No. 6.
Roginsky et al.,Efficient computation of packet CRC from partial CRCs with application to the Cells-In-Frames protocol, 1998, Computer Communications 21, pp. 654-661.
Joshi et al.,A New Parallel Algorithm for CRC Generation, 2000, IEEE, pp. 1764-1768.
Roginsky, A., et al., “Efficient computation of packet CRC from partial CRCs with application to the Cells-In-Frames protocol”,Computer Communications, 21(7):654-661 (1998).

Affiliated with

Also associated with

Rating

Obtaining cyclic redundancy code does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Obtaining cyclic redundancy code, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Obtaining cyclic redundancy code will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3831365