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
Lubricating oil compositions
Protecting a gaming machine from rogue code
Baseball themed hand clap maraca
Multi-carrier operation for wireless systems
High density molecular memory storage with read and write capabilities
Anti-FGFR3 antibodies and methods using same
  Randomly Featured Patents
Methods of forming a film on a substrate using complexes having tris(pyrazolyl) methanate ligands
Feature grouping in moving bodies in an image
Plane decode/virtual sector architecture
Material mover bed floor drive synchronization system and method
Compositions and methods for particulate consolidation
System and method for round trip delay adjustment in a multipoint-to-point orthogonal frequency division multiplexing system
Powering a notebook across a USB interface
Registering an IP phone with an IP phone switch
Method and circuitry to translate a differential logic signal to a CMOS logic signal
SCR Fire sensitivity control and fire control apparatus