Main Article Content

Abstract

This paper focuses on developing a generalized CRC code where the user can vary the size of the generator polynomial [1] such as 9 bits (CRC-8), 17 bits (CRC-16), 33 bits (CRC-32), 65 bits (CRC-64). The working of the code has been shown taking an example and the resulting simulations obtained are shown.

Article Details

How to Cite
Ghosh, D., Mitra, A., Mukhopadhyay, A., Dawn, A., & Ghosh, D. (2015). A GENERALIZED CODE FOR COMPUTING CYCLIC REDUNDANCY CHECK. Students’ Research in Technology & Management, 1(2), 192-202. Retrieved from https://giapjournals.com/ijsrtm/article/view/60

References

  1. Cyclic Redundancy Code (CRC) Polynomial Selection For Embedded Networks By Philip Koopman
  2. and Tridib Chakravarty
  3. CRC Cyclic Redundancy Check Analysing and Correcting Errors By Prof. Dr. W. Kowalk
  4. VHDL basics By Raunak Ranjan
  5. http://en.wikipedia.org/wiki/Cyclic_redundancy_check

Most read articles by the same author(s)