International Journal of Computer
Trends and Technology

Research Article | Open Access | Download PDF

Volume 4 | Issue 9 | Year 2013 | Article Id. IJCTT-V4I9P154 | DOI : https://doi.org/10.14445/22312803/IJCTT-V4I9P154

An Optimization Technique for CRC Generation


K.V.Krishna

Citation :

K.V.Krishna, "An Optimization Technique for CRC Generation," International Journal of Computer Trends and Technology (IJCTT), vol. 4, no. 9, pp. 3260-3265, 2013. Crossref, https://doi.org/10.14445/22312803/IJCTT-V4I9P154

Abstract

In networking environments, the cyclic redundancy check (CRC) is widely utilized to determine whether errors have been introduced during transmissions over physical links. In this paper, we present a fast cyclic redundancy check (CRC) algorithm that performs CRC computation for an arbitrary length of message in parallel. This paper proposes 64 bits parallel CRC architecture based on F matrix with order of generator polynomial is 32 and showed CRC-64 is having less latency and high throughput compared to CRC-32 parallel architecture through Xilinx Simulator.

Keywords

CRC, lookup table, Fast update

References

1] T. V. Ramabadran and S. S. Gaitonde, ―A tutorial on CRC computations,‖ IEEE Micro, vol. 8, no. 4, pp. 62–75, Aug. 1988.
[2] C. Cheng and K. K. Parhi, ―High-speed parallel CRC implementation based on unfolding, pipelining, and retiming,‖ IEEE Transactions on Circuits and Systems II: Express Briefs, vol. 53, no. 10, pp. 1017–1021, Oct. 2006.
[3] X. Zhang and K. K. Parhi, ―High-speed architectures for parallel long BCH encoders,‖ IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 13, no. 7, pp. 872–877, Jul. 2005.
[4] K. K. Parhi, ―Eliminating the fanout bottleneck in parallel long BCH encoders,‖ IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 51, no. 3, pp. 512–516, Jul. 2004.
[5] G. Campobello, G. Patane, and M. Russo, ―Parallel CRC realization,‖ IEEE Transactions on Computers, vol. 52, no. 10, pp. 1312–1319, Oct. 2003.
[6] J. Satran, D. Sheinwald, and I. Shimony, ―Out of order incremental CRC computation,‖ IEEE Transactions on Computers, vol. 54, no. 9, pp. 1178–1181, Sep. 2005.
[7] D. Feldmeier, ―Fast software implementation of error detection codes,‖ IEEE/ACM Transactions on Networking, vol. 3, no. 6, pp. 640–651, Dec. 1995.
[8] A. Simionescu, ―CRC tool computing CRC in parallel for Ethernet,‖ http://space.ednchina.com/upload/2008/8/27/ 300b83c-43ea-459b-ad5c4dc377310024.pdf, 2001.
[9] M. E. Kounavis and F. L. Berry, ―Novel table lookup-based algorithms for high-performance CRC generation,‖ IEEE Transactions on Computers, vol. 57, no. 11, pp. 1550–1560, Nov. 2008.
[10] M. Braun, J. Friedrich, T. Grn, and J. Lembert, ―Parallel CRC computation in FPGAs generation,‖ Field-Programmable Logic Smart Applications, New Paradigms and Compilers, vol. 1142, pp. 156–165, 1996.
[11] R. Ahmad, O. Sidek, and S. Mohd, ―Development of the CRC block for Zigbee standard on FPGA,‖ in Proceedings of Interna-tional Conference for Technical Postgraduates, Dec. 2009.
[12] M. Walma, ―Pipelined cyclic redundancy check (CRC) calculation,‖ in Proceedings of the 16th International Conference on Computer Communications and Networks, Aug. 2007, pp. 365–370.