Your Search Results

Use this resource - and many more! - in your textbook!

AcademicPub holds over eight million pieces of educational content for you to mix-and-match your way.

Experience the freedom of customizing your course pack with AcademicPub!
Not an educator but still interested in using this content? No problem! Visit our provider's page to contact the publisher and get permission directly.

Multiple-valued Galois field S/D trees for GFSOP minimization and their complexity

By: Perkowski, M.; Al-Rabadi, A.;

2001 / IEEE / 0-7695-1083-3

Description

This item was taken from the IEEE Conference ' Multiple-valued Galois field S/D trees for GFSOP minimization and their complexity ' The idea of S/D trees for binary logic is a general concept that found its main application in ESOP minimization and the generation of new diagrams and canonical forms. S/D trees demonstrated their power by generating forms that include a minimum Galois-Field-Sum-of-Products (GFSOP) circuits for binary and ternary radices. Galois field of quaternary radix has some interesting properties. An extension of the S/D trees to GF(4) is presented here. A general formula to calculate the number of inclusive forms (IFs) per variable order for an arbitrary Galois field radix and arbitrary number of variables is derived. A new fast method to count the number of IFs for an arbitrary Galois field radix and functions of two variables is introduced; the IF/sub n,2/ Triangles. This research is useful to create an efficient GFSOP minimizer for reversible logic.