Software Implementation Research of CRC Computation Algorithms Compatible with PKZIP, WINRAR, ETHERNET
| Parent link: | Advances in Computer Science Research Vol. 51 : Information Technologies in Science, Management, Social Sphere and Medicine (ITSMSSM 2016).— 2016.— [P. 134-138] |
|---|---|
| Autor corporatiu: | |
| Altres autors: | , , , , , |
| Sumari: | Title screen The paper describes software implementation research of CRC computation algorithms. Table-driven and matrix-driven algorithms were presented schematically. Also different implementations of the matrix-driven algorithm such as single-byte; two-byte and four-byte were researched. Graphical results of a computer experiment on supercomputer cluster to determine the speed of CRC32 software implementation were described. It is shown that a high-speed four-byte matrix-driven algorithm should be used in embedded systems and industrial data transmission systems. Research of the matrix-driven algorithms acceleration of relative table-driven shows that even two-bytes matrix-driven algorithm ahead of ~29%, while the four-bytes - by ~54%, which is a significant increasing in speed with respect to the table-driven algorithm. |
| Idioma: | anglès |
| Publicat: |
2016
|
| Matèries: | |
| Accés en línia: | http://dx.doi.org/10.2991/itsmssm-16.2016.16 |
| Format: | Electrònic Capítol de llibre |
| KOHA link: | https://koha.lib.tpu.ru/cgi-bin/koha/opac-detail.pl?biblionumber=656462 |
| Sumari: | Title screen The paper describes software implementation research of CRC computation algorithms. Table-driven and matrix-driven algorithms were presented schematically. Also different implementations of the matrix-driven algorithm such as single-byte; two-byte and four-byte were researched. Graphical results of a computer experiment on supercomputer cluster to determine the speed of CRC32 software implementation were described. It is shown that a high-speed four-byte matrix-driven algorithm should be used in embedded systems and industrial data transmission systems. Research of the matrix-driven algorithms acceleration of relative table-driven shows that even two-bytes matrix-driven algorithm ahead of ~29%, while the four-bytes - by ~54%, which is a significant increasing in speed with respect to the table-driven algorithm. |
|---|---|
| DOI: | 10.2991/itsmssm-16.2016.16 |