Simple Solver 1.0 Build 06-10-2008

Simple Solver (SSolver) provides a suite of four design tools: Boolean, Synthesis, Permutation and Random Number.


Booleans

The Boolean function provides minimization and truth tables for one or a series of Boolean equations. Operator formats are supported for a variety of languages including: ABEL, C, C++, PALASM, Verilog, VB and VHDL.


Logic Synthesis

The Synthesis function (SYN) provides automatic design and simulation of digital logic circuits from truth table or waveform inputs. All circuit types and configurations are supported: Combinational, Sequential, Synchronous and Asynchronous.

SYN performs automated logic design by searching for circuits that provide the transfer function specified by the input and output signal waveforms. In general, the first circuit solution found will be the simplest possible solution. Refer to US Patent 6253365.


Permutations

The Permutation function (PERM) calculates permutations of numbers for a specified number of digits and width. It can be used to gain an appreciation of how rapidly (exponentially) the number of choices in a design grows when, for example, a 2-input AND is added. It also illustrates the value of adding constraints, such as sorting, to reduce the number of possible permutations. PERM can be used for a variety of applications such as generating binary, octal or decimal number tables.


Random Numbers

The Random Number function produces random sequences of numbers in the range of -9999 to 9999. It can be used for many purposes: shuffling 52 numbers (like a deck of cards), randomly selecting a subset of operations for sample testing, and so forth.