International Journal of Advanced Information and Communication Technology


Design of Parallel CRC Generation for High Speed Application

Chaitali Tohgaonkar, Sanjay Tembhurne, Vipin Bhure, GHREAT, RTMN University, Nagpur, India.

DOI : 01.0401/ijaict.2014.07.23

International Journal of Advanced Information and Communication Technology

Received On : November 22, 2017

Revised On : December 15, 2017

Accepted On : January 10, 2017

Published On : February 05, 2017

Volume 04, Issue 02

Pages : 625-627

Abstract


Error detection is important whenever there is a non-zero chance of data getting corrupted. A Cyclic Redundancy Check (CRC) is the remainder, or residue, of binary division of a potentially long message, by a CRC polynomial. This technique is ubiquitously employed in communication and storage applications due to its effectiveness at detecting errors and malicious tampering. The hardware implementation of a bit-wise CRC is a simple linear feedback shift register.This means that ‘n’ clock cycles will be required to calculate the CRC values for an n-bit data stream. Parallel CRC calculation can significantly increase the throughput of CRC computations. In this paper CRC-32 is design for Ethernet application. This paper presents implementation of parallel Cyclic Redundancy Check (CRC) based upon DSP algorithms of pipelining, retiming and unfolding. The architectures are first pipelined to reduce the iteration bound by using novel look-ahead techniques and then unfolded and retimed to design high speed parallel circuits.The methodology to be employed with VHDL, Xilinx ISE for simulation and test benchverification.

Keywords


Cyclic Redundancy Check (CRC), Pipelining, Retiming, Unfolding, VHDL Code.

Cite this article


Chaitali Tohgaonkar, Sanjay Tembhurne, Vipin Bhure, “Design of Parallel CRC Generation for High Speed Application” INTERNATIONAL JOURNAL OF ADVANCED INFORMATION AND COMMUNICATION TECHNOLOGY, pp.625-627, February 05, 2017.

Copyright


© 2017 Chaitali Tohgaonkar, Sanjay Tembhurne, Vipin Bhure. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.