US20040221221A1 - CRC operation unit and CRC operation method - Google Patents

CRC operation unit and CRC operation method Download PDF

Info

Publication number
US20040221221A1
US20040221221A1 US10861461 US86146104A US2004221221A1 US 20040221221 A1 US20040221221 A1 US 20040221221A1 US 10861461 US10861461 US 10861461 US 86146104 A US86146104 A US 86146104A US 2004221221 A1 US2004221221 A1 US 2004221221A1
Authority
US
Grant status
Application
Patent type
Prior art keywords
operation
data
generating polynomial
crc
means
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
US10861461
Inventor
Takao Yoshida
Minoru Okamoto
Masayuki Yamasaki
Kazuhiro Okabayashi
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Panasonic Corp
Original Assignee
Panasonic Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date

Links

Images

Classifications

    • HELECTRICITY
    • H03BASIC ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/09Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit
    • H03M13/091Parallel or block-wise CRC computation
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/38Concurrent instruction execution, e.g. pipeline, look ahead
    • G06F9/3877Concurrent instruction execution, e.g. pipeline, look ahead using a slave processor, e.g. coprocessor
    • G06F9/3879Concurrent instruction execution, e.g. pipeline, look ahead using a slave processor, e.g. coprocessor for non-native instruction execution, e.g. executing a command; for Java instruction set
    • HELECTRICITY
    • H03BASIC ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/65Purpose and implementation aspects
    • H03M13/6508Flexibility, adaptability, parametrability and configurability of the implementation
    • H03M13/6516Support of multiple code parameters, e.g. generalized Reed-Solomon decoder for a variety of generator polynomials or Galois fields
    • HELECTRICITY
    • H03BASIC ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/65Purpose and implementation aspects
    • H03M13/6569Implementation on processors, e.g. DSPs, or software implementations

Abstract

To enable high-speed CRC operation and flexible use of various generating polynomials without causing significant increase in circuit scale, the CRC operation unit uses circuits generally provided for a DSP and some additional circuits. The CRC operation unit includes: a generating polynomial supply section 11 having a first general register 12 for storing an arbitrary generating polynomial and a selector 13 for selectively outputting the generating polynomial or data of which all bits has a value of 0; an operation data supply section 21 having a memory 22, a shift register 23, a second general register 24, and a barrel shifter 25, for outputting operation data for CRC operation based on transmitting/receiving data; an operation section 31 for performing CRC operation using the generating polynomial output from the generating polynomial supply section 11 and the operation data output from the operation data supply section 21; and an operation instruction execution control section 41 for controlling the operations of the above sections.

