Adding Autosignals to the Configuration Through ConfigStepsView

• InitialValue—CRC initial value. The default is 0xFF (255).

• FinalXORValue—XOR value at the end of the CRC algorithm. The default is 0xFF (255).

• CRCMask—Determines the range of data bytes that the CRC calculation uses. For example, CRCMask 0x7F (127) means that the checksum calculation uses Byte 0 to Byte 6 of the data bytes.

• UserByteBefore—The bytes used before the data bytes for the checksum calculation.

• UserByteAfter—The bytes used after the data bytes for the checksum calculation.

• CRCPolynomial—A hexadecimal representation of the CRC-8 polynomial without the most significant bit. The following polynomial is represented as 0x14D:

  $x^8+x^6+x^3+x^2+1$

  In this case, enter 0x4D in the CRCPolynom field (instead of 0x14D).

• InitialValue—CRC initial value.

• FinalXORValue—XOR value applied at the end of the CRC algorithm.

• CRCMask—Determines the data bytes of the CAN messages that the CRC calculation uses. For example, enter 127 (decimal representation of 0x7F) to use bytes 0 to 6.

• ReflectedInput—Reverses the order of the message bytes before the CRC calculation.

• ReflectedOutput—Reverses the order of the computed CRC bits before output.

• FinalXORValue—XOR value at the end of the CRC algorithm.

• CRCMask—Determines the data bytes of the CAN messages that the CRC calculation uses. For example, 0x7F (127) means that the CRCMask uses bytes 0 to 6.

• CRCMask—Determines the data bytes of the CAN messages that the CRC calculation uses. For example, 0x7F (127) means that bytes 0 to 6 are used.

• Start Bit—Determines the bit where you can find the CRC checksum.

  The following example shows how this algorithm works:

  $\text{Checksum}=\text{Byte}1\text{XOR}\text{Byte}2\text{XOR}\text{Byte}3\text{XOR}\text{Byte}4$

  $\text{Checksum}=\left(\text{higher\_nibble}\right(\text{Checksum}\left)\right)\text{XOR}\left(\text{lower\_nibble}\right(\text{Checksum}\left)\right)$

  $\text{Checksum}=\text{Checksum}\text{XOR}\text{MSG\_CNT}$

• FinalXORValue—XOR value at the end of the CRC algorithm.

  The following example shows how this algorithm works:

  $\text{if}(\text{Byte}1+\text{Byte}2>255)\text{then}(C=1)\text{else}(C=0)$

  $\text{Checksum}=\text{Byte}1+\text{Byte}2+C$

  $\text{if}(\text{Checksum}+\text{Byte}3>255)\text{then}(C=1)\text{else}(C=0)$

  $\text{Checksum}=\text{Checksum}+\text{Byte}3+C$

  $\text{if}(\text{Checksum}+\text{Byte}4>255)\text{then}(C=1)\text{else}(C=0)$

  $\text{Checksum}=\text{Checksum}+\text{Byte}4+C$

  $\text{if}(\text{Checksum}+\text{Byte}5>255)\text{then}(C=1)\text{else}(C=0)$

  $\text{Checksum}=\text{Checksum}+\text{Byte}5+C$

  $\text{if}(\text{Checksum}+\text{Byte}6>255)\text{then}(C=1)\text{else}(C=0)$

  $\text{Checksum}=\text{Checksum}+\text{Byte}6+C$

  $\text{if}(\text{Checksum}+\text{Byte}7>255)\text{then}(C=1)\text{else}(C=0)$

  $\text{Checksum}=\text{Checksum}+\text{Byte}7+C$

  $\text{Checksum}=\text{Checksum}\text{AND}255$

  $\text{Checksum}=\text{Checksum}\text{XOR}126$

The following example shows how this algorithm works:

The following example shows how this algorithm works. Assume that the checksum position is byte 4 (Byte4):

The following example shows how this algorithm works. Assume that the checksum position is byte 4 (Byte4):