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
License
Authors retain the copyright without restrictions for their published content in this journal. IJSRTM is a SHERPA ROMEO Journal.
Publishing License
This is an open-access article distributed under the terms of 
How to Cite
Ghosh, D., Mitra, A., Mukhopadhyay, A., Dawn, A., & Ghosh, D. (2015). A GENERALIZED CODE FOR COMPUTING CYCLIC REDUNDANCY CHECK. International Journal of Students’ Research in Technology & Management, 1(2), 192–202. Retrieved from https://mgesjournals.com/ijsrtm/article/view/60
References
- Cyclic Redundancy Code (CRC) Polynomial Selection For Embedded Networks By Philip Koopman
- and Tridib Chakravarty
- CRC Cyclic Redundancy Check Analysing and Correcting Errors By Prof. Dr. W. Kowalk
- VHDL basics By Raunak Ranjan
- http://en.wikipedia.org/wiki/Cyclic_redundancy_check
References
Cyclic Redundancy Code (CRC) Polynomial Selection For Embedded Networks By Philip Koopman
and Tridib Chakravarty
CRC Cyclic Redundancy Check Analysing and Correcting Errors By Prof. Dr. W. Kowalk
VHDL basics By Raunak Ranjan