<--- Back to Details
First PageDocument Content
Electronic engineering / Reed-Muller expansion / Function / Logic optimization / Combinatory logic / Canonical form / Binary decision diagram / Path decomposition / Asynchronous logic / Mathematics / Mathematical logic / Boolean algebra
Date: 2009-05-13 19:30:33
Electronic engineering
Reed-Muller expansion
Function
Logic optimization
Combinatory logic
Canonical form
Binary decision diagram
Path decomposition
Asynchronous logic
Mathematics
Mathematical logic
Boolean algebra

Sequential Logic Synthesis Using Symbolic Bi-Decompsition

Add to Reading List

Source URL: www.bvsrc.org

Download Document from Source Website

File Size: 252,62 KB

Share Document on Facebook

Similar Documents

Binary decision diagram / Diagrams / Model checking / Decomposition method / Reed-Muller expansion / Function / Mathematics / Boolean algebra / Mathematical logic

An Algorithm for Bi-Decomposition of Logic Functions Alan Mishchenko Bernd Steinbach Marek Perkowski

DocID: O0so - View Document

APL programming language family / Array programming languages / Computer programming / Diagrams / Binary decision diagram / Model checking / APL / K / Reed-Muller expansion / Boolean algebra / Computing / Software engineering

Minimization of Average Path Length in BDDs by Variable Reordering Shinobu NAGAYAMA1 Alan MISHCHENKO2 Tsutomu SASAO1,3

DocID: NJI7 - View Document

Electronic engineering / Reed-Muller expansion / Function / Logic optimization / Combinatory logic / Canonical form / Binary decision diagram / Path decomposition / Asynchronous logic / Mathematics / Mathematical logic / Boolean algebra

Sequential Logic Synthesis Using Symbolic Bi-Decompsition

DocID: NcH6 - View Document