TY - GEN
T1 - Code assignment algorithm for highly parallel multiple-valued combinational circuits
AU - Tamaki, Saneaki
AU - Kameyama, Michitaka
AU - Higuchi, Tatsuo
PY - 1992/5/1
Y1 - 1992/5/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0026868932&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0026868932&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:0026868932
SN - 0818626801
T3 - Proceedings of The International Symposium on Multiple-Valued Logic
SP - 382
EP - 388
BT - Proceedings of The International Symposium on Multiple-Valued Logic
PB - Publ by IEEE
T2 - Proceedings of the 22nd International Symposium on Multiple-Valued Logic
Y2 - 27 May 1992 through 29 May 1992
ER -