Abstract:
A description of techniques of determining a modular remainder with respect to a polynomial of a message comprised of a series of segments. An implementation can include repeatedly accessing a strict subset of the segments and transforming the strict subset of segments to into a smaller set of segments that are equivalent to the strict subset of the segments with respect to the modular remainder. The implementation can also include determining the modular remainder based on a set of segments output by the repeatedly accessing and transforming and storing the determined modular remainder.

Description:
BACKGROUND 
       [0001]    A variety of computer applications operate on messages to create a message residue. The residue can represent message contents much more compactly. Among other uses, message residues are frequently used to determine whether data transmitted over network connections or retrieved from a storage device may have been corrupted. For instance, a noisy transmission line may change a “1” signal to a “0”, or vice versa. To detect corruption, a message is often accompanied by its message residue. A receiver of the data can then independently determine a residue for the message and compare the determined residue with the received residue. 
         [0002]    A common message residue is known as a Cyclic Redundancy Check (CRC). A CRC computation is based on interpreting a stream of message bits as coefficients of a polynomial. For example, a message of “1010” corresponds to a polynomial of (1 x 3 )+(0 x 2  )+(1 x 1 ) +(0 x 0 ) or, more simply, x 3 +x 1 . The message polynomial is divided by another polynomial known as the modulus. For example, the other polynomial may be “11” or x+1. A CRC is the remainder of a division of the message by the polynomial. CRC polynomial division, however, is somewhat different than ordinary division in that it is computed over the finite field GF(2) (i.e., the set of integers modulo 2). More simply put: even number coefficients become zeroes and odd number coefficients become ones. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0003]      FIG. 1  is a diagram illustrating repeated reduction of data segments used to represent a message. 
           [0004]      FIG. 2  is a diagram illustrating a reduction constant. 
           [0005]      FIG. 3  is a flow chart illustrating determination of a message residue. 
       
    
    
     DETAILED DESCRIPTION 
       [0006]    Message residues are commonly used in many different protocols to protect data integrity. Computing these residues, however, imposes significant computational overhead. The following describes techniques that repeatedly whittle a message into a smaller set of equivalent data using fast, inexpensive operations. The resulting, smaller, set of data can then be processed, for example, in a conventional manner to arrive at a final message residue value. In other words, the more burdensome task of determining an exact value of a message residue is postponed until a message is reduced to a smaller size that retains the mathematical characteristics of the original message with respect to the residue. 
         [0007]    In greater detail,  FIG. 1  depicts a message S  100 . To determine a message residue, the bits of the message S can be handled as the coefficients of a polynomial S(x). For example, a 32-bit CRC of S can be defined as: 
         [0000]        CRC=S· 2 32  mod  g    [1] 
         [0000]    where g is a 33-bit polynomial. Different values of g have been defined for a variety of applications. For example, iSCSI (Internet Small Computer System Interface) defines a value of 11EDC6F41 16  for g. Other applications have selected different polynomial sizes and values. Typically, the resulting CRC value is stored with the message, S, in the empty 32-least significant bits created by the 2 32  shift. Alternately, the value may be stored in a packet field or other location. Recomputing the CRC value and comparing with the stored value can indicate whether data was corrupted. 
         [0008]    As shown, S can be represented as a series of n-bit segments  100   a,    100   b,    100   c,    100   d . The following describes techniques that successively “fold” the most significant segment into remaining segments, repeatedly reducing the amount of data used to represent S by one segment. As described below, implementations of the folding operation are comparatively inexpensive in terms of computation and die impact. 
         [0009]      FIG. 1  depicts the first two  108   a,    108   b  of a series of repeated folding operations that operate on a subset of segments. In the example shown, each subset features the three most significant remaining segments representing S. For example, the initial folding operation  108   a  operates on segments  100   a ,  100   b ,  100   c.  As shown, the operation  108   a  includes a polynomial multiplication  102   a  of the most significant segment  100   a  by a pre-computed constant k. The result of this multiplication  102   a  is XOR-ed with the values of the least significant segments of the subset to yield segments  104   a ,  104   b.  The values of these segments  104   a ,  104   b  preserve the contribution of the most significant segment  100   a  to the final determination of the residue for S. Thus, segment  100   a  can be discarded or ignored for residue purposes. 
         [0010]    As shown, the segments  104   a ,  104   b  output from the first folding operation  108   a  can be combined with the next segment of S  100   d  to form a new subset of segments. Again, the same folding operation  108   b  proceeds, folding the most significant segment  104   a  into segments  104   b ,  100   d  by a multiplication  102   b  of segment  104   a  by constant k and an XOR-ing of the result  102   b  with segments  104   b ,  100   d  to yield segments  106   a ,  106   b.    
         [0011]    This process of folding can repeat as desired to linearly reduce the data representing S by one segment for each folding operation. The reduction may be repeated any number of times. For example, in the sample implementation shown, folding may continue until only two segments remain. The residue of the final two segments (e.g., remaining-segments mod g) can be determined in a variety of ways such as described below in conjunction with  FIG. 3 . 
         [0012]    The folding operation shown in  FIG. 1  uses a pre-computed constant k to speed computations. As shown in  FIG. 2 , the constant k may be determined as: 
         [0000]      k=2 2n  mod g   [2] 
         [0000]    where n is the number of bits in a segment. The contribution of A (e.g., A·x 2n ) to the message residue can, thus, be expressed as A·k (e.g.,  102   a,    102   b  in  FIG. 1 ). The technique is well suited to execution on processors that have a Galois-field (carry-less) multiplier, though such hardware is not an implementation requirement. 
         [0013]    Since the polynomial g and n, the number of bits in each segment, are constants, k can be pre-computed and stored prior to processing of the data values of S. Potentially, different values of k can be pre-computed and stored for different values of n and g. Such an implementation can quickly switch between polynomials by a lookup of k based on g and/or n. 
         [0014]    The specific examples described above illustrated determination of a 32-bit CRC polynomial. However, the techniques describe above work for arbitrary segment sizes. For example, n can be set as a number of bits equal to the (width of g) −1. Additionally, while the above described folding operations  108   a ,  108   b  that operate on 3-segments subsets, other implementations may operate on a different number of segments. For example, instead of 3:2 segment reduction another implementation may feature a 4:3 segment reduction and so forth. Additionally, while the above describes a CRC message residue, the techniques described above can be used in other operations that determine a message residue. 
         [0015]      FIG. 3  illustrates a sample process for computing a message residue. As shown, after computing k  202 , the initial data segments  204  are reduced  206  to a set of fewer but equivalent data segments with respect to the residue. If additional segments remain  208 , reducing  206  continues with the next segment  210 . Otherwise, a residue value is determined for the final set of segments. 
         [0016]    A variety of approaches can determine the final residue value such as a lookup table or a wide variety of algorithms to determine a modular remainder. For example, the final segments can be processed using an approach that implements the division process as multiplication. For instance, a n-bit remainder can be expressed as: 
         [0000]        r   n   =L ( g*· ( M ( s·q +))   [3] 
         [0000]    where
       L is an operation returning the b-least-significant-bits of data;   g* is the b-least-significant bits of polynomial g,   M is an operation returning the b-most-significant-bits, and   q+ is the quotient of (2 2n /g).
 
Like the folding techniques described above, this approach can use pre-computed values for g* and q+ to speed computation.
       
 
         [0021]    The techniques described above can be implemented in a wide variety of logic. For example, the techniques may be implemented as instructions disposed on a computer readable storage medium for execution by a processor element (e.g., a CPU (Central Processing Unit) or processor core). The techniques may also be implemented as dedicated hardware. Alternately, some combination may be used such as instructions that take advantage of special hardware components (e.g., a Galois-field (carry-less) multiplier or multiplier configured to handle carry-less multiplication). The logic may be integrated within a discrete component such as a NIC (Network Interface Controller), framer, offload engine, storage processor, and so forth. 
         [0022]    Other embodiments are within the scope following claims.