Application of parallel computing technology OpenMP to search for the generator polynomials

Evgeniy, Mytsko; Malchukov, Andrey

doi:10.1109/meacs.2014.6986902

Cited by 2 publications

(1 citation statement)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The table with precomputed values by generator polynomial is used when checksum is computed. The generator polynomial 104C11DB7h [7,8] which is submitted in hexadecimal is used in algorithms Pkzip, WinRAR, Ethernet. Fig.…”

Section: Table-driven Algorithmmentioning

confidence: 99%

Software Implementation Research of CRC Computation Algorithms Compatible with PKZIP, WINRAR, ETHERNET

Mytsko¹,

Malchukov²,

Kim³

et al. 2016

Proceedings of the 2016 Conference on Information Technologies in Science, Management, Social Sphere and Medicine

View full text Add to dashboard Cite

Abstract-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.

show abstract

Section: Table-driven Algorithmmentioning

confidence: 99%