A two-step computation of cyclic redundancy code CRC-32 for ATM networks

ATM CRC-32 is difficult to compute because it is based on a polynomial of degree 32 that has many more terms than any other CRC polynomial in common use. A two-step computation of CRC-32 is described.

Saved in:
Bibliographic Details
Published inIBM journal of research and development Vol. 41; no. 6; pp. 705 - 709
Main Author GLAISE, R. J
Format Journal Article
LanguageEnglish
Published Armonk, NY International Business Machines 01.11.1997
International Business Machines Corporation
Subjects
Applied sciences
Asynchronous transfer mode
Codes
Coding, codes
Data integrity
Exact sciences and technology
Information, signal and communications theory
Mathematical models
Polynomials
Processing speed
Signal and communications theory
Telecommunications and information theory
Cyclic code
Coding
Computing method
Digital transmission
Asynchronous transfer mode
Online AccessGet full text

Cover

More Information
Summary:ATM CRC-32 is difficult to compute because it is based on a polynomial of degree 32 that has many more terms than any other CRC polynomial in common use. A two-step computation of CRC-32 is described.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-8646
2151-8556
0018-8646
DOI:10.1147/rd.416.0705