Time-Division Multiplexing Realizations of Multiple-Output Functions Based on Shared Multi-Terminal Multiple-Valued Decision Diagrams

Hafiz Md. HASAN BABU; Tsutomu SASAO

Time-Division Multiplexing Realizations of Multiple-Output Functions Based on Shared Multi-Terminal Multiple-Valued Decision Diagrams

Hafiz Md. HASAN BABU, Tsutomu SASAO

Full Text Views

0

Cite this

Summary :

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 multi-terminal 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 (n1)-output function computing (X²+Y²)+0.5, log n is an n-input n-output function computing (2ⁿ1)log(x1)/nlog2, and a denotes the largest integer not greater than a.

Publication: IEICE TRANSACTIONS on Information Vol.E82-D No.5 pp.925-932

Publication Date: 1999/05/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Issue on Multiple-Valued Logic and Its Applications)

Category: Logic Design

Cite this

Copy

Hafiz Md. HASAN BABU, Tsutomu SASAO, "Time-Division Multiplexing Realizations of Multiple-Output Functions Based on Shared Multi-Terminal Multiple-Valued Decision Diagrams" in IEICE TRANSACTIONS on Information, vol. E82-D, no. 5, pp. 925-932, May 1999, doi: .
Abstract: 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 multi-terminal 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 (n1)-output function computing (X²+Y²)+0.5, log n is an n-input n-output function computing (2ⁿ1)log(x1)/nlog2, and a denotes the largest integer not greater than a.
URL: https://global.ieice.org/en_transactions/information/10.1587/e82-d_5_925/_p

Copy

@ARTICLE{e82-d_5_925,
author={Hafiz Md. HASAN BABU, Tsutomu SASAO, },
journal={IEICE TRANSACTIONS on Information},
title={Time-Division Multiplexing Realizations of Multiple-Output Functions Based on Shared Multi-Terminal Multiple-Valued Decision Diagrams},
year={1999},
volume={E82-D},
number={5},
pages={925-932},
abstract={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 multi-terminal 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 (n1)-output function computing (X²+Y²)+0.5, log n is an n-input n-output function computing (2ⁿ1)log(x1)/nlog2, and a denotes the largest integer not greater than a.},
keywords={},
doi={},
ISSN={},
month={May},}

Copy

TY - JOUR
TI - Time-Division Multiplexing Realizations of Multiple-Output Functions Based on Shared Multi-Terminal Multiple-Valued Decision Diagrams
T2 - IEICE TRANSACTIONS on Information
SP - 925
EP - 932
AU - Hafiz Md. HASAN BABU
AU - Tsutomu SASAO
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E82-D
IS - 5
JA - IEICE TRANSACTIONS on Information
Y1 - May 1999
AB - 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 multi-terminal 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 (n1)-output function computing (X²+Y²)+0.5, log n is an n-input n-output function computing (2ⁿ1)log(x1)/nlog2, and a denotes the largest integer not greater than a.
ER -