The Community for Technology Leaders
RSS Icon
Subscribe
Kohala Coast, HI, USA
Jan. 9, 1998 to Jan. 9, 1998
ISBN: 0-8186-8255-8
pp: 179
Takayuki Suyama , NTT Communication Science Laboratories
Makoto Yokoo , NTT Communication Science Laboratories
Hiroshi Sawada , NTT Communication Science Laboratories
ABSTRACT
This paper presents new results on an approach for solving satisfiability problems (SAT), i.e. creating a logic circuit that is specialized to solve each problem instance on Field Programmable Gate Arrays (FPGAs). This approach becomes feasible due to the recent advances in FPGAs and high-level logic synthesis. In this approach, each SAT problem is automatically analyzed and implemented on FPGAs. We have developed an algorithm which is suitable for implementing on a logic circuit. This algorithm is equivalent to the Davis-Putnam procedure with a powerful dynamic variable ordering heuristic. The algorithm does not have a large memory structure like a stack; thus sequential accesses to the memory do not become a bottleneck in algorithm execution. Simulation results show that this method can solve a hard random 3-SAT problem with 400 variables within 20 minutes at a clock rate of 1MHz.
CITATION
Takayuki Suyama, Makoto Yokoo, Hiroshi Sawada, "Solving Satisfiability Problems Using Logic Synthesis and Reconfigurable Hardware", HICSS, 1998, Proceedings of the Thirty-First Hawaii International Conference on System Sciences, Proceedings of the Thirty-First Hawaii International Conference on System Sciences 1998, pp. 179, doi:10.1109/HICSS.1998.649212
23 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool