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
Regulating a supply voltage provided to a load circuit
Method and apparatus for diagnosing faults in a hybrid internet protocol network
Horse stationary tab
3D image generating method, 3D animation generating method, and both 3D image generating module and 3D animation generating module thereof
Facility to reuse paper
Lighting control device and lighting control method
Method for automatically estimating inertia in a mechanical system
  Randomly Featured Patents
Identifying or locating waveguides
Nonaqueous electrolyte secondary battery
Low profile filter
Treatment of staphylococcus infections
Fixed length packet multiplexer of universal data with burst characteristic at low speed
Miniature hair trimmer
Plants and seeds of corn variety CV267821
Telephone set
Thermoelectric heat exchanger
Multiple layer absorbent cores for absorbent articles