Gesellschaft für Informatik e.V.

Lecture Notes in Informatics


ARCS 2004 - Organic and Pervasive Computing, Workshops Proceedings, March 26, 2004, Augsburg, Germany. P-41, 328-337 (2004).

GI, Gesellschaft für Informatik, Bonn
2004


Editors

Uwe Brinkschulte (ed.), Jürgen Becker (ed.), Dietmar Fey (ed.), Karl-Erwin Großpietsch (ed.), Christian Hochberger (ed.), Erik Maehle (ed.), Thomas A. Runkler (ed.)


Copyright © GI, Gesellschaft für Informatik, Bonn

Contents

Parallelism in a CRC coprocessor

Andreas Döring

Abstract


Cyclic Redundancy Checks (CRC) constitute an important class of hash functions for detecting changes in data blocks after transmission, storage and retrieval, or distributed processing. Currently, most sequential methods based on Horner's scheme are applied with some extensions or modifications. The flexibility of these methods with respect to the generator polynomial and the sequence of data processing is limited. A newly proposed algorithm and architecture [DW03, DW04] offer a high degree of flexibility in several aspects and provide high performance with a modest investment in hardware. The algorithm has inherent freedom for parallel processing on several levels, which is exploited in the proposed architecture. An early implementation gives quantitative results on cost and performance and suggests possible extensions and improvements. The algorithm, a typical system architecture, and the coprocessor's structure are described in this paper with an emphasis on parallelism.


Full Text: PDF

GI, Gesellschaft für Informatik, Bonn
ISBN 3-88579-370-9


Last changed 04.10.2013 18:00:33