Cyclic redundancy check (CRC) is one of the most important error-detection schemes used in digital communications. In this method, the transmitter divides of the message by an agreed upon polynomial called the generator and concatenates the calculated residue to the message. The receiver divides what it receives by the generator again. A zero residue indicates error-free transmission and a nonzero residue is interpreted as an error. These calculations are traditionally performed using serial circuits called LFSR especially in serial communications such as the case of the Ethernet protocol. But in parallel communications such as USB, and also integrity checking applications, this method is not efficient enough. In this paper, a new parallel algorithm for parallel CRC calculation is proposed and evaluated. The proposed algorithm exploits mathematical properties of a special family of generator polynomials named OZZ (One-Zero-Zero) polynomials. In this approach, we feedbacks are eliminated and pipelined calculations are used to obtain 32-bit CRC in the SMIC 0.35 m CMOS technology. ___________________________________ 978-1-4673-0089-6/12/$26.00 ©2012 IEEE
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.