SMTBDD: New Form of BDD for Logic Synthesis
نویسندگان
چکیده
منابع مشابه
BDD Decomposition for Efficient Logic Synthesis
There are two major approaches to the synthesis of logic circuits. One is based on a predominantly algebraic factorization leading to AND/OR logic optimization. The other is based on classical Reed-Muller decompositionmethod and its related decision diagrams, which have been shown to be efficient for XOR-intensive arithmetic functions. Both approaches share the same characteristics: while one i...
متن کاملBDD-Based Synthesis of Reversible Logic
Reversible logic became a promising alternative to traditional circuits because of its applications in emerging technologies such as quantum computing, low-power design, DNA computing, or nanotechnologies. As a result, synthesis of the respective circuits is an intensely studied topic. However, most synthesis methods are limited, because they rely on a truth table representation of the function...
متن کاملLogic Synthesis for Cellular Architecture FPGA using BDD
Gueesang Lee Dept. of Computer Science The Chonnam National University Kwangju, Korea (Tel)082-62-520-6895, (FAX)082-62-524-0020 e-mail [email protected] Abstract| In this paper, an e cient approach to the synthesis of CA(Cellular Architecture)-type FPGAs is presented. To exploit the array structure of cells in CA-type FPGAs, logic expressions called Maitra terms, which can be mapped ...
متن کاملan application of fuzzy logic for car insurance underwriting
در ایران بیمه خودرو سهم بزرگی در صنعت بیمه دارد. تعیین حق بیمه مناسب و عادلانه نیازمند طبقه بندی خریداران بیمه نامه براساس خطرات احتمالی آنها است. عوامل ریسکی فراوانی می تواند بر این قیمت گذاری تاثیر بگذارد. طبقه بندی و تعیین میزان تاثیر گذاری هر عامل ریسکی بر قیمت گذاری بیمه خودرو پیچیدگی خاصی دارد. در این پایان نامه سعی در ارائه راهی جدید برای طبقه بندی عوامل ریسکی با استفاده از اصول و روش ها...
BDD-based Logic Partitioning for Sequential Circuits
This paper presents a BDD-based approach to perform logic partitioning for sequential circuits. We use a sequential machine to model a circuit and represent the machine by its transition relation. A heuristic algorithm based on the BDD representation of the transition relation is proposed to partition the sequential machine with minimum number of input/output pins. Using BDDs and their operat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Electronics and Telecommunications
سال: 2016
ISSN: 2300-1933
DOI: 10.1515/eletel-2016-0004