Investigation of Solution Space of Trees and DAGs for Realization of Combinational Logic in AT 6000 series FPGAs
Various tree and Directed Acyclic Graph structures have been used for representation and manipulation of switching functions. Among these structures the Binary Decision DiagramJilave been the most widely used in logic synthesis. A BDD is a binary tree graph that represents the recursive execution of...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
PDXScholar
1993
|
| Subjects: | |
| Online Access: | https://pdxscholar.library.pdx.edu/open_access_etds/4586 https://pdxscholar.library.pdx.edu/cgi/viewcontent.cgi?article=5657&context=open_access_etds |