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
Process for preventing polymerization of cracked volatile products during pyrolysis and gasification
Systems and methods for detecting and rejecting defective absorbent articles from a converting line
Leaky wave mode solar receiver
Spectral sensor for checking documents of value
Method and system for reciprocal mixing cancellation of wideband modulated blockers
Nanocatalysts structure, process for the preparation and use thereof
Method for olympic event hospitality program management
  Randomly Featured Patents
Chemical intermediates bearing a trifluoromethyl group
Apparatus, systems and methods relating to improved lighting and notifications in a computing system
Treatment of mood disorders with functional antagonists of the glycine/NMDA receptor complex
Enantiomeric resolution
Protective sheath for catheter balloons
Control device for a work device comprising a scoop held on an extension arm
Hickory smoke barbecue oven
Reduced complexity and blur technique for an electronic lighting system
Compressed gas regulator with flow control and internal gauge
Rake for moving bubbles in a waterbed