Description

    BACKGROUND OF THE INVENTION
  • The present invention relates to a CRC operation unit and a CRC operation method for generating a cyclic redundancy check (CRC) code that is an error detection code for detection of an error occurring in transmitting/receiving data when the transmitting/receiving data is transmitted via a communication path or when the data is processed for transmission, or detecting a code error in transmitting/receiving data to which such an error detection code has been added. [0001]
  • CRC is an error-detecting system frequently used in digital communication, which detects an error in the following manner. On the transmitter side, transmitting data, which is considered as a high-order polynomial, is divided by a predetermined generating polynomial. The resultant remainder is added to the end of the transmitting data as a CRC code (encoding). On the receiver side, the transmitted data is divided by the same generating polynomial (decoding). If the remainder is zero, the transmitted data is determined as having no error. If the remainder is not zero, the transmitted data is determined as having an error (error detection). As the generating polynomial, the following are used in actual CRC, for example. [0002]
  • (1) CRC-[0003] 12
  • (2) CRC-[0004] 16
  • (3) CRC-CCITT [0005]
  • The encoding and error detection as described above, which are hereinafter called CRC operation, may be implemented by a CRC operation unit that executes CRC operation by hardware. The CRC operation unit uses a divider constructed of a combination of a shift register and an exclusive OR gate. In this type of unit, the generating polynomial is determined by how the shift register is connected with the exclusive OR gate. Therefore, this type of unit is not allowed to change the generating polynomial within one unit. That is, a different unit is required if a different generating polynomial is used. Moreover, it is necessary to provide units capable of using the same generating polynomial on the transmitter and receiver sides. [0006]
  • A unit that executes CRC operation by software is known as a CRC operation unit capable of flexibly using various generating polynomials. This type of unit can easily use various generating polynomials by only changing a program or data. This type of unit however has the following problems. CRC operation, which is normally executed by a processor in a communication terminal, tends to put a great load on the processor, resulting in lowering the processing capability of the communication terminal. Moreover, CRC operation by software is low in operation speed and thus is not suitable for high-speed communication. [0007]
  • Units capable of realizing both flexible use of generating polynomials and high-speed CRC operation have been disclosed. For example, Japanese Laid-Open Patent Publication No. 5-151007 discloses a unit constructed of a combination of a generating polynomial setting register, a shift register, and an exclusive OR gate. This unit performs CRC operation by hardware and thus enables high-speed processing. In addition, the unit can use various generating polynomials by changing the generating polynomial set in the generating polynomial setting register. [0008]
  • The CRC operation unit as described above uses exclusive circuits specialized for CRC operation. This disadvantageously increases the circuit scale of a communication unit and the like. In addition, while it is possible to use various generating polynomials having the same bit length as that of the generating polynomial setting register, no consideration is made for use of generating polynomials having different bit lengths. [0009]
  • SUMMARY OF THE INVENTION
  • An object of the present invention is providing a CRC operation unit capable of performing high-speed CRC operation and flexibly using various generating polynomials without causing significant increase in circuit scale. [0010]
  • The CRC operation unit of the present invention includes: generating polynomial supply means for holding data representing a generating polynomial and selectively outputting the data representing a generating polynomial or zero data of which all bits have a value of 0; operation data supply means for outputting operation data to be subjected to CRC operation; and arithmetic and logic operation means for performing exclusive OR operation between the data representing a generating polynomial or the zero data and the operation data, wherein the generating polynomial supply means selects the data representing a generating polynomial or the zero data depending on a value of the MSB of operation results from the arithmetic and logic operation means, and the operation data supply means outputs, as the operation data, data composed of: values of bits in lower order than the MSB of the operation results from the arithmetic and logic operation means as values of higher-order bits of the operation data; and a value of the MSB of unprocessed data to be subjected to CRC operation as a value of the LSB of the operation data. [0011]
  • The generating polynomial supply means may include: a first register for holding the data representing a generating polynomial; and a selector for selectively outputting the data representing a generating polynomial or the zero data, for example, and the operation data supply means may include: a second register for holding the operation results from the arithmetic and logic operation means; a shifter for shifting the operation results held in the second register leftward by one bit and outputting results; a memory for holding the unprocessed data to be subjected to CRC operation; and a shift register for holding part of the unprocessed data to be subjected to CRC operation transferred from the memory, outputting a value of the MSB of the held data, and shifting bits of the held data leftward one by one, for example. [0012]
  • With the above construction, the CRC operation unit can easily use various generating polynomials flexibly by changing the data representing a generating polynomial to be held in the generating polynomial supply means. In addition, the selection of the data representing a generating polynomial or the zero data to be input to the arithmetic and logic operation means and the generation of the operation data to be subjected to CRC operation are performed automatically, not by executing a program instruction. This realizes high-speed CRC operation. Moreover, since components provided for normal processors can be primarily used for the generating polynomial supply means, the operation data supply means, and the arithmetic and logic operation means, it is possible to minimize the circuit scale of the entire apparatus including the CRC operation unit. [0013]
  • The CRC operation unit may further include operation instruction execution control means, wherein the operation instruction execution control means controls, under a predetermined operation instruction, output of the data representing a generating polynomial or the zero data by the generating polynomial supply means, output of the operation data by the operation data supply means, and execution of the exclusive OR operation by the arithmetic and logic operation means. [0014]
  • The operation instruction execution control means may control, under a predetermined operation instruction, operations of the generating polynomial supply means, the operation data supply means, and the arithmetic and logic operation means for one-time execution of the exclusive OR operation by the arithmetic and logic operation means. [0015]
  • Alternatively, the operation instruction execution control means may control, under a predetermined operation instruction, operations of the generating polynomial supply means, the operation data supply means, and the arithmetic and logic operation means for execution of the exclusive OR operation for all the unprocessed data to be subjected to CRC operation by the arithmetic and logic operation means. [0016]
  • Otherwise, the operation instruction execution control means may control, under a predetermined operation instruction, operations of the generating polynomial supply means, the operation data supply means, and the arithmetic and logic operation means for execution of the exclusive OR operation for values of all bits held in the shift register by the arithmetic and logic operation means. [0017]
  • With above constructions, it is possible to enhance the flexibility of the CRC processing by increasing the degree of freedom in the combination of operation instructions or enhance the speed of the CRC processing with a small number of operation instructions. [0018]
  • After completion of the exclusive OR operation for all of the unprocessed data to be subjected to CRC operation by the arithmetic and logic operation means, the values held in the second register may be stored in the memory. [0019]
  • Alternatively, after completion of the exclusive OR operation for all of the unprocessed data to be subjected to CRC operation by the arithmetic and logic operation means, whether or not the unprocessed data to be subjected to CRC operation has an error may be determined by examining whether or not the values held in the second register are 0. [0020]
  • The above constructions facilitate CRC encoding and data error detection. [0021]
  • When the number of bits of the data representing a generating polynomial is smaller than the number of bits allowed to be held by the generating polynomial supply means, the generating polynomial supply means may left-justify the data representing a generating polynomial and give 0 to the remaining lower-order bit(s). [0022]
  • The above construction enhances the flexibility of use of various generating polynomials in the number of bits, in addition to the type. [0023]
  • The CRC operation unit of another embodiment of the present invention includes: generating polynomial holding means for holding data representing a generating polynomial; and CRC operation means for performing CRC operation based on the data representing a generating polynomial and data to be subjected to CRC operation, wherein, when the number of bits of the data representing a generating polynomial is smaller than the number of bits allowed to be held by the generating polynomial holding means, the generating polynomial holding means left-justifies the data representing a generating polynomial and gives 0 to the remaining lower-order bit(s). [0024]
  • The above construction enhances the flexibility of use of various generating polynomials in the number of bits, in addition to the type, even in the case of using exclusive circuits specialized for CRC operation.[0025]
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • FIG. 1 is a block diagram of a CRC operation unit of EMBODIMENT 1 of the present invention. [0026]
  • FIG. 2 is a flowchart of the operation of the CRC operation unit of EMBODIMENT 1. [0027]
  • FIG. 3 is a view for description of an example of data separation in the CRC operation unit of EMBODIMENT 1. [0028]
  • FIG. 4 is a view for description of an example of encoding operation of the CRC operation unit of EMBODIMENT 1. [0029]
  • FIG. 5 is a view for description of an example of decoding operation of the CRC operation unit of EMBODIMENT 1. [0030]
  • FIG. 6 is a block diagram of a CRC operation unit of EMBODIMENT [0031] 2 of the present invention.
  • DESCRIPTION OF THE PREFERRED EMBODIMENTS
  • Embodiment 1 [0032]
  • As EMBODIMENT 1 of the present invention, an example of a CRC operation unit incorporated in a processor such as a digital signal processor (DSP) will be described with reference to FIG. 1. This unit is constructed of circuits generally provided for the DSP and some additional circuits. [0033]
  • Referring to FIG. 1, the CRC operation unit includes: a generating polynomial supply section [0034] 11 (generating polynomial supply means) for holding and outputting data representing an arbitrary generating polynomial; an operation data supply section 21 (operation data supply means) for outputting operation data for CRC operation based on transmitting/receiving data; an operation section 31 (arithmetic and logic means) for performing CRC operation using the generating polynomial output from the generating polynomial supply section 11 and the operation data output from the operation data supply section 21; and an operation instruction execution control section 41 (operation instruction execution control means) for controlling the operations of the above sections.
  • The generating polynomial supply section [0035] 11 includes a first general register 12 that stores a generating polynomial and a selector 13. The selector 13 selects the data stored in the first general register 12 (that is, the generating polynomial) or data of which all bits have a value of 0 (“0”), and outputs the selected value. More specifically, the selector 13 selects “0” when the value of the most significant bit (MSB) in a second general register 24 to be described later is 0, or selects the generating polynomial stored in the first general register 12 when the value of the MSB is 1. The selector 13 may actually be constructed of a column of AND circuits that perform AND operation between the respective bits in the first general register 12 and the MSB value in the second general register 24, for example.
  • The operation data supply section [0036] 21 includes a memory 22, a shift register 23, the second general register 24, and a barrel shifter 25.
  • The memory [0037] 22 stores transmitting/receiving data.
  • The shift register [0038] 23 outputs the value of the MSB of the data held therein to the operation section 31 as the value of the LSB of the operation data every cycle of CRC operation and then shifts the held data leftward by one bit. Once all the bits of the held data have been output, subsequent data is transferred to the shift register 23 from the memory 22.
  • The second general register [0039] 24 holds data transferred from the memory 22 as initial values at the start of CRC operation, and thereafter holds data of the operation results output from the operation section 31 every cycle of CRC operation.
  • The barrel shifter [0040] 25 shifts the data held in the second general register 24 leftward by one bit, and then outputs the values of bits in higher order than the LSB of the resultant data to the operation section 31 as the values of bits in higher order than the LSB of the operation data. Note that the value of the MSB in the shift register 23 may be input to the barrel shifter 25, instead of being directly input to the operation section 31 as described above, to be used as the value of the LSB of the operation data during the leftward shifting described above.
  • The operation section [0041] 31 includes an arithmetic and logic unit 32 to execute exclusive OR operation between the generating polynomial or “0” output from the generating polynomial supply section 11 and the operation data output from the operation data supply section 21. The data of the operation results is stored in the second general register 24 as described above.
  • The respective sections described above have a bit width of M bits, for example. [0042]
  • The operation instruction execution control section [0043] 41 controls the operations of components constituting a DSP based on operation instructions provided as a program, and also controls principally the operations of the above sections based on operation instructions relating to CRC operation.
  • As the first general register [0044] 12, the memory 22, the second general register 24, the barrel shifter 25, and the arithmetic and logic unit 32, those normally provided for the processor may be used. In other words, the components specialized for CRC operation are principally the selector 13, the shift register 23, signal paths provided between the sections and the like, and the part of the operation instruction execution control section 41 that has a control function for CRC operation. Only by adding these components to a general processor, the CRC operation unit can be constructed. It is not that the entire the CRC operation unit is tailored for CRC operation. Therefore, increase in the circuit scale of the entire DSP and the like can be minimized.
  • The CRC operation unit constructed as described above performs CRC operation under operation instructions given to the operation instruction execution control section [0045] 41. The operation will be described with reference to the flowchart shown in FIG. 2. It should be noted that the following process steps are given for convenience of description of the operation and that the respective steps do not necessarily correspond to instruction cycles and machine cycles one on one.
  • Step S[0046] 1: A generating polynomial is set in the first general register 12 under a transfer instruction. The bit length N of the set generating polynomial may be smaller than the bit width M of the first general register 12 (N<M). If this is the case, the generating polynomial set in the first general register 12 is left-justified under a leftward shift instruction and the like and the remaining lower-order bit or bits are filled with 0.
  • Step S[0047] 2: Under the transfer instruction, also, data of first M bits (initial data) of the transmitting/receiving data stored in the memory 22 are set in the second general register 24.
  • Step S[0048] 3: Also, data of next M bits (input data 1 to X) of the transmitting/receiving data are set to the shift register 23 under the transfer instruction.
  • Step S[0049] 4: Next, M cycles of CRC operation for the M bits of the transmitting/receiving data held in the shift register 23 are performed. More specifically, the following operation is performed.
  • The arithmetic and logic unit [0050] 32 performs exclusive OR operation between operation data of total M bits and the Mbit generating polynomial or zero data output from the selector 13. The M-bit operation data is composed of values of higher-order M-1 bits of the data output from the barrel shifter 25, which has shifted the M-bit data held in the second general register 24 as described above, and a value of the MSB output from the shift register 23. The M-bit generating polynomial may be composed of a string of N bits and 0 or 0's. The zero data output from the selector 13 is data of which all bits have a value of 0. The data of the operation results is stored in the second general register 24. In this way, one cycle of CRC operation corresponding to one bit of the transmitting/receiving data is performed. The data held in the shift register 23 is shifted leftward by one bit, and 0 is given to the LSB. This series of operation is repeated M times under a combination of a repeat instruction (which instructs to repeat the subsequent instruction for a given number of times) and a CRC operation instruction. This enables execution of one cycle of CRC operation (and shift operation of the shift register 23) in one machine cycle, for example. The operation performed under a combination of a repeat instruction and a CRC instruction described above may otherwise be programmed to be realized under a single instruction. It is also possible to set value M for a general register and decrement the value every cycle of CRC operation, to repeat the CRC operation until the value becomes zero, although the processing speed decreases.
  • Step S[0051] 5: Once M cycles of CRC operation have completed, whether or not the remaining transmitting/receiving data held in the memory 22 is the final data (whether or not the remaining bits are equal to or less than M) is determined. This determination may actually be done by determining whether or not the value of a pointer not shown indicating the address of the portion of the transmitting/receiving data in the memory 22 to be transferred to the shift register 23 indicates the address of the final data, for example. Alternatively, the determination may be done by counting (counting down) the number of times of M-cycle CRC operation performed, and determining whether or not the M-cycle CRC operation has been repeated by the number of times equal to a quotient X, which is obtained by subtracting M from the total number of bits K of the transmitting/receiving data and integer-dividing the resultant value by M, represented by:
  • X=int((K−M)/M).
  • The count of the number of times of CRC operation and the determination described above may be realized under program instructions, or may be performed automatically by hardware. Note that M is subtracted from K because the first M bits are set in the second general register [0052] 24 as the initial data. If the remaining data in the memory 22 is not the final data, the steps S3 to S5 are repeated.
  • Step S[0053] 6: If the transmitting/receiving data remaining in the memory 22 is determined to be the final data, the final data is transferred to the shift register 23. The number of bits of the final data is equal to a remainder L obtained by subtracting M from the total number of bits K of the transmitting/receiving data and dividing the resultant value by M as shown in FIG. 3, represented by
  • L=(K−M)mod M.
  • Since the remainder L is smaller than M, the final data set in the shift register [0054] 23 is left-justified and the remaining lower-order bit or bits are filled with 0.
  • Step S[0055] 7: Finally, M+L cycles of CRC operation are performed in a manner as described in step S4. Thus, a total of M×X+M+L K cycles of the CRC operation have been performed. It should be noted that, as the number of cycles to be performed at the final CRC operation, the bit width M of the arithmetic and logic unit 32 is added to the remainder L. This is because the operation is repeated until the last bit of the transmitting/receiving data is shifted to the bit position higher by one than the MSB of the arithmetic and logic unit 32. This is equivalent to multiplying the transmitting/receiving data by the N-th power of 2 and repeating the CRC operation until reaching the LSB of the data. The values held in the second general register 24 when M+L cycles (K cycles in total) of CRC operation have completed in step S7 are the CRC operation results for the entire transmitting/receiving data. In the case of transmission, the values held in the second general register 24 are temporarily stored in the memory 22 and then added to the transmitting data, to provide CRC-encoded transmitting data. In the case of reception, it is examined whether or not the values held in the second general register 24 are 0. As a concrete example, exclusive OR operation may be performed between the values in the second general register 24 and zero data of which all bits have a value of 0 and whether or not a zero flag register not shown has been set may be examined. By this examination, whether or not the received data has an error can be determined.
  • The above operation will be described using a specific data example with reference to FIGS. 4 and 5. [0056]
  • First, an example of encoding will be described. As shown in FIG. 4, assume that the transmitting data before encoding is “100000110101” (binary notation, the number of bits K=12), and the generating polynomial is “10101” (binary notation, the number of bits N=5). In this case, the number of times X of repetition of 5-cycle CRC operation is [0057]
  • X=int((K−M)/M)=int((12−5)/5)=1,
  • the number of bits L of the final data is [0058]
  • L=(K−M)mod M=(12−5)mod 5=2,
  • and the number of cycles of the final CRC operation is [0059]
  • M+L=5+2=7.
  • (1) At the start of CRC operation, the generating polynomial “10101” is set in the first general register [0060] 12. Also, the values of the first five bits “10000” of the transmitting data are set in the second general register 24, and the values of the subsequent five bits “01101” are set in the shift register 23.
  • (2) In the first CRC operation cycle [0061] 1, the value of the MSB in the second general register 24 is “1”. The selector 13 therefore selects the generating polynomial “10101”. The arithmetic and logic unit 32 then performs exclusive OR operation between the generating polynomial “10101” and the combination of the values “0000” of the four bits in lower order than the MSB in the second general register 24 (properly, the four bits in higher order than the LSB of data obtained by the leftward shift by the barrel shifter 25) and the value “0” of the MSB in the shift register 23. The operation results are “10101”, which are stored in the second general register 24.
  • (3) The values held in the shift register [0062] 23 are shifted leftward by one bit. Although the value given to the LSB is 0 in the example shown in FIG. 4, it is not necessarily 0. (On the contrary, in the final CRC operation, 0 must be given to the LSB to meet the multiplication of the transmitting data by the n-th power of 2.)
  • (4) The above series of operation is repeated, and when five cycles of CRC operation are completed, the 2-bit final data “01” stored in the memory [0063] 22 is transferred to the shift register 23 and set therein in the left-justified manner with the remaining lower-order bit or bits filled with 0. In the final CRC operation, steps as described in (2) and (3) above are repeated for seven cycles.
  • (5) The values “00010” held in the second general register [0064] 24 at the completion of the final CRC operation are the CRC operation results. The CRC operation results are added to the end of the original transmitting data as shown in FIG. 5, to obtain the 17-bit encoded data “10000011010100010”.
  • The operation of decoding the data encoded as described above is as shown in FIG. 5, which is substantially the same as that described in (1) to (4) above for the encoding. If the CRC operation results of this decoding are “00000” as shown in FIG. 5, it is determined that the data has no error. [0065]
  • In the illustrated example, the bit length of the transmitted data including the error detection code as described above is 17 bits. Therefore, the number of times X of repetition of 5-cycle CRC operation is [0066]
  • X=int((K−M)/M)=int((17−5)/5)=2,
  • the number of bits L of the final data is [0067]
  • L=(K−M)mod M=(17−5)mod 5=2,
  • and the number of cycles of the final CRC operation is [0068]
  • M+L=5+2=7.
  • In decoding, however, it should be noted that if the remainder is 0 after the final CRC operation is repeated for two cycles corresponding to the number of bits L of the final data, it remains to be 0 in the subsequent cycles of CRC operation. If the remainder is not 0, it will never be 0 in the subsequent cycles. Thus, the same operation results are obtained even if the operation is discontinued at the end of two cycles. However, seven cycles of the final CRC operation may be completed as described above, to simplify the construction by performing the same operation on the encoding and decoding sides. [0069]
  • In the above example, the bit widths of the respective components were the same. Alternatively, for example, the first general register [0070] 12 and the arithmetic and logic unit 32 may have a different bit width from the other components, or the arithmetic and logic unit 32 may have a different bit width from the first general register 12 and the like.
  • In the above example, the transmitting/receiving data was stored in the memory [0071] 22. When the data is received as serial data, for example, the shift register 23 may be omitted, and the received data may be directly supplied to the second general register 24 and the arithmetic and logic unit 32 from a buffer (first-in, first-out (FIFO)).
  • In the CRC operation unit described above, the barrel shifter [0072] 25 only serves to shift the input data by one bit. Therefore, a shift register may be used instead if the cycle time has an allowance.
  • If an exclusive register specialized for CRC operation is provided in place of the second general register [0073] 24, the barrel shifter 25 may be omitted by shifting the data input/output by one bit.
  • Memories may be used in place of the first general register [0074] 12 and the second general register 24.
  • The switching control of the selector [0075] 13 was done based on the value of the MSB in the second general register 24. Alternatively, for example, a flag register may be provided to hold the value of the MSB of the operation results of the exclusive OR operation performed by the arithmetic and logic unit 32, and the switching may be controlled based on the value held in the flag register. In this case, in order to set the first flag register value for the first cycle of CRC operation, the data may be input to the arithmetic and logic unit 32 without being shifted leftward in the barrel shifter 25 (or by bypassing the barrel shifter 25).
  • It is also possible to execute the series of CRC operation as described above for all the bits of the transmitting/receiving data by a micro-program incorporated in the operation instruction execution control section [0076] 41. The micro-program can be programmed to support the CRC operation with a single or a few program instruction(s).
  • Embodiment 2 [0077]
  • As EMBODIMENT 2, described is an example of a CRC operation unit constructed by hardware including a generating polynomial setting register and capable of using a generating polynomial having an arbitrary bit length. [0078]
  • Referring to FIG. 6, the CRC operation unit of this embodiment includes a CRC operation section [0079] 51 and a generating polynomial supply section 61.
  • The CRC operation section [0080] 51 (CRC operation means) includes M-stage (corresponding to M bits) D-type flipflops 52 connected to one another via exclusive OR gates 53. The CRC operation section 51 receives bits of operation data one by one for CRC operation for each bit. The quotients as the operation results are sequentially output from the last-stage D-type flipflop 52, while the remainders are output from the respective D-type flipflops 52 upon completion of CRC operation at the respective stages.
  • The generating polynomial supply section [0081] 61 includes: an M-bit wide generating polynomial setting register 62 (generating polynomial holding means) that stores a generating polynomial; a selector 63; and a left-justifying section 64. The selector 63 outputs the values stored in the generating polynomial setting register 62 (that is, the generating polynomial) or data of which all bits have a value of 0 (“0”) depending on the output from the last-stage D-type flipflop 52, as in the selector 13 of EMBODIMENT 1. The left-justifying section 64 left-justifies the generating polynomial and fills the remaining lower-order bit or bits with 0 when the number of bits N of the generating polynomial used is smaller than the bit width M of the generating polynomial setting register 62, before storing the generating polynomial in the generating polynomial setting register 62. Specifically, the generating polynomial may be shifted leftward by use of a shift register or under a shift instruction in a program. In place of providing the left-justifying section 64, a previously left-justified generating polynomial may be input to the section.
  • With the above construction, when the number of bits N of the generating polynomial is smaller than the bit width M of the generating polynomial setting register [0082] 62, the bit or bits in lower order than the N higher-order bits in the register 62 are 0. Therefore, for each of these lower-order bits, the selector 63 outputs 0 irrespective of the output from the last-stage D-type flipflop 52. As a result, the exclusive OR gate 53 corresponding to each of the lower-order bits outputs the same value as that output from the preceding stage D-type flipflop 52. With this construction, therefore, it is possible to provide the same results as those obtained when the number of bits of the generating polynomial, the bit width of the generating polynomial setting register 62, and the number of stages of the D-type flipflops 52 are the same. This enhances the flexibility of use of various generating polynomials in the number of bits, in addition to the type.
  • As described above, according to the present invention, components provided for normal processors and the like can be used. This enables high-speed CRC operation and flexible use of various generating polynomials without causing significant increase in circuit scale. [0083]
  • While the present invention has been described in a preferred embodiment, it will be apparent to those skilled in the art that the disclosed invention may be modified in numerous ways and may assume many embodiments other than that specifically set out and described above. Accordingly, it is intended by the appended claims to cover all modifications of the invention that fall within the true spirit and scope of the invention. [0084]

