Checksum calculator with tree structure of reduction stages

A checksum calculator employs a tree structure of reduction stages to process words of a checksum data array. The number of words in the checksum data array is compared to the number of words each of the reduction stages might process. If the number of words in the checksum data array is greater tha...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	SNYDER KERRY D, D'ARCY PAUL G, THILO JESSE, WIRES KENT E, ZELOV VITALY A
Format:	Patent
Sprache:	eng
Schlagworte:	BASIC ELECTRONIC CIRCUITRY CALCULATING CODE CONVERSION IN GENERAL CODING COMPUTING COUNTING DECODING ELECTRIC DIGITAL DATA PROCESSING ELECTRICITY PHYSICS
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	A checksum calculator employs a tree structure of reduction stages to process words of a checksum data array. The number of words in the checksum data array is compared to the number of words each of the reduction stages might process. If the number of words in the checksum data array is greater than the number of words that the highest level reduction stage might process, then a portion of the checksum data array is processed, remaining words of the checksum data array are appended to the processed portion, and the process is repeated. If the number of words in the checksum data array is less than or equal to the number of words that the highest level reduction stage might process, then the checksum data array is processed by the lowest level reduction stage that can process the entire checksum data array.