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 detecting malicious code executed by virtual machine
SRAM cells using shared gate electrode configuration
Method and system for security authentication of radio frequency identification
Base station apparatus and communication control method
Developing device
Debris tray
Method and device for generating low-jitter clock
  Randomly Featured Patents
Kiln for firing and or casting prosthodontic products
Jumbo hand
Apparatus for repositioning discrete articles
Electronic chess timer
High-performance, superscalar-based computer system with out-of-order instruction execution
Buckling beam test probe assembly
Watch face
Method of cleaning a film deposition apparatus, method of dry etching a film deposition apparatus, and an article production method including a process based on the cleaning or dry etching met
Reversible electrode
Jack for a snow plow