Resources Contact Us Home
Reconfigurable hardware accelerator for boolean satisfiability solver

Image Number 7 for United States Patent #8131660.

A hardware accelerator is provided for Boolean constraint propagation (BCP) using field-programmable gate arrays (FPGAs) for use in solving the Boolean satisfiability problem (SAT). An inference engine may perform implications. Block RAM (BRAM) may be used to store SAT instance information. Computation may be co-located with the BRAM memory, taking advantage of the high on-chip bandwidth and low latency of an FPGA. SAT instances may be partitioned into multiple groups that can be processed by multiple inference engines in parallel. New SAT instances can be inserted into FPGA without invoking the time-consuming FPGA re-synthesizing process.

  Recently Added Patents
Capacitance sensing
Acoustic reconfiguration devices and methods
Handling errors in a data processing system
Electric train drive control device
Detecting patterns of abuse in a virtual environment
Measuring current and resistance using combined diodes/resistor structure to monitor integrated circuit manufacturing process variations
Satellite mounting pole
  Randomly Featured Patents
Can selector bar assembly
Isoxazolidinedione derivatives and use thereof
Bandana head-protector using fabric and closed-cell foam
Rendering and navigating photographic panoramas with depth information in a geographic information system
Knock-out systems for foundries
Silicon condenser microphone and manufacturing method
Devices with graphene layers
Yoked chop sticks
Overhead loader and related mechanisms for high speed automatic lathes and the like
Crucible and method of preparation thereof