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
Data output apparatus and data output method
System and method for providing radio communication in a land mobile radio system
Codeword-enhanced peer-to-peer authentication
Methods and systems for flicker correction
High-density 3-dimensional structure
Assigning runtime artifacts to software components
Method and apparatus for communication channel error rate estimation
  Randomly Featured Patents
Bag dispensing package
Process for the continuous production of aryl carbonates
Analysis of biological targets using a biochip comprising a fluorescent marker
U-bolt clamp saddle
Apparatus and method for monitoring contact pressure between body parts and contact surfaces
Systems and methods for finding log files generated by a distributed computer
Process and apparatus for decorating articles
Multilayer inductor with shielding plane
Composite speaker
Toner concentration sensor assembly for electro-photographic apparatus