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
Memory device having collaborative filtering to reduce noise
Nucleic acid sequences encoding strictosidine synthase proteins
Solid-state image sensing apparatus and electronic apparatus
Apparatus and method for categorizing services using canonical service descriptions
Field-programmable analog array with memristors
Alkaline battery
Erasing a non-volatile memory (NVM) system having error correction code (ECC)
  Randomly Featured Patents
Interlocking siding panel
Flame-retardant synthetic textile articles and methods of making the same
Blackjack card game method of play
Car electronic control system and method for controlling the same
Method for making tetraorganooxysilanes
Ultrasound transducer, ultrasound probe, and a method for manufacturing ultrasound transducers
Anti-electrostatic brush
Methods and systems for the rapid detection of concealed objects
Baby mate
Communications system