@inproceedings{b776d6f0544944d890f99cca4e0dd5e0,
title = "Fast Boolean matching for field-programmable gate arrays",
abstract = "A key step in technology mapping for non lookup-table (such as multiplexor) based FPGAs is to determine whether a given function can be implemented by the logic module. A new algorithm is presented for solving this problem. The algorithm is based on a character string representation of binary decision diagrams. Such representation leads to a matching algorithm which requires only a few string comparisons for each matching operation. Comparing to the matching algorithm by searching for isomorphism on all different BDDs, the new algorithm is much faster with a modest increase of memory requirement.",
author = "Kai Zhu and Wong, {D. F.}",
year = "1993",
language = "English (US)",
isbn = "0818643528",
series = "European Design Automation Conference - Proceedings",
publisher = "Publ by IEEE",
pages = "352--357",
editor = "Anon",
booktitle = "European Design Automation Conference - Proceedings",
}