Jump to content

Logic optimization

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Hitanshu D (talk | contribs) at 18:02, 15 October 2006. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Logic Optimization a part of Logic Synthesis, is the process of finding an equivalent representation of the specificied Logic Circuit under one or more specified constraint. Generally the circuit is constrained to minimum chip area meeting a prespecified delay.

Introduction

With the advent of Logic Synthesis, one of the biggest challenge in front of EDA Industry was to find the best netlist representation of the given design description. While Two-Level Logic Optimization had long existed in the form of Quine–McCluskey algorithm, the rapidly improving chip densities, and the wide adoption of HDLs for circuit description, formalized the Logic Optimization domain as it exists today.

Today, Logic Optimization is divided into various categories based on two criterias:

Based on Circuit Representation

Two-Level Logic optimization
Multi-Level Logic Optimization

Based on Circuit characteristics

Sequential Logic Optimization
Combinational Logic Optimization

See Also