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
Arrays of optical confinements and uses thereof
Liquid-filled protein-phosphatidic acid capsule dispersions
Monitoring and correcting upstream packet loss
Method for improving the performance of browser-based, formula-driven parametric objects
Method for programming non-volatile memory device and apparatuses performing the method
Methods and systems to accomplish variable width data input
  Randomly Featured Patents
Fixing member, fixing device, and image forming apparatus
Menu system
Process for utilizing certain gel compositions for electrical stimulation
Putter having plastic insert
Test socket, and test apparatus with test socket to control a temperature of an object to be tested
Thermoplastic orthopedic brace and method of manufacturing same
Hyper-ring oscillator
Proteinaceous animal chew with dentally therapeutic cation
Epoxy resin composition and semiconductor device
System for generating energy from tidal activity