Spectral Transforms for Large Boolean Functions withApplications to Technology Mapping

Authors:
E. M. Clarke;K. L. Mcmillan;X. Zhao;M. Fujita;J. Yang
Affiliations:
School of Computer Science, Carnegie Mellon University, Pittsburgh, PA15213, U.S.A.;School of Computer Science, Carnegie Mellon University, Pittsburgh, PA15213, U.S.A.;School of Computer Science, Carnegie Mellon University, Pittsburgh, PA15213, U.S.A.;Fujitsu Laboratories of America, Santa Clara, CA 95054;Center for Integrated Systems, Stanford University, Stanford, CA 94309
Venue:
Formal Methods in System Design
Year:
1997

Citing 5
Cited 4

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Spectral Techniques in Digital Logic

Spectral Techniques in Digital Logic
The Olympus Synthesis System

IEEE Design & Test
Spectral Techniques for Technology Mapping

Spectral Techniques for Technology Mapping
Technology mapping using boolean matching and don't care sets

EURO-DAC '90 Proceedings of the conference on European design automation

Multi-Terminal Binary Decision Diagrams: An Efficient DataStructure for Matrix Representation

Formal Methods in System Design
Efficient computation of canonical form for Boolean matching in large libraries

Proceedings of the 2004 Asia and South Pacific Design Automation Conference
Efficient inclusion checking on explicit and semi-symbolic tree automata

ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
VATA: a library for efficient manipulation of non-deterministic tree automata

TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Walsh transform has numerous applications in computer-aideddesign, but the usefulness of these techniques in practice hasbeen limited by the size of the boolean functions that can betransformed. Currently available techniques limit the functionsto less than 20 variables. In this paper, we show how to computeconcise representations of the Walsh transform for functionswith several hundred variables. We have applied our techniquesto boolean technology mapping and, in certain cases, weobtained a speed up of as much as 50% for the matching phase.