Configurable array logic circuits for computing network error detection codes
Tóm tắt
Configurable Array Logic (CAL) has a basic architecture which is a cellular array with nearest neighbor connections. The cells in the array are dynamically programmable using transistor switches controlled by static RAM cells. Each cell can realize any two-input Boolean operation or act as a simple latch, as well as providing routing for pass-through connections to allow non-neighbor inter-cell connections. In this article, we demonstrate the versatility of the CAL technology by presenting efficient CAL circuits for computing all of the major error detection codes now in use for worldwide computer networking; these include CCITT, IEEE, Internet and ISO standard codes. The circuits, each having a version which comfortably fits on to a single 32×32 cell CAL chip, are appropriate for use as hardware accelerators to help computers deal with the ever increasing rates of data transmission over networks. The first class of error detection codes described are thecyclic redundancy codes (CRCs), which are in virtually universal use for bit serial transmission over physical links. The other class of error detection codes described are themodulo 2
n
— 1checksums, which are in common use for byte transmission over networks and inter-networks.
Từ khóa
Tài liệu tham khảo
T. Kean, “Configurable logic: A dynamically programmable cellular architecture and its VLSI implementation,” University of Edinburgh Ph.D. Thesis, 1989.
J. Gray and T. Kean, “Configurable hardware: A new paradigm for computation,”Proc. of Decennial Caltech Conference on VLSI, Pasadena, CA, 1989.
T. Kean, personal communication, 1991.
W. Stallings,Data and Computer Communications (3rd edition), New York: Macmillan, 1991.
A. Nakassis, “Fletcher's error detection algorithm: how to implement it efficiently and how to avoid the most common pitfalls,”Computer Communications Review, vol. 18, 1988, pp. 63–88.
D. Comer,Internetworking with TCP/IP London: Prentice-Hall International, 1991.
W. Plummer, “IEN-45: TCP checksum function design,”Computer Communications Review, vol. 19, 1989, pp. 95–101.
J. Fletcher, “An arithmetic checksum for serial transmission,”IEEE Trans. on Communications, vol. COM-30, 1982, pp. 247–52.
A. Cockburn, “Efficient implementation of the OSI transport protocol checksum algorithm using 8/16 bit arithmetic,”Computer Communications Review, vol. 17, 1987, pp. 13–20.
K. Sklower, “Improving the efficiency of the OSI checksum calculation,”Computer Communications Review, vol. 19, 1989, pp. 32–43.
R. Braden, D. Borman and C. Partridge, “Computing the Internet checksum,”Computer Communications Review, vol. 19, 1989, pp. 86–94.
G. Brebner, “CAL on CHS2×4 boards made simple,” University of Edinburgh Department of Computer Science Technical Report, 1992.