The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
이 문서에서는 의사결정 다이어그램(DD)을 기반으로 다중 출력 네트워크를 설계하는 방법을 고려합니다. TDM(시분할 다중화) 시스템은 단일 회선에서 여러 신호를 전송합니다. 이러한 방법을 사용하면 다음이 줄어듭니다. 1) 하드웨어; 2) 논리 레벨; 및 3) 핀. TDM 구현에서는 공유 이진 결정 다이어그램(SBDD), 공유 다중 값 결정 다이어그램(SMDD) 및 공유 다중 터미널 다중 값 결정 다이어그램(SMTMDD)의 세 가지 유형의 DD를 고려합니다. 네트워크에서 DD의 각 비종단 노드는 멀티플렉서(MUX)에 의해 구현됩니다. 우리는 SBDD에서 SMTMDD를 파생시키는 경험적 알고리즘을 제안합니다. SBDD, SMDD 및 SMTMDD의 비단말 노드 수를 비교합니다. nmm의 경우 n, 통나무 n, 그리고 다른 많은 벤치마크 기능의 경우 SMTMDD 기반 구현은 nrm이 다른 것보다 더 경제적입니다. n (2n)-입력(n
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
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 (n
URL: https://global.ieice.org/en_transactions/information/10.1587/e82-d_5_925/_p
부
@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 (n
keywords={},
doi={},
ISSN={},
month={May},}
부
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 (n
ER -