Code assignment algorithm for highly parallel multiple-valued combinational circuits

Saneaki Tamaki, Michitaka Kameyama, Tatsuo Higuchi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

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 languageEnglish
Title of host publicationProceedings of The International Symposium on Multiple-Valued Logic
PublisherPubl by IEEE
Pages382-388
Number of pages7
ISBN (Print)0818626801
Publication statusPublished - 1992 May 1
EventProceedings of the 22nd International Symposium on Multiple-Valued Logic - Sendai, Jpn
Duration: 1992 May 271992 May 29

Publication series

NameProceedings of The International Symposium on Multiple-Valued Logic
ISSN (Print)0195-623X

Other

OtherProceedings of the 22nd International Symposium on Multiple-Valued Logic
CitySendai, Jpn
Period92/5/2792/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.