lterated function systems have been applied as a means of shape representation and generation. This paper describes how they may be applied in a similar manner to graphs. Although the study is in its early stages, it is anticipated that this means of representation will offer a range of new techniqu
Boolean function representation and spectral characterization using AND/OR graphs
✍ Scribed by A. Žužek; R. Drechsler; M.A. Thornton
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 301 KB
- Volume
- 29
- Category
- Article
- ISSN
- 0167-9260
No coin nor oath required. For personal study only.
✦ Synopsis
Methods based on AND/OR graph representations of Boolean relations provide a promising new way of approaching VLSI CAD design automation problems. AND/OR graphs can represent any Boolean network and they allow for systematic reasoning through the application of the technique of recursive learning. An approach to build and analyze AND/OR graphs that makes use of hashing techniques in a way similar to that for modern Decision Diagram (DD) packages is described. Additionally, the problem of extracting spectral information from AND/OR graphs is also examined. Spectral information can be used for many CAD system tasks including synthesis, veri"cation and test vector generation. It is shown that spectral information may be calculated directly from output probabilities and a method for estimating output probabilities from AND/OR graphs is presented. Experimental results regarding the AND/OR graph package e$ciency and the extraction of spectral information are provided.
📜 SIMILAR VOLUMES