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
System and method for employing signoff-quality timing analysis information concurrently in multiple scenarios to reduce dynamic power in an electronic circuit and an apparatus incorporating t
Field emission cathode device and field emission display using the same
Anti-GITR antibodies
Remote device pairing setup
System and method for detecting an earth ground fault of an external power supply connected to a vehicle
Electrode and method for manufacturing the same
Method for producing SOI substrate and SOI substrate
  Randomly Featured Patents
Proteins and nucleic acids encoding same
Method and apparatus for pricing a commodity
Method and apparatus for providing push-to-talk services in a cellular communication system
Revolving weight lifting bar
Electronically variable power control in microstrip line fed antenna systems
Branch connector device for a shielded cable
Sulfonylalkanoylamino hydroxyethylamimo sulfonamides useful as retroviral protease inhibitors
Interlocking structural members employing transverse locking means
Devices and methods for detecting analytes
Wide ergonomic trigger for a trigger sprayer