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
Non-zero rounding and prediction mode selection techniques in video encoding
Circuit and method for generating an AC voltage from a plurality of voltage sources having a temporally variable DC output voltage
Compression molding method and reinforced thermoplastic parts molded thereby
Production of battery grade materials via an oxalate method
Droplet generation and detection device, and droplet control device
Display for gloves
Fabric care compositions comprising front-end stability agents
  Randomly Featured Patents
Light-source multiplication device
Signature device, signature verification device, anonymous authetication system, signing method, signature authentication method, and programs therefor
1-(4-quinolyl)-2 or 3-(4-piperidyl)-ethanamine and -propanamine derivatives, and their use
Compact disc storage unit
Pipelined packet encapsulation and decapsulation for temporal key integrity protocol employing arcfour algorithm
Phase locked loop unlock detector
Method of preparing a transparency having a hot melt ink pattern
Tree watering ornament
Retraction methods using endoscopic inflatable retraction devices
Conductive rubber member