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
Taste receptors of the T1R family from domestic cat
Newly identified human rhinovirus of HRV-C and methods and kits for detecting HRV-Cs
Securing information by hiding identity on a computing device
System and method for investing public deposits
Fuel cell support structure
Pyridylphenyl compounds for inflammation and immune-related uses
LO generation with deskewed input oscillator signal
  Randomly Featured Patents
Two stage pump assembly
Panels with coupling means
Method of producing a multilayered prosthesis material and the material obtained
Accounting of data transmission costs in a mobile radio/telephone network
Image signal processor, image signal processing method for use in the same, and program
Energy efficient motor brake
Reduced noise fan exit guide vane configuration for turbofan engines
Method and device for producing a homogenous sheet of quartz glass without streaks
Process for treating gas with ultra-lean amine
Woven or knitted polyester multifilament fabric