Spectral transforms for large boolean functions with applications to technology mapping

The Walsh transform has numerous applications in computer-aided design, but the usefulness of these techniques in practice has been limited by the size of the boolean functions that can be transformed. Currently available techniques limit the functions to less than 20 variables. In this paper, we sh...

Full description

Saved in:
Bibliographic Details
Published in:30th ACM/IEEE Design Automation Conference pp. 54 - 60
Main Authors: Clarke, E. M., McMillan, K. L., Zhao, X, Fujita, M., Yang, J.
Format: Conference Proceeding
Language:English
Published: New York, NY, USA ACM 01-07-1993
Series:ACM Conferences
Subjects:
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The Walsh transform has numerous applications in computer-aided design, but the usefulness of these techniques in practice has been limited by the size of the boolean functions that can be transformed. Currently available techniques limit the functions to less than 20 variables. In this paper, we show how to compute concise representations of the Walsh transform for functions with several hundred variables. We have applied our techniques to boolean technology mapping and, in certain cases, we obtained a speed up of as much as 50% for the matching phase.
Bibliography:SourceType-Conference Papers & Proceedings-1
ObjectType-Conference Paper-1
content type line 25
ISBN:9780897915779
0897915771
ISSN:0738-100X
DOI:10.1145/157485.164569