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
Method for assisting in the checking of transaction records, transaction device, server, mobile terminal, and corresponding computer programs
Secure Flash-based memory system with fast wipe feature
Audio signal clip detection
Process for producing dipeptides or dipeptide derivatives
Data distribution unit for vehicle entertainment system
Manufactured product configuration
Method for generating multi-antenna signals
  Randomly Featured Patents
Method and apparatus for reducing interference
Method of forming a turbine shell of a torque converter by press working
Relay server and relay communication system
Liquid water loss reducing additives for cement slurries
Photo-transistor in MOS thin-film technology and method for production and operation thereof
Dual diode microwave amplifier
High strength, Bio-compatible tissue adhesive and methods for treating vigorously bleeding surfaces
System and an associated method for operating and monitoring an automation system by means of virtual installation models
Multi-session connection across a trust boundary
Method and apparatus for transmitting and receiving high speed data using code division multiple access channels