|
Name of Subject : LOGIC SYNTHESIS (7 CS 3) |
|
Unit |
|
Contents |
|
Introduction to VLSI, circuits Asics and Moore's Law. Microelectronic Design, Styles, four phases in creating |
|
Microelectronics chips computer Aided Synthesis and Optimization. Algorithms Review of Graph Definitions and |
|
I |
|
Notations Decision and Optimization Problems, Shortest and Longest Path Problems, Vertex Cover, Graph, |
|
Coloring, Clique covering and partitioning Algorithms Boolean Algebra and Representation of Boolean Functions, |
|
binary Decision diagrams. Satisfiability and cover problems. |
|
Hardware Modeling: Introduction to Hardware Modeling Language, State Diagrams. Data flow and Sequencing |
|
Graphs. Compilation and Behavioral Optimization Techniques. Circuits Specifications for Architectural Synthesis |
|
II |
|
Resources and constraints. Fundamental Architectural Synthesis Problems Temporal Domain Scheduling Spatial |
|
Domain Binding Hierarchical Models and Synchronization Problem. Area and performance estimation-Resource |
|
Dominated circuits and General Circuits. |
|
Scheduling Algorithms: Model for Scheduling Problems, Scheduling without Resource, Constraints-Unconstrained |
|
Scheduling ASAP Scheduling Algorithms Latency. Constrained Scheduling. ALAP scheduling. Under Timing |
|
III |
|
Constraints and Relative Scheduling with Resource Constraints Integer Linear Programming Model, Multiprocessor |
|
Scheduling, Heuristic Scheduling Algorithms (List Scheduling). Force Directed Scheduling. |
|
Two Level Combination Logic Optimization: Logic Optimization Principles-Definitions, Exact Logic Minimization, |
|
IV |
|
Heuristic, Logic Minimization, and Testability Properties Operations on Two level logic Cover-positional Cube |
|
Notation, Functions with Multivolume inputs and list oriented manipulation. Algorithms for logic minimization. |
|
Sequential logic optimization: Introduction, Sequential circuit optimization using state based models- state |
|
V |
|
minimization, state encoding. Sequential circuit optimization using network models. Implicit finite state machine |
traversal methods. Testability consideration for synchronous circuits.