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
Integrated transmit/receive switch
Display apparatus and control method thereof
Cake knife handle
Electronic component mounting machine and operating instruction method for the same
Smooth silicon-containing films
Biomarker for Barrett's Oesophagus
Method of manufacturing nitride semiconductor and nitride semiconductor element
  Randomly Featured Patents
Methods for enhanced production of tissue plasminogen activator in cell culture using alkanoic acids or salts thereof
Light-duty diesel catalysts
Osmotic delivery system with membrane plug retention mechanism
Pickup truck
Methods of forming NAND flash memory with fixed charge
Residue number system shift accumulator decoder
Collapsible freight container for air transport
Method for applying a weld overlay to a wastage susceptible structure
Removable stylet for retrograde cardioplegia catheter and methods for use
Method for removing amine from oil