A formal approach to designing multiple-Valued arithmetic circuits

Research output: Contribution to journalArticlepeer-review


This paper proposes a formal approach to designing multiple-valued arithmetic circuits over Galois Fields (GFs). Our method introduces a high-level multiple-valued graph specified by variables and arithmetic formulae over specific GFs. The graph represents arithmetic circuits over GFs in a hierarchical manner. The proposed circuit description is formally verified by symbolic computations such as polynomial reduction using Gröbner Bases. In this paper, we propose the graph representation and show an example of its description and verification. The advantageous effects of the proposed approach are demonstrated through experimental designs of parallel multipliers over Galois field GF(2m) for different word-lengths and irreducible polynomials. An inversion circuit consisting of some multipliers is also designed and verified as a further application. The result shows that the proposed approach has a definite possibility of verifying practical arithmetic circuits where the conventional simulation and verification techniques failed.

Original languageEnglish
Pages (from-to)21-34
Number of pages14
JournalJournal of Multiple-Valued Logic and Soft Computing
Issue number1-4
Publication statusPublished - 2014 Jan 1


  • Arithmetic circuits
  • Computer algebra
  • Formal verification
  • Galois field

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Software
  • Logic


Dive into the research topics of 'A formal approach to designing multiple-Valued arithmetic circuits'. Together they form a unique fingerprint.

Cite this