Boolean matching algorithms

The authors consider the problem of detecting the equivalence of two single-output Boolean functions, considering the permutation and complementation of their inputs, complementation of outputs, and associated don't-care sets, which is often referred to as the Boolean matching problem. Boolean...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:1993 International Symposium on VLSI Technology, Systems, and Applications Proceedings of Technical Papers s. 44 - 48
Hlavní autoři: Chen, K.-C., Yang, J.C.-Y.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 1993
Témata:
Algorithm design and analysis
Boolean functions
Libraries
Logic design
Smoothing methods
Terminology
Testing
ISBN:0780309782, 9780780309784
ISSN:1524-766X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The authors consider the problem of detecting the equivalence of two single-output Boolean functions, considering the permutation and complementation of their inputs, complementation of outputs, and associated don't-care sets, which is often referred to as the Boolean matching problem. Boolean matching is a verification problem, and it has important applications in logic synthesis problems such as technology-mapping. Several new approaches are presented for solving the Boolean matching problem. The features and efficiency of these algorithms are discussed. The author also compare with an existing Boolean matching algorithm by applying them to the technology-mapping of cell based designs.< >
ISBN:0780309782
9780780309784
ISSN:1524-766X
DOI:10.1109/VTSA.1993.263624