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
본 논문에서는 LUT(Look-up Table) 네트워크를 합성하기 위한 새로운 프레임워크를 제시합니다. 기존 LUT 네트워크 합성 방법 중 일부는 하나 또는 두 가지를 기반으로 합니다. 기능의 (부울) 분해. 우리의 방법도 기능적 분해를 사용하지만, 다음을 포함하는 다양한 분해 방법을 사용하려고 합니다. 대수적 분해. 따라서 이 방법은 다양한 분해 방법을 통합하여 LUT 네트워크를 합성하기 위한 일반적인 프레임워크로 생각할 수 있습니다. 우리는 비용 데이터베이스 파일 이는 우리 방법의 독특한 특징입니다. 또한 우리의 방법과 잘 알려진 일부 LUT 네트워크 합성 방법을 비교하고 배치 및 라우팅 후 최종 결과를 평가합니다. 우리의 방법은 본질적으로 다소 경험적이지만 실험 결과는 고무적입니다.
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.
부
Shigeru YAMASHITA, Hiroshi SAWADA, Akira NAGOYA, "A General Framework to Use Various Decomposition Methods for LUT Network Synthesis" in IEICE TRANSACTIONS on Fundamentals,
vol. E84-A, no. 11, pp. 2915-2922, November 2001, doi: .
Abstract: This paper presents a new framework for synthesizing look-up table (LUT) networks. Some of the existing LUT network synthesis methods are based on one or two functional (Boolean) decompositions. Our method also uses functional decompositions, but we try to use various decomposition methods, which include algebraic decompositions. Therefore, this method can be thought of as a general framework for synthesizing LUT networks by integrating various decomposition methods. We use a cost database file which is a unique characteristic in our method. We also present comparisons between our method and some well-known LUT network synthesis methods, and evaluate the final results after placement and routing. Although our method is rather heuristic in nature, the experimental results are encouraging.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e84-a_11_2915/_p
부
@ARTICLE{e84-a_11_2915,
author={Shigeru YAMASHITA, Hiroshi SAWADA, Akira NAGOYA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A General Framework to Use Various Decomposition Methods for LUT Network Synthesis},
year={2001},
volume={E84-A},
number={11},
pages={2915-2922},
abstract={This paper presents a new framework for synthesizing look-up table (LUT) networks. Some of the existing LUT network synthesis methods are based on one or two functional (Boolean) decompositions. Our method also uses functional decompositions, but we try to use various decomposition methods, which include algebraic decompositions. Therefore, this method can be thought of as a general framework for synthesizing LUT networks by integrating various decomposition methods. We use a cost database file which is a unique characteristic in our method. We also present comparisons between our method and some well-known LUT network synthesis methods, and evaluate the final results after placement and routing. Although our method is rather heuristic in nature, the experimental results are encouraging.},
keywords={},
doi={},
ISSN={},
month={November},}
부
TY - JOUR
TI - A General Framework to Use Various Decomposition Methods for LUT Network Synthesis
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2915
EP - 2922
AU - Shigeru YAMASHITA
AU - Hiroshi SAWADA
AU - Akira NAGOYA
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E84-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 2001
AB - This paper presents a new framework for synthesizing look-up table (LUT) networks. Some of the existing LUT network synthesis methods are based on one or two functional (Boolean) decompositions. Our method also uses functional decompositions, but we try to use various decomposition methods, which include algebraic decompositions. Therefore, this method can be thought of as a general framework for synthesizing LUT networks by integrating various decomposition methods. We use a cost database file which is a unique characteristic in our method. We also present comparisons between our method and some well-known LUT network synthesis methods, and evaluate the final results after placement and routing. Although our method is rather heuristic in nature, the experimental results are encouraging.
ER -