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
Decoration holder
Fixing apparatus
Communication system including relay station and data frame for the communication system
Polyfunctional sulfur-containing epoxies and compositions thereof
Software management system for network data processing systems
Method and apparatus for using virtual machine technology for managing parallel communicating applications
System and method for stranded file opens during disk compression utility requests
  Randomly Featured Patents
Polishing apparatus
Liquid discharging head and liquid discharging apparatus having grooved surface from ink inlet to ink outlet
Pocket for trousers or the like
Circuits and methods for controlling a light source
Retractable glare shield device for automobiles
Liquid crystal color display apparatus having fixed and variable color regions
End wall closure for bulk material transport bag
Wheel attachment connectable to weed trimmers and the like
Unidirectional clutch with shell races
Self-containing package system for storage and transportation of pre-fabricated portions of a building structure and the assembly thereof