文章基本信息

标题：Code Assignment Algorithm for Highly Parallel Multiple-Valued k-Ary Operation Circuits Using Partition Thory
本地全文：下载
作者：Michitaka KAMEYAMA ; Saneaki TAMAKI
期刊名称：Interdisciplinary Information Sciences
印刷版ISSN：1340-9050
电子版ISSN：1347-6157
出版年度：1997
卷号：3
期号：1
页码：13-24
DOI：10.4036/iis.1997.13
出版社：The Editorial Committee of the Interdisciplinary Information Sciences
摘要：Design of high-speed digital circuits such as adders and multipliers is one of the most important issues to implement high performance VLSI systems. This paper describes a code assignment algorithm for ultimately parallel multiple-valued k -ary operation circuits. Partition theory usually used in the design of sequential circuits becomes effectively employed for the fast search for code assignment problem without exhaustive procedures using logic design. We propose an efficient code assignment algorithm based on chain sets to reduce the complexity in search procedure. Experimental results and some examples are shown to demonstrate the usefulness of the algorithm.
关键词：multiple-valued digital circuits;high-speed arithmetic and logic operations;ultimately parallel k-ary operation circuits;partition theory;chain sets