This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
AT/sup 2/-Optimal Galois Field Multiplier for VLSI
September 1989 (vol. 38 no. 9)
pp. 1333-1336
VLSI designs for Galois field multipliers, which are central in many encoding and decoding procedures for error-detecting and error-correcting codes, are presented. An AT/sup 2/-optimal Galois-field multiplier based on AT/sup 2/-optimal integer multipliers for a synchronous VLSI model is exhibited. Galois field multiplication is done in two steps. First two polynomials (of degree n-1) over Z/su

[1] H. Abelson and P. Andreae, "Information transfer and area-time trade-offs for VLSI multiplication,"Commun. ACM, vol. 23, no. 1, pp. 20-23, Jan. 1980.
[2] A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms. Menlo Park, CA: Addison-Wesley, 1974.
[3] P. W. Beame, S. A. Cook, and H. J. Hoover, "Log depth circuits for division and related problems,"SIAM J. Comput., vol. 15, pp. 994-1003, 1986.
[4] E. R. Berlekamp,Algebraic Coding Theory. New York: McGraw-Hill, 1968.
[5] R. P. Brent and H. T. Kung, "The area-time complexity of binary multiplication,"J. ACM, vol. 28, no. 3, pp. 521-534, 1981.
[6] M. Fürer, in preparation, 1985.
[7] R. Kannan, G. Miller, and L. Rudolph, "Sublinear parallel algorithm for computing the greatest common divisor of two integers,"SIAM J. Comput., vol. 16, pp. 7-16, 1987.
[8] J. H. van Lint,Coding Theory, Lecture Notes in Math., Vol. 201, Berlin, Germany: Springer-Verlag, 1971.
[9] F. J. MacWilliams and N. J. A. Sloane,The Theory of Error-Correcting Codes. Amsterdam: North-Holland, 1978.
[10] K. Mehlhorn, "AT2-optimal VLSI integer division, and integer square rooting,"Integration, vol. 2, pp. 163-167, 1984.
[11] K. Melhorn and F. P. Preparata, "Area-time optimal VLSI integer multiplier with minimum computation time,"Inform. Contr., vol. 58, pp. 137-156, 1983.
[12] K. Mehlhorn and F. P. Preparata, "Area-time optimal division forT=Ω((logn)1 +ε),"Inform. Computat., vol. 72, pp. 270-282, 1987.
[13] F. P. Preparata and J. Vuillemin, "Area-time optimal VLSI networks for computing integer multiplication and discrete Fourier transform," inProc. ICALP Conf., Haifa, Israel, 1981, pp. 39-40.
[14] J. Reif, "Logarithmic depth circuits for algebraic functions," inProc. 24th IEEE Symp. Foundations Comput. Sci., Nov. 1983, pp. 138- 143.
[15] A. Schönhage, "Schnelle Multiplikation von Polynomenüber Körpern der Charakteristik 2,"Acta Informatica, vol. 7, pp. 395-398, 1976.
[16] A. Schönhage and V. Strassen, "Schnelle Multiplikation grosser Zahlen,"Computing, vol. 7, pp. 281-292, 1971.
[17] C. D. Thompson, "Area-time complexity for VLSI," inProc. Eleventh Annu. ACM Symp. Theory Comput., 1979, pp. 81-88.
[18] C. C. Wang, T. K. Truong, H. M. Shao, L. J. Deutsch, J. K. Omura, and I. S. Reed, "VLSI architecture for computing multiplications and inverses in GF(2m),"IEEE Trans. Comput., vol. C-34, pp. 709-716, Aug. 1985.
[19] A. Yao, "The entropic limitations on VLSI computations," inProc. 13th STOC, 1981, pp. 308-311.

Index Terms:
error detection codes; AT/sup 2/-optimal Galois field multiplier; VLSI; encoding; decoding; error-correcting codes; integer multipliers; polynomials; discrete Fourier transform; open problems; decoding; digital arithmetic; encoding; multiplying circuits; VLSI.
Citation:
M. Furer, K. Mehlhorn, "AT/sup 2/-Optimal Galois Field Multiplier for VLSI," IEEE Transactions on Computers, vol. 38, no. 9, pp. 1333-1336, Sept. 1989, doi:10.1109/12.29475
Usage of this product signifies your acceptance of the Terms of Use.