An Architecture for Solving Boolean Satisfiability Using Runtime Configurable Hardware

  • Authors:
  • C. K. Chung

  • Affiliations:
  • -

  • Venue:
  • ICPP '99 Proceedings of the 1999 International Workshops on Parallel Processing
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

An architecture is proposed for a forward checking tree search which is used for solving satisfiability problems. In this design, the FPGA on-chip RAM feature is used to achieve a large improvement in density over a straight forward implementation using configurable logic blocks, enabling much larger problems to be solved. In addition, the boolean function to be satisfied is runtime configurable. A prototype implementation of the design operated success-fully at 10MHz for a 50 variable, 80 clause 3-SAT problem.