SUDAN UNIVERSITY OF SCINCE AND TECHNOLOGY

FACULTY OF ENGINEERING DEPARTMENT OF ELECTORNICS

H.W ON: CRC AND HONEYWELL CHECKSUM FAULT TOLERANCE SYSTEMS

DONE BY: AMRO MOHAMED IBRAHIM MOHAMED SUPERVISED BY: DR. SARA ALJACK

CYCLIC REDUNDANCY CHECK CRC:This method(CRC)- which is in widespread use currently- can detect and correct errors in sequences of bits and can therefor be used in data transmission as well as in data storage to protect files from errors. CRC is in use in many applications and standards, and is easily integrated in hardware. The method can be described by polynomial division. Data are stored in bytes, which consist of 8 bits each. Thus any set of data can be considered as sequence of bytes or bits. The method presented uses bitfilters to describe important properties of CRC method. A bitfilter considers only some to the terms of an error polynomial and derives from its structure the properties of the error. Bitfilters can be analysed independently of an error so that many new and important properties of CRC method can be derived. In computer communication usually the bits are considered to be independent and a bit sequence is limited by the size of data blocks (or frames, packets, datagrams etc.). Thus we consider the problem to check whether a finite sequence of bits is changed unintentionally, e.g. by transmission errors or faulty memories. To solve this problem (namely to protect data from unintentional errors) we add some redundant information to the bit sequence (which represents the data). To get those redundancy information we perform

some operations on the bit sequence, the result of which is stored as redundancy information. The receiver of a message, or the reader of memory input can make the same operations and compare against the stored redundancy information. If both are the same there s a good chance no error occurred. If both differ there is definitely an error; however, this may be in the redundancy information as well as in the data, so in this case there is as well only a good chance for an error. Cyclic redundancy check performs a special operation that can be interpreted as polynomial division. The residual of this division is used as redundancy information and we will explore in this paper which types of errors can be detected by this method.

HONYWELL CHECKSUM:One popular method for error detection is the use of checksums. Checksums have the advantage of operating on a long sequence of data. Typically the data is 8 bit character data (or ASCII data) in a file or character frame. Each character byte is summed into a checksum variable. As the data is summed into the checksum variable, the carrys are ignored. The checksum variable is usually appended to the end of the data field and is called the checksum field. The checksum field can be one or more bytes. The ability to detect errors in a multibyte sequence is affected by the number of bytes in the sequence and the size of the checksum field. Four different types of checksums will be described: the single precision checksum, the double precision checksum, the Honeywell checksum and the residue checksum. The basic idea of the Honeywell checksum is to concatenate consecutive words to form a collection of double-length words. The Honeywell Checksum is an alternative to the double precision checksum. The data is still summed into a location which is 2n bits in length where n is the size of the data word. Unlike the double precision checksum, the Honeywell checksum interleaves the data bytes into double length words before the addition to the checksum location. Carrys from the high order byte of the checksum are ignored. The Honeywell checksum can find SA1 and SA0

errors which occur in the same bit positions of all the data words.