Claims (11)

    What is claimed is:
  1. 1. A CRC operation unit comprising:
    generating polynomial supply means for holding data representing a generating polynomial and selectively outputting the data representing a generating polynomial or zero data of which all bits have a value of 0;
    operation data supply means for outputting operation data to be subjected to CRC operation; and
    arithmetic and logic operation means for performing exclusive OR operation between the data representing a generating polynomial or the zero data and the operation data,
    wherein the generating polynomial supply means selects the data representing a generating polynomial or the zero data depending on a value of the MSB of operation results from the arithmetic and logic operation means, and
    the operation data supply means outputs, as the operation data, data composed of: values of bits in lower order than the MSB of the operation results from the arithmetic and logic operation means as values of higher-order bits of the operation data; and a value of the MSB of unprocessed data to be subjected to CRC operation as a value of the LSB of the operation data.
  2. 2. The CRC operation unit of claim 1, wherein the generating polynomial supply means comprises:
    a first register for holding the data representing a generating polynomial; and
    a selector for selectively outputting the data representing a generating polynomial or the zero data,
    the operation data supply means comprises:
    a second register for holding the operation results from the arithmetic and logic operation means;
    a shifter for shifting the operation results held in the second register leftward by one bit and outputting results;
    a memory for holding the unprocessed data to be subjected to CRC operation; and
    a shift register for holding part of the unprocessed data to be subjected to CRC operation transferred from the memory, outputting a value of the MSB of the held data, and shifting bits of the held data leftward one by one.
  3. 3. The CRC operation unit of claim 1, further comprising operation instruction execution control means, wherein the operation instruction execution control means controls, under a predetermined operation instruction, output of the data representing a generating polynomial or the zero data by the generating polynomial supply means, output of the operation data by the operation data supply means, and execution of the exclusive OR operation by the arithmetic and logic operation means.
  4. 4. The CRC operation unit of claim 3, wherein the operation instruction execution control means controls, under a predetermined operation instruction, operations of the generating polynomial supply means, the operation data supply means, and the arithmetic and logic operation means for onetime execution of the exclusive OR operation by the arithmetic and logic operation means.
  5. 5. The CRC operation unit of claim 3, wherein the operation instruction execution control means controls, under a predetermined operation instruction, operations of the generating polynomial supply means, the operation data supply means, and the arithmetic and logic operation means for execution of the exclusive OR operation for all the unprocessed data to be subjected to CRC operation by the arithmetic and logic operation means.
  6. 6. The CRC operation unit of claim 2, further comprising operation instruction execution control means, wherein the operation instruction execution control means controls, under a predetermined operation instruction, operations of the generating polynomial supply means, the operation data supply means, and the arithmetic and logic operation means for execution of the exclusive OR operation for values of all bits held in the shift register by the arithmetic and logic operation means.
  7. 7. The CRC operation unit of claim 2, wherein after completion of the exclusive OR operation for all of the unprocessed data to be subjected to CRC operation by the arithmetic and logic operation means, the values held in the second register are stored in the memory.
  8. 8. The CRC operation unit of claim 2, wherein after completion of the exclusive OR operation for all of the unprocessed data to be subjected to CRC operation by the arithmetic and logic operation means, whether or not the unprocessed data to be subjected to CRC operation has an error is determined by examining whether or not the values held in the second register are 0.
  9. 9. The CRC operation unit of claim 1, wherein, when the number of bits of the data representing a generating polynomial is smaller than the number of bits allowed to be held by the generating polynomial supply means, the generating polynomial supply means left-justifies the data representing a generating polynomial and gives 0 to the remaining lower-order bit(s).
  10. 10. A CRC operation unit comprising:
    generating polynomial holding means for holding data representing a generating polynomial; and
    CRC operation means for performing CRC operation based on the data representing a generating polynomial and data to be subjected to CRC operation,
    Wherein, when the number of bits of the data representing a generating polynomial is smaller than the number of bits allowed to be held by the generating polynomial holding means, the generating polynomial holding means left-justifies the data representing a generating polynomial and gives 0 to the remaining lower-order bit(s).
  11. 11. A CRC operation method comprising the steps of:
    selectively outputting data representing a generating polynomial or zero data of which all bits have a value of 0;
    outputting operation data to be subjected to CRC operation; and
    performing exclusive OR operation between the data representing a generating polynomial or the zero data and the operation data,
    wherein the step of selectively outputting data representing a generating polynomial selects the data representing a generating polynomial or the zero data depending on a value of the MSB of operation results obtained from a preceding step of performing exclusive OR operation, and
    the step of outputting operation data outputs, as the operation data, data composed of: values of bits in lower order than the MSB of the operation results obtained from the step of performing exclusive OR operation as values of higher-order bits of the operation data; and a value of the MSB of unprocessed data to be subjected to CRC operation as a value of the LSB of the operation data.
