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
Systems and methods for sorting particles
Conversion of 5-(chloromethyl)-2-furaldehyde into 5-methyl-2-furoic acid and derivatives thereof
Air-fuel ratio control apparatus for an internal combustion engine
Multi-layer, microporous polyolefin membrane, its production method, battery separator and battery
Systems and methods for redox flow battery scalable modular reactant storage
Method for programming non-volatile memory device and apparatuses performing the method
Synergistic fungicidal interactions of 5-fluorocytosine and other fungicides
  Randomly Featured Patents
Adaptive, predictive system for replenishing currency in ATMs
Working apparatus for construction machine
Merchandise display rack
Pharmaceutical preparation with retarding active ingredient release, method for its production and its use
Gene participating in the mechanism of secretion of esterase
Maximum likelihood sequence estimation in optical fibre communication systems
Detergent compositions containing mobile liquid active systems
Pipe scarifier
Heat exchange fin and the production method thereof
Rack for pipettes