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
Wireless subscriber managing storage of HARQ packets
Elastic wave device having a capacitive electrode on the piezoelectric substrate
Mobile phone
Pose-variant face recognition using multiscale local descriptors
Test framework of visual components in a multitenant database environment
Configurable caged ball insert for a downhole tool
  Randomly Featured Patents
Adjustable therapy table
Method of fabricating semiconductor devices employing at least one modulation doped quantum well structure and one or more etch stop layers for accurate contact formation
User space data stream parsing using TCP/IP information
User interface for a computer display
Article carrier and blank therefor
Access control system for mobile platform using electronic key-embedded location verification data
Food product
Zoom optical unit
Transcending extensions of classical south Asian musical instruments
Apparatus for converting an analogue input signal of narrow bandwidth to digital form