US10861461 2000-04-14 2004-06-07 CRC operation unit and CRC operation method Abandoned US20040221221A1 (en)

Priority Applications (4)

Application Number Priority Date Filing Date Title
JP2000113734 2000-04-14
JP2000-113734 2000-04-14
US09833787 US6754870B2 (en) 2000-04-14 2001-04-13 CRC operation unit and CRC operation method
US10861461 US20040221221A1 (en) 2000-04-14 2004-06-07 CRC operation unit and CRC operation method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US10861461 US20040221221A1 (en) 2000-04-14 2004-06-07 CRC operation unit and CRC operation method

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
US09833787 Division US6754870B2 (en) 2000-04-14 2001-04-13 CRC operation unit and CRC operation method

Publications (1)

Publication Number Publication Date
US20040221221A1 true true US20040221221A1 (en) 2004-11-04

Family

ID=18625651

Family Applications (2)

Application Number Title Priority Date Filing Date
US09833787 Expired - Fee Related US6754870B2 (en) 2000-04-14 2001-04-13 CRC operation unit and CRC operation method
US10861461 Abandoned US20040221221A1 (en) 2000-04-14 2004-06-07 CRC operation unit and CRC operation method

Family Applications Before (1)

Application Number Title Priority Date Filing Date
US09833787 Expired - Fee Related US6754870B2 (en) 2000-04-14 2001-04-13 CRC operation unit and CRC operation method

