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
Weight-balanced polygonal mirror, light scanning unit using the polygonal mirror, and image forming apparatus
Liquid crystal panel and liquid crystal display
Locking flange
Methods, devices and computer program products providing for establishing a model for emulating a physical quantity which depends on at least one input parameter, and use thereof
Stacked structure and stacked method for three-dimensional chip
Systems and methods for processing supplemental information associated with media programming
Systems and methods for automobile accident claims initiation
  Randomly Featured Patents
Using serving area identification in a mixed access network environment
Plug connector
Method for preparing random-fiber thermoset composites
Corner caddy
Dendritic polymers with enhanced amplification and interior functionality
Micro-structure phosphor coating
Holographic lenticular screen stereoscopic avoinics display apparatus
Electrostatic dust separator
Engine limit control for closed-throttle transmission shifting
Pyran derivatives and their use as inhibitors of 5-lipoxygenase