Hewlett Packard Enterprise Development LP

Tobias Frederic Ziegler

Catherine Graves

Giacomo Pedretti

Thomas Van Vaerenbergh

Ron Roth

Pedro Henrique Rocha Bruel

Luca Buonanno

The disclosure generally provides for a method of solving a K-SAT problem. The method comprises programming one or more clauses of a Boolean expression for a K-SAT problem written in negated disjunctive normal form (DNF) to a ternary-CAM (TCAM) array comprising columns and rows of TCAM cells, applying an interpretation comprising one or more binary variables expected to solve the Boolean expression as an input along the columns to the TCAM array, returning a binary value for each clause and updating one or more variables within the interpretation if at least one clause is violated.

Compact K-SAT verification with TCAMs

The disclosure generally provides for a method of solving a K-SAT problem. The method comprises programming one or more clauses of a Boolean expression for a K-SAT problem written in negated disjunctive normal form (DNF) to a ternary-CAM (TCAM) array comprising columns and rows of TCAM cells. The method further includes applying an interpretation comprising one or more binary variables expected to solve the Boolean expression as an input along the columns to the TCAM array, returning a binary value for each clause, randomly selecting one matched match line, determining a selected clause from one or more violated clause, and altering one or more literals within the interpretation using a break count for each variable of the selected clause.

Stochastic local search accelerator based on cams for solving constraint satisfaction problems

Examples increase precision for aCAMs by converting an input signal (x) received by a circuit into a first analog voltage signal (V(x)) representing the most significant bits of the input signal (x) and a second analog voltage signal (V(x)) representing the least significant bits of the input signal (x). By dividing the input signal (x) bit-wise into the first analog voltage signal (V(x)) and the second analog voltage signal (V(x)), the circuit can utilize aCAM sub-circuits implementing a combination of Boolean operations to search the input signal (x) against 2programmable levels, where 'M' represents the number of programmable bits for each aCAM sub-circuit. Thus, using similar circuit hardware, example circuits square the number of programmable levels of conventional aCAMs (which generally only have 2programmable levels). Accordingly, examples provide new aCAMs that can carry out more complex computations than conventional aCAMs of comparable cost, size, and power consumption.

Increased precision analog content addressable memories

Compact K-SAT verification with TCAMS

Growing community of inventors

Houston, TX, United States of America

Tobias Frederic Ziegler