Resources Contact Us Home
Reconfigurable hardware accelerator for boolean satisfiability solver

Image Number 3 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
Semiconductor device with an amorphous semi-insulating layer, temperature sensor, and method of manufacturing a semiconductor device
Disposable and tamper-resistant RFID lock
Fabrication method of packaging substrate having through-holed interposer embedded therein
Systems and methods for parameter adaptation
Asymmetric switching rectifier
Scalable packet processing systems and methods
  Randomly Featured Patents
Hybrid multicast switch employing network-layer routing
Mosaic image collector including an embedded atomic clock
Within-distance query pruning in an R-tree index
Spontaneous preparation of small unilamellar liposomes
Methods and compositions for using non-ionic contrast agents to reduce the risk of clot formation in diagnostic procedures
Electron emission device with auxiliary electrode and manufacturing method thereof
Product dispenser
Magnetic compass
Fan blade cleaner apparatus
Inflatable boat having self-inflation system