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
Message value indicator
Organic light-emitting display with black matrix
Method of creating animatable digital clone from multi-view images
Antitumoral compounds
Variable delay line for delay locked loop
Multipoint photonic doppler velocimetry using optical lens elements
Method and system for filtering noises in an image scanned by charged particles
  Randomly Featured Patents
Adjustable book stand
Cordless blind brake
Electronic design protection circuit
Optical disk system with laser safety arrangement
Low capacitance, low kickback noise input stage of a multi-level quantizer with dithering and multi-threshold generation for a multi-bit sigma-delta modulator
Devices comprising multiple capillarity inducing surfaces
Planet guide roller feed arrangement for melting welding wires
Torque responsive rotation control device
Biodegradable material for audio systems