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
Antenna support device
Wireless enclosure
Method and apparatus for communicating electronic service guide information in a satellite television system
Starch networks as absorbent or superabsorbent materials and their preparation by extrusion
Canine iPS cells and method of producing same
Configurable pitch reducing optical fiber array
  Randomly Featured Patents
Method for treatment of chronic neuropathic pain
Table model napkin dispenser
Auxiliary cab lift spring
Method of comminuting reactive metals
X-ray source provided with a liquid metal target
Oil separating device, especially for crankcase venting in an internal combustion engine
Maize variety hybrid X7W906
Method for supply of constant-concentration ozonated water
Pre-engineered failure link for brush shaft
Semiconductor device having an increased area of one of the opposing electrode parts for preventing generation of unconnected positions the electrodes on the bonded wafers