Exploiting symmetry in SAT-based boolean matching for heterogeneous FPGA technology mapping

The Boolean matching problem is a key procedure in technology mapping for heterogeneous field programmable gate arrays (FPGA), and SAT-based Boolean matching (SAT-BM) provides a highly flexible solution for various FPGA architectures. However, the computational complexity of state-of-the-art SAT-BM...

Full description

Saved in:
Bibliographic Details
Published in:2007 IEEE/ACM International Conference on Computer-Aided Design pp. 350 - 353
Main Authors: Yu Hu, Shih, V., Majumdar, R., Lei He
Format: Conference Proceeding
Language:English
Published: IEEE 01.11.2007
Subjects:
Circuits
Computational complexity
Computer architecture
Encoding
Field programmable gate arrays
Logic devices
Programmable logic arrays
Runtime
Space technology
Table lookup
ISBN:1424413818, 9781424413812
ISSN:1092-3152
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The Boolean matching problem is a key procedure in technology mapping for heterogeneous field programmable gate arrays (FPGA), and SAT-based Boolean matching (SAT-BM) provides a highly flexible solution for various FPGA architectures. However, the computational complexity of state-of-the-art SAT-BM prohibits its application practically. In this paper we propose an efficient SAT-BM algorithm by exploring function and architectural symmetries. While the most recent work obtained up to 13times speedup, we achieve up to 200times speedup, when both are compared to the original SAT-BM algorithm.
ISBN:1424413818
9781424413812
ISSN:1092-3152
DOI:10.1109/ICCAD.2007.4397289