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
Thermoplastic resin composition
Triple-action pest control formulation and method
Nonvolatile semiconductor memory device and method of manufacturing the same
Method and apparatus for verifiable generation of public keys
Bread basket
System and method for computational unification of heterogeneous implicit and explicit processing elements
  Randomly Featured Patents
Early diagnosis of conformational diseases
Method and apparatus for maintaining packet order integrity in parallel switching engine
Methods of processing a wireless communication signal, wireless communication synchronization methods, and a radio frequency identification device communication method
Method for preparation of polyolefin oil
Pipe manifold, especially for supply and return of hot water heaters
Measuring device with a test tape cassette
Bio-rhythm wrist watch
Position guiding method and system using sound changes
Substrate for manufacturing single crystal thin films