This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Graph-Based Unified Technique for Computing and Representing Coefficients over Finite Fields
August 2007 (vol. 56 no. 8)
pp. 1119-1132

Abstract—This paper presents the generalized theory and an efficient graph-based technique for the calculation and representation of coefficients of multivariate canonic polynomials over arbitrary finite fields in any polarity. The technique presented for computing coefficients is unlike polynomial interpolation or matrix-based techniques and takes into consideration efficient graph-based forms which can be available as an existing resource during synthesis, verification, or simulation of digital systems. Techniques for optimization of the graph-based forms for representing the coefficients are also presented. The efficiency of the algorithm increases for larger fields. As a test case, the proposed technique has been applied to benchmark circuits over GF2. The experimental results show that the proposed technique can significantly speed up execution time.

Index Terms:
Finite or Galois fields, decision diagrams, coefficients, polynomials
Citation:
Abusaleh M. Jabir, Dhiraj K. Pradhan, "A Graph-Based Unified Technique for Computing and Representing Coefficients over Finite Fields," IEEE Transactions on Computers, vol. 56, no. 8, pp. 1119-1132, Aug. 2007, doi:10.1109/TC.2007.1060
Usage of this product signifies your acceptance of the Terms of Use.