Chapters of System Design Synthesis Combinational Logic

The script used for running the examples tries to optimize the inputcircuit for area, and synthesizes the circuit all the way down to thelevel of logic gates from a standard library.

Reddy}, title = {A Synthesis Procedure for Flexible Logic Functions}, year = }

This paper describes a technique for synthesizing a logic function, represented as an exclusive-or sum-of-products (ESOP), to a cascade of reversible Toffoli gates.


Chapters of System Design Synthesis

T1 - Synthesis of mapping logic for generating transformed pseudo-random patterns for BIST

the principles or practice of synthesis or synthetic methods or techniques, i.e., the process of deductive reasoning, as from cause to effect, from the simple elements to the complex whole, etc.


Logic synthesis for FPGAs based on ..

N2 - This paper studies the implementation of Boolean functions by lattices of four-terminal switches. Each switch is controlled by a Boolean literal. If the literal takes the value 1, the corresponding switch is connected to its four neighbors; else it is not connected. A Boolean function is implemented in terms of connectivity across the lattice: it evaluates to 1 iff there exists a connected path between two opposing edges of the lattice. The paper addresses the following synthesis problem: how should one assign literals to switches in a lattice in order to implement a given target Boolean function? The goal is to minimize the lattice size, measured in terms of the number of switches. An efficient algorithm for this task is presented-one that does not exhaustively enumerate paths but rather exploits the concept of Boolean function duality. The algorithm produces lattices with a size that grows linearly with the number of products of the target Boolean function in ISOP form. It runs in time that grows polynomially. Synthesis trials are performed on standard benchmark circuits. The synthesis results are compared to a lower-bound calculation on the lattice size.

new concept of logic synthesis for ..

AB - Traditional digital circuit synthesis flows start from an HDL behavioral definition and assume that circuit functions are almost completely defined, making don't-care conditions rare. However, recent design methodologies do not always satisfy these assumptions. For instance, third-party IP blocks used in a system-on-chip are often overdesigned for the requirements at hand. By focusing only on the input combinations occurring in a specific application, one could resynthesize the system to greatly reduce its area and power consumption. Therefore we extend modern digital synthesis with a novel technique, called SWEDE, that makes use of extensive external don't-cares. In addition, we utilize such don't-cares present implicitly in existing simulation-based verification environments for circuit customization. Experiments indicate that SWEDE scales to large ICs with half-million input vectors and handles practical cases well.

Remember: What is Logic Synthesis

If a sequence of gates in the synthesized network matches a sequence comprised of more than half the gates in a template, then a transformation using the remaining gates in the template can be applied resulting in a reduction in the gate count for the synthesized network.