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
Kertas kerja ini membentangkan rangka kerja baharu untuk mensintesis rangkaian jadual carian (LUT). Beberapa kaedah sintesis rangkaian LUT sedia ada adalah berdasarkan satu atau dua berfungsi (Boolean) penguraian. Kaedah kami juga menggunakan penguraian berfungsi, tetapi kami cuba menggunakan pelbagai kaedah penguraian, yang termasuk penguraian algebra. Oleh itu, kaedah ini boleh dianggap sebagai rangka kerja umum untuk mensintesis rangkaian LUT dengan mengintegrasikan pelbagai kaedah penguraian. Kami menggunakan a fail pangkalan data kos yang merupakan ciri unik dalam kaedah kami. Kami juga membentangkan perbandingan antara kaedah kami dan beberapa kaedah sintesis rangkaian LUT yang terkenal, dan menilai keputusan akhir selepas penempatan dan penghalaan. Walaupun kaedah kami agak heuristik, keputusan eksperimen adalah menggalakkan.
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.
Salinan
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
Salinan
@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},}
Salinan
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 -