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
Antimicrobial polysiloxane materials containing metal species
Methods of enhancing diabetes resolution
Systems and methods for classifying electronic information using advanced active learning techniques
Starch networks as absorbent or superabsorbent materials and their preparation by extrusion
Compact bus bar assembly, switching device and power distribution system
Terminal and method of controlling the same
Hydrogenolysis of ethyl acetate in alcohol separation processes
  Randomly Featured Patents
Drum combined with a cover
Gaming method and device involving progressive wagers
Method and system for enterprise search navigation
Electronic blasting capsule
Side wall for reactor for manufacturing semiconductor
Short and long sequence boundary detection algorithm for wireless LAN modems
Reducing radius slide feature
Process and apparatus for measuring differences in the concentrations of paramagnetic components of gases
System for controlling cryogenic fluid flow rate and Joule-Thomson effect cooler comprising same