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
Disk-based storage device having read channel memory that is selectively accessible to disk controller
Biological information monitoring system
Neurostimulation system
Establishing a social network
Enhancement of semiconducting photovoltaic absorbers by the addition of alkali salts through solution coating techniques
Lentiviral gene transfer vectors and their medicinal applications
Silicon-on-insulator (SOI) structure configured for reduced harmonics and method of forming the structure
  Randomly Featured Patents
Methods and systems for enabling charging land-line long-distance calls to wireless subscriber's account
Circuit having hardware threading
Connection structure having a printed circuit board with a protrusion engaging a receiving portion of a second circuit board
Process for synthesis of aluminum coordinations compounds
Dithiophosphorus/amine salts
Device for collection and disposal of pet waste
Converging beam linear optical scanner
Zipper sealer machine
Automatic tape affixing apparatus
Apparatus for the direct cooling of a strand