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
Circuitry testing module and circuitry testing device
Method of using N-thio compounds for oligonucleotide synthesis
Toothbrush holder
Assay for the diagnosis of flaviviral infection using antibodies with high affinity for NS1 protein of flavivirusi in hexameric form
Triazole derivatives as ghrelin analogue ligands of growth hormone secretagogue receptors
Adaptive flow for thermal cooling of devices
  Randomly Featured Patents
Animal litter for animals
Cryptographic device
Hard disk drive device
Multi-phase selective mass transfer through a membrane
Voice over IP method of determining caller identification
Competition gun belt
System for ensuring encrypted communication after handover
Methods for recording and reading data from a record member having data in any one of a plurality of block formats including determining length of records being transferred
Organic el device and method for manufacturing the same
Even order distortion cancellation in single-ended input, differential output amplifiers using feedback