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
Secure data exchange for processing requests
Image sensing apparatus and method of controlling the image sensing apparatus
Anti-fake battery pack and identification system thereof
Credit flow control scheme in a router with flexible link widths utilizing minimal storage
Automatic engine oil life determination with a factor for oil quality
Method of fabricating crystal unit, crystal unit fabrication mask, and crystal unit package
Semiconductor device including a clock generating circuit for generating an internal signal having a coarse delay line, a fine delay line and a selector circuit
  Randomly Featured Patents
Foldable table
Hammer mill for crushing ore and the like materials
Double suction unit
Apparatus and method for winding a toroidal magnetic core onto a bobbin for a toroidal transformer
Optical assembly comprising optical fiber coupling means
Effluent gas stream treatment system having utility for oxidation treatment of semiconductor manufacturing effluent gases
Electrical connector with first and second terminal assemblies
Marking machine
Process for preparing polyamide film