# US 6,732,317 B1 · Apparatus and method for applying multiple CRC generators to CRC calculation

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 6,732,317 B1
- Document ID: US6732317B1
- Status: Granted
- Kind: B1
- Application number: 09/695,619
- Filed: 2000-10-23
- Granted: 2004-05-04
- Earliest claimed: 2000-10-23
- Assignees: Sun Microsystems, Inc.
- Inventors: John M. Lo
- Web page: https://patentgrep.com/patent/US6732317B1

## CPC

- H03M 13/09: Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit
- H03M 13/098: {using single parity bit}
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)

## Abstract

An apparatus and method for generating a cyclic redundancy code with multiple cyclic redundancy code circuits are disclosed. High throughput data protocols can work more robustly if accompanied by high throughput error checking to verify the integrity of the communicated data. One approach of improving the performance of cyclic redundancy code generation hardware that can save money and development time is to combine multiple cyclic redundancy code circuits to perform the error checking. Data received is processed across the multiple cyclic redundancy code circuits. Future cyclic redundancy code circuits can also be combined according to this approach.

## Claims

### Claim 1

An apparatus for generating a cyclic redundancy code, said apparatus comprising:
a plurality of cyclic redundancy code circuits, each configured to generate and provide a respective cyclic redundancy code at an output in response to receiving in parallel, a first plurality of bits corresponding to a respective portion of a message at a first input and in response to receiving a second plurality of bits corresponding to an input cyclic redundancy code at a second input;
wherein said output of a given one of a portion of said plurality of cyclic redundancy code circuits is coupled to said first input of a next one of said plurality of cyclic redundancy code circuits; and
a selector coupled to selectively output one of said respective cyclic redundancy codes dependent upon which of said respective cyclic redundancy codes corresponds to a last respective portion of said message.

### Claim 2 (depends on 1)

The apparatus as recited in claim 1, wherein said output of a given one of another portion of said plurality of cyclic redundancy code circuits is coupled to said selector.

### Claim 3 (depends on 1)

The apparatus as recited in claim 1, wherein said input cyclic redundancy code of said given one of said portion of said plurality of cyclic redundancy code circuits corresponds to a plurality of bits of a cyclic redundancy code generator polynomial.

### Claim 4 (depends on 1)

The apparatus as recited in claim 1 further comprising state logic coupled between said selector output and said given one of said portion of said plurality of cyclic redundancy code circuits and configured to provide said a plurality of bits of said cyclic redundancy code generator polynomial.

### Claim 5 (depends on 4)

The apparatus as recited in claim 4, wherein said respective cyclic redundancy code corresponding to said last respective portion of said message is a cyclic redundancy code corresponding to all portions of said message.

### Claim 6 (depends on 5)

The apparatus as recited in claim 5, wherein said state logic is further configured to store said respective cyclic redundancy code corresponding to said last respective portion of said message.

### Claim 7 (depends on 1)

The apparatus as recited in claim 1, wherein said respective cyclic redundancy code includes a first number of bits that is based upon said message having a second number of bits that is larger than said first number of bits.

### Claim 8 (depends on 7)

The apparatus as recited in claim 7, wherein each respective portion of said message includes a third number of bits that is smaller than said first number of bits and said second number of bits.

### Claim 9

A system for generating a cyclic redundancy code, said system comprising:
a demultiplexer configured to receive, in parallel, a message including a first plurality of bits and to output, in parallel, a plurality of subsets of said first plurality of bits, wherein each of said plurality of subsets of bits corresponds to a respective portion of said message, and wherein said plurality of subsets of bits includes a last subset of bits corresponding to a last portion of said message; and
a cyclic redundancy code generator including:
a plurality of cyclic redundancy code circuits, each configured to generate and provide a respective cyclic redundancy code at an output in response to receiving a respective one of said plurality of subsets at a first input and in response to receiving, in parallel, a second plurality of bits corresponding to an input cyclic redundancy code at a second input;
wherein said output of a given one of a portion of said plurality of cyclic redundancy code circuits is coupled to said first input of a next one of said plurality of cyclic redundancy code circuits; and
a selector coupled to selectively output one of said respective cyclic redundancy codes dependent upon which of said respective cyclic redundancy codes corresponds to said last respective portion of said message.

### Claim 10 (depends on 9)

The system as recited in claim 9, wherein said output of a given one of another portion of said plurality of cyclic redundancy code circuits is coupled to said selector.

### Claim 11 (depends on 9)

The system as recited in claim 9, wherein said input cyclic redundancy code of said given one of said portion of said plurality of cyclic redundancy code circuits corresponds to a plurality of bits of a cyclic redundancy code generator polynomial.

### Claim 12 (depends on 9)

The system as recited in claim 9, wherein said cyclic redundancy code generator further comprising state logic coupled between said selector output and said given one of said portion of said plurality of cyclic redundancy code circuits and configured to provide said a plurality of bits of said cyclic redundancy code generator polynomial.

### Claim 13 (depends on 12)

The system as recited in claim 12, wherein said respective cyclic redundancy code corresponding to said last respective portion of said message is a cyclic redundancy code corresponding to all portions of said message.

### Claim 14 (depends on 13)

The system as recited in claim 13, wherein said state logic is further configured to store said respective cyclic redundancy code corresponding to said last respective portion of said message.

### Claim 15 (depends on 9)

The system as recited in claim 9, wherein said respective cyclic redundancy code includes a first number of bits that is based upon said message having a second number of bits that is larger than said first number of bits.

### Claim 16 (depends on 15)

The system as recited in claim 15, wherein each respective portion of said message includes a third number of bits that is smaller than said first number of bits and said second number of bits.

### Claim 17

A method for generating a cyclic redundancy code, said method comprising:
receiving, in parallel, a message including a first plurality of bits;
outputting, in parallel, a plurality of subsets of said first plurality of bits, wherein each of said plurality of subsets of bits corresponds to a respective portion of said message, and wherein said plurality of subsets of bits includes a last subset of bits corresponding to a last portion of said message;
a plurality of cyclic redundancy code circuits, each generating and providing a respective cyclic redundancy code at an output in response to receiving a respective one of said plurality of subsets at a first input and in response to receiving, in parallel, a second plurality of bits corresponding to an input cyclic redundancy code at a second input;
coupling said output of a given one of a portion of said plurality of cyclic redundancy code circuits to said first input of a next one of said plurality of cyclic redundancy code circuits;
selectively outputting one of said respective cyclic redundancy codes dependent upon which of said respective cyclic redundancy codes corresponds to said last respective portion of said message.

### Claim 18

A system for generating a cyclic redundancy code, said system comprising:
means for receiving, in parallel, a message including a first plurality of bits;
means for outputting, in parallel, a plurality of subsets of said first plurality of bits, wherein each of said plurality of subsets of bits corresponds to a respective portion of said message, and wherein said plurality of subsets of bits includes a last subset of bits corresponding to a last portion of said message;
a plurality of cyclic redundancy code circuits, each generating and providing a respective cyclic redundancy code at an output in response to receiving a respective one of said plurality of subsets at a first input and in response to receiving, in parallel, a second plurality of bits corresponding to an input cyclic redundancy code at a second input;
means for coupling said output of a given one of a portion of said plurality of cyclic redundancy code circuits to said first input of a next one of said plurality of cyclic redundancy code circuits;
means for selectively outputting one of said respective cyclic redundancy codes dependent upon which of said respective cyclic redundancy codes corresponds to said last respective portion of said message.
