Abstract
The Special Normal Form (SNF) for Boolean functions is a redundant representation that is useful in determining minimized Exclusive-Or-Sum-Of-Product (ESOP) expressions. Generalized Reed-Muller expressions (GRM) can be viewed as expressions that are close to the ESOPs in the number of products, however, they are easier to determine, which makes them important in practical applications.
Galois field (GF) expressions are a generalization of Reed-Muller expressions to multiple-valued logic functions. This paper extends the notion of SNF for Boolean functions to ternary logic functions. An algorithm to minimize generalized Galois field (GF) expressions for ternary functions by using SNF is presented.
Galois field (GF) expressions are a generalization of Reed-Muller expressions to multiple-valued logic functions. This paper extends the notion of SNF for Boolean functions to ternary logic functions. An algorithm to minimize generalized Galois field (GF) expressions for ternary functions by using SNF is presented.
| Translated title of the contribution | Determining Minimized Galois Field Expressions for Ternary Functions by using Special Normal Form |
|---|---|
| Original language | English |
| Pages (from-to) | 53-71 |
| Number of pages | 19 |
| Journal | Journal of Multiple-Valued Logic and Soft Computing |
| Volume | 24 |
| Issue number | 1-4 |
| Publication status | Published - 2015 |
| Publication type | A1 Journal article-refereed |
Publication forum classification
- Publication forum level 1