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
Quaternary chalcogenide wafers
Magnetic reading and writing device
Pet cremation urn
Authentication method
Support tray for server
Simultaneous image distribution and archiving
Detachably integrated battery charger for mobile cell phones and like devices
  Randomly Featured Patents
Wait state generator circuit and method to allow asynchronous, simultaneous access by two processors
Magnetic component
Arrangement for straightening damaged vehicle bodies
Plastid transformation of Brassica
Metal acetylacetonate latent accelerators for an epoxy-styrene resin system
LDMOS transistor with asymmetric spacer as gate
Treatment of balance impairments
Antenna sharing device
Motor drive control device
Vehicular headlight axis control device