Country Status (2)

Country Link
US (2) US6754870B2 (en)
EP (1) EP1148650A1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050108617A1 (en) * 2003-11-13 2005-05-19 Lappin James B.Jr. Method and apparatus for managing network traffic using cyclical redundancy check hash functions

Families Citing this family (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6836869B1 (en) * 2001-02-02 2004-12-28 Cradle Technologies, Inc. Combined cyclic redundancy check (CRC) and Reed-Solomon (RS) error checking unit
US7216285B2 (en) 2001-11-09 2007-05-08 Marvell International Ltd. System and method for generating cyclic redundancy check
US7290196B1 (en) * 2003-03-21 2007-10-30 Cypress Semiconductor Corporation Cyclical redundancy check using nullifiers
US7171604B2 (en) * 2003-12-30 2007-01-30 Intel Corporation Method and apparatus for calculating cyclic redundancy check (CRC) on data using a programmable CRC engine
US7434150B1 (en) * 2004-03-03 2008-10-07 Marvell Israel (M.I.S.L.) Ltd. Methods, circuits, architectures, software and systems for determining a data transmission error and/or checking or confirming such error determinations
US7360142B1 (en) 2004-03-03 2008-04-15 Marvell Semiconductor Israel Ltd. Methods, architectures, circuits, software and systems for CRC determination
JP2006060663A (en) * 2004-08-23 2006-03-02 Oki Electric Ind Co Ltd Cyclic code circuit
US7398452B2 (en) * 2004-12-16 2008-07-08 Broadcom Corporation Method and system for determining a signal quality metric in event of a CRC false positive
US7512864B2 (en) 2005-09-30 2009-03-31 Josef Zeevi System and method of accessing non-volatile computer memory
JP5298621B2 (en) * 2007-12-21 2013-09-25 ソニー株式会社 Transmitting apparatus and method, receiving apparatus and method
US8352835B2 (en) * 2009-06-10 2013-01-08 International Business Machines Corporation Data verification using checksum sidefile
US8417961B2 (en) * 2010-03-16 2013-04-09 Oracle International Corporation Apparatus and method for implementing instruction support for performing a cyclic redundancy check (CRC)
US8468423B2 (en) 2011-09-01 2013-06-18 International Business Machines Corporation Data verification using checksum sidefile
CN104133736A (en) * 2014-07-29 2014-11-05 江苏宏云技术有限公司 Method for designing vector CRC commands

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4720830A (en) * 1985-12-02 1988-01-19 Advanced Micro Devices, Inc. CRC calculation apparatus having reduced output bus size
US5325372A (en) * 1990-08-07 1994-06-28 National Semiconductor Corporation Implementation of the HDLC CRC calculation
US5390196A (en) * 1992-11-12 1995-02-14 Bull Hn Information Systems Inc. Byte-wise determination of a checksum from a CRC-32 polynomial
US5768291A (en) * 1994-12-29 1998-06-16 Motorola, Inc. Method and apparatus for error mitigating a received communication signal
US5870413A (en) * 1996-09-25 1999-02-09 Mitsubishi Denki Kabushiki Kaisha CRC code generation circuit for generating a CRC code and a code error detection circuit for detecting a code error in a CRC code word
US5878057A (en) * 1995-10-06 1999-03-02 Tektronix, Inc. Highly parallel cyclic redundancy code generator
US5898712A (en) * 1996-09-25 1999-04-27 Mitsubishi Denki Kabushiki Kaisha CRC code generation circuit, code error detection circuit, and CRC circuit having functions of both the CRC code generation circuit and the code error detection circuit
US6192498B1 (en) * 1997-10-01 2001-02-20 Globepan, Inc. System and method for generating error checking data in a communications system

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH05151007A (en) * 1991-11-28 1993-06-18 Nintendo Co Ltd Crc arithmetic unit
JP3252029B2 (en) 1993-08-04 2002-01-28 松下電器産業株式会社 Coding apparatus and coding method
JPH10320221A (en) 1997-05-16 1998-12-04 Hitachi Ltd Processor
GB9803117D0 (en) * 1998-02-13 1998-04-08 Sgs Thomson Microelectronics Cyclic redundancy check in a computer system
JP2000081989A (en) 1998-09-07 2000-03-21 Hitachi Ltd Processor and cyclic encoding processing method using the processor
JP3607116B2 (en) 1999-04-28 2005-01-05 松下電器産業株式会社 Processor
JP2001036414A (en) 1999-07-21 2001-02-09 Nec Corp Crc code generation circuit and crc error detection circuit

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4720830A (en) * 1985-12-02 1988-01-19 Advanced Micro Devices, Inc. CRC calculation apparatus having reduced output bus size
US5325372A (en) * 1990-08-07 1994-06-28 National Semiconductor Corporation Implementation of the HDLC CRC calculation
US5390196A (en) * 1992-11-12 1995-02-14 Bull Hn Information Systems Inc. Byte-wise determination of a checksum from a CRC-32 polynomial
US5768291A (en) * 1994-12-29 1998-06-16 Motorola, Inc. Method and apparatus for error mitigating a received communication signal
US5878057A (en) * 1995-10-06 1999-03-02 Tektronix, Inc. Highly parallel cyclic redundancy code generator
US5870413A (en) * 1996-09-25 1999-02-09 Mitsubishi Denki Kabushiki Kaisha CRC code generation circuit for generating a CRC code and a code error detection circuit for detecting a code error in a CRC code word
US5898712A (en) * 1996-09-25 1999-04-27 Mitsubishi Denki Kabushiki Kaisha CRC code generation circuit, code error detection circuit, and CRC circuit having functions of both the CRC code generation circuit and the code error detection circuit
US6192498B1 (en) * 1997-10-01 2001-02-20 Globepan, Inc. System and method for generating error checking data in a communications system

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050108617A1 (en) * 2003-11-13 2005-05-19 Lappin James B.Jr. Method and apparatus for managing network traffic using cyclical redundancy check hash functions
WO2005048006A2 (en) * 2003-11-13 2005-05-26 Nokia Inc. Method and apparatus for managing network traffic using cyclical redundancy check hash functions
US7047453B2 (en) * 2003-11-13 2006-05-16 Nokia, Inc. Method and apparatus for managing network traffic using cyclical redundancy check hash functions
WO2005048006A3 (en) * 2003-11-13 2006-08-03 Nokia Inc Method and apparatus for managing network traffic using cyclical redundancy check hash functions

Also Published As

Publication number Publication date Type
EP1148650A1 (en) 2001-10-24 application
US6754870B2 (en) 2004-06-22 grant
US20020002692A1 (en) 2002-01-03 application

Similar Documents

Publication Publication Date Title
US4723243A (en) CRC calculation machine with variable bit boundary
US4649541A (en) Reed-Solomon decoder
US6640327B1 (en) Fast BCH error detection and correction using generator polynomial permutation
US4606027A (en) Error correction apparatus using a Viterbi decoder
US5440570A (en) Real-time binary BCH decoder
US5715470A (en) Arithmetic apparatus for carrying out viterbi decoding at a high speed
US6477680B2 (en) Area-efficient convolutional decoder
US6029267A (en) Single-cycle, soft decision, compare-select operation using dual-add processor
US6009451A (en) Method for generating barrel shifter result flags directly from input data
US7197686B2 (en) Reconfigurable bit-manipulation node
US20050010630A1 (en) Method and apparatus for determining a remainder in a polynomial ring
US7363574B1 (en) Method and system for parallel CRC calculation
US4937828A (en) High speed parallel CRC device for concatenated data frames
US20040091106A1 (en) Scrambling of data streams having arbitrary data path widths
US6757865B1 (en) Turbo-code error correcting decoder, turbo-code error correction decoding method, turbo-code decoding apparatus, and turbo-code decoding system
US7185260B2 (en) Method and apparatus for implementing a data processor adapted for turbo decoding
US4617641A (en) Operation unit for floating point data having a variable length exponent part
US20050154960A1 (en) Method and apparatus for calculating CRC on data using a programmable CRC engine
US5742621A (en) Method for implementing an add-compare-select butterfly operation in a data processing system and instruction therefor
US5440504A (en) Arithmetic apparatus for digital signal processor
US5970097A (en) Arithmetic apparatus for use in Viterbi decoding
US5951677A (en) Efficient hardware implementation of euclidean array processing in reed-solomon decoding
US5954836A (en) Method and apparatus for pipelined encoding
US6175945B1 (en) Reed-Solomon decoder
US20040078410A1 (en) Galois field multiplier array for use within a finite field arithmetic unit