A graph-based unified technique for computing and representing coefficients over finite fields

AM Jabir, DK Pradhan

Research output: Contribution to journalArticle (Academic Journal)

8 Citations (Scopus)

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.
Translated title of the contributionA graph-based unified technique for computing and representing coefficients over finite fields
Original languageEnglish
Article number1119-1132
Pages (from-to)1119 - 1132
Number of pages14
JournalIEEE Transactions on Computers
Volume56 (8)
DOIs
Publication statusPublished - Aug 2007

Bibliographical note

Publisher: IEEE

Fingerprint Dive into the research topics of 'A graph-based unified technique for computing and representing coefficients over finite fields'. Together they form a unique fingerprint.

  • Cite this