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
Circuit arrangement having a load transistor and a voltage limiting circuit and method for driving a load transistor
Method and system for controlled media sharing in a network
Methods and systems to accomplish variable width data input
Resist composition and method for producing resist pattern
Method and apparatus to maintain welding current to compensate for deterioration of welding contact tip
Electric power steering apparatus
  Randomly Featured Patents
Game board
Containment aisle door
Buffing apparatus
Thrombectomy and soft debris removal device
Hydraulically driven working vehicle and hydraulic transaxle
Information storage and retrieval device provided with shock-absorbing mechanism
Silicone elastomer compositions
Chip scale surface mounted semiconductor device package and process of manufacture
Medicating floss dispenser and method of applying medication to human teeth
2(1H)-quinolone compounds