### Abstract

A multivalued code assignment algorithm for locally computable combinational circuits, when the functional specification for a permutation operation is given by the mapping relationship between input and output alphabets or symbols, is described. Partition theory, usually used in the design of sequential circuit, is effectively used for the fast search for the code assignment problem. Some examples are shown to demonstrate the usefulness of the algorithm.

Original language | English |
---|---|

Title of host publication | Proceedings of The International Symposium on Multiple-Valued Logic |

Publisher | Publ by IEEE |

Pages | 382-388 |

Number of pages | 7 |

ISBN (Print) | 0818626801 |

Publication status | Published - 1992 May 1 |

Event | Proceedings of the 22nd International Symposium on Multiple-Valued Logic - Sendai, Jpn Duration: 1992 May 27 → 1992 May 29 |

### Publication series

Name | Proceedings of The International Symposium on Multiple-Valued Logic |
---|---|

ISSN (Print) | 0195-623X |

### Other

Other | Proceedings of the 22nd International Symposium on Multiple-Valued Logic |
---|---|

City | Sendai, Jpn |

Period | 92/5/27 → 92/5/29 |

### ASJC Scopus subject areas

- Computer Science(all)
- Mathematics(all)

## Fingerprint Dive into the research topics of 'Code assignment algorithm for highly parallel multiple-valued combinational circuits'. Together they form a unique fingerprint.

## Cite this

Tamaki, S., Kameyama, M., & Higuchi, T. (1992). Code assignment algorithm for highly parallel multiple-valued combinational circuits. In

*Proceedings of The International Symposium on Multiple-Valued Logic*(pp. 382-388). (Proceedings of The International Symposium on Multiple-Valued Logic). Publ by IEEE.