Time-division multiplexing realizations of multiple-output functions based on shared multi-terminal multiple-valued decision diagrams

作     者：Babu, H Sasao, T 

作者机构：Kyushu Inst Technol Dept Comp Sci & Elect Iizuka Fukuoka 8208502 Japan 

出 版 物：《IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS》 (IEICE Trans Inf Syst)

年 卷 期：1999年第E82D卷第5期

页      面：925-932页

核心收录：

学科分类：0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 0835[工学-软件工程] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：multiple-valued decision diagram (MDD) multiple valued logic multiple-output function time-division multiplexing (TDM) 

摘      要：This paper considers methods to design multiple-output networks based on decision diagrams (DDs). TDM (time-division multiplexing) systems transmit several signals on a single line. These methods reduce: 1) hardware;2) logic levels;and 3) pins. In the TDM realizations, we consider three types of DDs: shared binary decision digrams (SBDDs), shared multiple-valued decision diagrams (SMDDs), and shared multiterminal multiple-valued decision diagrams (SMTMDDs). In the network, each non-terminal node of a DD is realized by a multiplexer (MUX). We propose heuristic algorithms to derive SMTMDDs from SBDDs. We compare the number of non-terminal nodes in SBDDs, SMDDs, and SMTMDDs. For nrm n, log n, and for many other benchmark functions, SMTMDD-based realizations are more economical than other ones, where nrm n is a (2n)-input (n + 1)-output function computing [root(X-2+Y-2) + 0.5],log n is an n-input n-output function computing [(2(n)-1)log(x+1)/nlog2], and /a/ denotes the largest integer not greater than a.