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
Field emission cathode structure
Nanofibers containing latent reactive groups
Packet communication system and packet communication method, and node and user device
Asynchronous loading of scripts in web pages
Dual work function recessed access device and methods of forming
Methods of forming integrated circuit packages
Use of deuterium oxide for the treatment of virus-based diseases of the respiratory tract
  Randomly Featured Patents
Method and apparatus for making shoe lasts and/or shoe components
Compositions for regenerating tissue that has deteriorated, and methods for using such compositions
Apparatus for securing an oximeter probe to a patient
Non-alloying core shell nanoparticles
Electronic apparatus
Method for enhancing catalytic activity
Rice-hulling roller
Illumination/viewing system for features in transparent materials
Valve for controlling fluids
Chemical-mechanical-polishing system with continuous filtration