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
Vehicle wheel
Handling errors in a data processing system
Utilizing virtually stored media snapshots for rasterizing print jobs
Sensor controller, navigation device, and sensor control method
Device and method for generating soft tissue contrast images
Sign language keyboard and sign language searching apparatus using the same
  Randomly Featured Patents
Apparatus for inverse discrete cosine transform
Process for sweetening petroleum cuts without regular addition of alkaline solution using a basic solid catalyst
Dish rack
Data file management system and method for browsers
Sliding roofs for automobiles
Process for the synthesis of crystalline powders of perovskite compounds
Method of regulating combustion in the combustion chambers of an internal combustion engine
Pushbutton structure of keyboard
Simultaneous transmission of speech and data on a mobile communications system
Substrate embedded with passive device