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.
|Translated title of the contribution||A graph-based unified technique for computing and representing coefficients over finite fields|
|Pages (from-to)||1119 - 1132|
|Number of pages||14|
|Journal||IEEE Transactions on Computers|
|Publication status||Published - Aug 2007|
Bibliographical notePublisher: IEEE
Jabir, AM., & Pradhan, DK. (2007). A graph-based unified technique for computing and representing coefficients over finite fields. IEEE Transactions on Computers, 56 (8), 1119 - 1132. [1119-1132]. https://doi.org/10.1109/TC.2007.1060