Abstract：The Cyclic Redundancy Checking (CRC) is widely used in many applications. For a certain format of the code, the error undetected probability is nearly a constant. But more bits of the information take more chances to burst errors. This paper proposes to reduce the error burst probability with lossless compression method, i.e., Huffman coding. The probability can be less then one ten-thousandth. Consequently, a new reliability circuit for VLSI with combined Huffman and CRC coding has been designed in this paper.
2010, Vol. 32 
