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
Plants and seeds of hybrid corn variety CH424126
Wideband multi-channel receiver with fixed-frequency notch filter for interference rejection
Systems and methods for tracking mobile terrestrial terminals for satellite communications
Mineral, nutritional, cosmetic, pharmaceutical, and agricultural compositions and methods for producing the same
Information recording medium and information processing method for accessing content with license or copyright protection
Light-emitting device package and method of manufacturing the same
Switch redundancy in systems with dual-star backplanes
  Randomly Featured Patents
Actuator load path monitoring system
Cleaning pad
Method and apparatus for detecting items on the bottom tray of a cart
Methods and compositions for treating ophthalmic conditions with retinyl derivatives
Process of fabricating memory cell with a switching transistor and a trench-stacked capacitor coupled in series
Interlock for a seat recliner mechanism
Dicot plants containing an antisense polygalacturonase gene segment
Holder armature for an interchangeable measuring probe
Liquid-crystal display television
Electrical contact element