Abstract
A number of decomposition based mapping techniques are proposed. In these techniques, the synthesis problem is formulated as a mapping from an input matrix to an output matrix. The minimisation is obtained by constructing a 'matching-count matrix'. The entries of the matching-count matrix MC,-y represent the number of entry matches between the input variable number / in the input matrix (X) and the output function number j in the output matrix (Y). It then selects those inputoutput pairings that give the maximum matching count, thus maximising the number of switching operations which can be eliminated in the realisation of multiple-valued logic (MVL) functions. The proposed techniques are classified as: output-phase with complement, input-phase with and without complement. Numerical results are presented to show that the proposed techniques result in significant reduction in the number of switching operators required for the implementation of 5000 randomly generated /valued functions (for r = 3, 4 and 5). It is also shown that the input-phase assignment techniques do not require any additional hardware circuitry at the output to restore the original function. This may give this technique an edge over other techniques.
| Original language | English |
|---|---|
| Pages (from-to) | 207-212 |
| Number of pages | 6 |
| Journal | IEE Proceedings: Circuits, Devices and Systems |
| Volume | 145 |
| Issue number | 3 |
| DOIs | |
| State | Published - 1998 |
Keywords
- Decomposition
- Mapping teclmiqiies
- Minimisation
- Mvl functions
- Switching operators
- Synthesis of functions
ASJC Scopus subject areas
- Electrical and Electronic Engineering