Skip to main content
SpringerLink
Log in

An efficient method for parallel CRC automatic generation

  • Electronics & Electrical Engineering
  • Published:
Journal of Zhejiang University-SCIENCE A Aims and scope Submit manuscript

Abstract

The State Transition Equation (STE) based method to automatically generate the parallel CRC circuits for any generator polynomial or required amount of parallelism is presented. The parallel CRC circuit so generated is partially optimized before being fed to synthesis tools and works properly in our LAN transceiver. Compared with the cascading method, the proposed method gives better timing results and significantly reduces the synthesis time, in particular.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Glaise, R.J. and Jacquart, X., 1993. Fast CRC Calculation. IEEE International Conference on Computer Design: VLSI in Computers and Processors, p. 602–605.

  • Matsushima, T.K., Matsushima, T. and Hirasawa, S., 1996. Parallel encoder and decoder architecture for cyclic codes.IEICE Transactions fundamentals, E79-A (9): 1313–1323.

    Google Scholar 

  • Pandeya, A.K. and Cassa, T.J., 1975. Parallel CRC Lets many lines use one circuit.Computer Design,14(9): 87–91.

    Google Scholar 

  • Perez, A., 1983. Byte-wise CRC calculation.IEEE Micro,3(3): 40–50.

    Article  Google Scholar 

  • Pei, T.B. and Zukowski, C., 1992. High-speed parallel CRC circuits in VLSI.IEEE Trans. Comm.,40(4): 653–657.

    Article  MATH  Google Scholar 

  • Ramabadran, T.V. and Gaitonde, S.S., 1988. A tutorial on CRC computations.IEEE Micro,8(4): 62–75.

    Article  Google Scholar 

  • Sarwate, D.V., 1988. Computation of cyclic redundancy Checks via table loop-up.Communications of the ACM,31(8): 1008–1013.

    Article  Google Scholar 

  • Sprachmann, M., 2001. Automatic generation of parallel CRC cricuits.IEEE Design & Test of Computer,18 (3): 108–114.

    Article  Google Scholar 

  • Ying, J., 2000. Research on computer-aided prototyping system and software evolution.Journal of Zhejiang University SCIENCE,1(4): 384–387.

    Article  Google Scholar 

  • IEEE Computer Society Technical committee on Computer Communications, 2000 Edition. IEEE Standards for Local Area Networks: Carrier Sense Multiple Access with Collision Detection (CSMA/CD): Media Access Control Frame Structure.

Download references

Author information

Authors and Affiliations

  1. Department of Information Science and Electronic Engineering, Zhejiang University, 310027, Hangzhou, China

    Chen Hong-sheng, Zhang Wei-cheng, Wang Yong & Chen Kang-sheng

Authors
  1. Chen Hong-sheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhang Wei-cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wang Yong
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Chen Kang-sheng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chen Hong-sheng.

Additional information

Project (No. 60271010) supported by the National Natural Science Foundation of China

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, Hs., Zhang, Wc., Wang, Y. et al. An efficient method for parallel CRC automatic generation. J. Zhejiang Univ. Sci. A 4, 433–436 (2003). https://doi.org/10.1631/jzus.2003.0433

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1631/jzus.2003.0433

Key words

Document code

CLC number

Search

Navigation