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
Methods and apparatus for intelligent selection of goods and services in mobile commerce
Systems and methods for redox flow battery scalable modular reactant storage
Lightning-protective explosion-preventive fastener
Use of cocoa extract
Sonic fast-sync system and method for bluetooth
Fail-safe upgrading of portable electronic device software
  Randomly Featured Patents
Method of making ultra dense dram cells
Method and apparatus for lubricating a transmission
Coil system and method for obtaining volumetric physiological measurements
High event rate gamma camera
Method and apparatus for coverage and throughput enhancement in a wireless communication system
Wind shield attachment for a motorcycle handlebar
Trisazo-dyes with a pyrazolyl end group and their use in ink-jet printing
Method and apparatus for calibrating an optical computer input system
Apparatus for assisting in the use of chopsticks and method for making same
Method for preparing optically flat damage-free surfaces