Skip to main content Accessibility help
×
Hostname: page-component-77c89778f8-vpsfw Total loading time: 0 Render date: 2024-07-17T14:16:16.374Z Has data issue: false hasContentIssue false

6 - Multi-level logic synthesis

from Part 2 - Combinational logic

Published online by Cambridge University Press:  05 June 2012

Zvi Kohavi
Affiliation:
Technion - Israel Institute of Technology, Haifa
Niraj K. Jha
Affiliation:
Princeton University, New Jersey
Get access

Summary

In Chapter 4, we discussed techniques for obtaining minimal two-level AND–OR or OR–AND realizations. In the present chapter we generalize the discussion to the synthesis of multi-level realizations, i.e., those that contain more than two levels of logic gates. Such realizations are important since they often require less area and delay compared to the corresponding two-level realizations and hence are more practical. However, unlike two-level realizations, it is difficult to obtain provably optimal multi-level realizations because of the much larger design space available for exploration. Thus, the goal of multilevel logic synthesis is to obtain the best possible realization that targets some design objective such as area reduction while meeting some design constraint such as circuit delay.

There are two phases in multi-level logic synthesis; these are the technology-independent and technology-dependent phases. In the technology-independent phase, the circuit is improved for the targeted design criterion, using the laws of Boolean algebra. In the technology-dependent phase, the resultant circuit is mapped to a library of gates available for the given semiconductor technology. We shall discuss the techniques involved in both phases.

Technology-independent synthesis

Technology-independent multi-level logic synthesis is carried out with the help of various logic transformations that preserve the input–output behavior of the circuit. The most important transformations are factoring, decomposition, extraction, substitution, and elimination. We discuss these transformations next.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2009

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • Multi-level logic synthesis
  • Zvi Kohavi, Technion - Israel Institute of Technology, Haifa, Niraj K. Jha, Princeton University, New Jersey
  • Book: Switching and Finite Automata Theory
  • Online publication: 05 June 2012
  • Chapter DOI: https://doi.org/10.1017/CBO9780511816239.007
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • Multi-level logic synthesis
  • Zvi Kohavi, Technion - Israel Institute of Technology, Haifa, Niraj K. Jha, Princeton University, New Jersey
  • Book: Switching and Finite Automata Theory
  • Online publication: 05 June 2012
  • Chapter DOI: https://doi.org/10.1017/CBO9780511816239.007
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • Multi-level logic synthesis
  • Zvi Kohavi, Technion - Israel Institute of Technology, Haifa, Niraj K. Jha, Princeton University, New Jersey
  • Book: Switching and Finite Automata Theory
  • Online publication: 05 June 2012
  • Chapter DOI: https://doi.org/10.1017/CBO9780511816239.007
Available formats
×