Mapping Combinational Logic
An important problem in synthesis is to minimize the cost of a design, where the cost is measured by the number of chips needed. This includes the routing considerations within and pin constraints of a chip. Since it is difficult to incorporate all these factors during synthesis, and only limited success has been achieved so far, for instance, in combining synthesis and routability , we approximate this cost by the number of blocks needed. Minimizing the number of blocks may be an overkill if the design fits easily on a chip after a simple straightforward mapping. However, consider the situation when the design just exceeds the capacity of the chip. A good synthesis tool may be able to fit the circuit on one chip. In addition, leaving as many blocks unused as possible enables the designer to use the unused logic for improving the properties of the design. Also, as we will show in Chapter 7, minimizing the number of blocks helps in reducing the circuit delay in a placed and routed implementation of the circuit. This is because the blocks can be placed close to each other, reducing the wiring delays considerably. However, as we saw in the last chapter, minimizing the number of blocks is a difficult problem.
KeywordsEquivalence Class Boolean Network Decomposition Tree Primary Input Partial Collapse
Unable to display preview. Download preview PDF.