SYALLABUS COMPLETION

DATE 10.11.12

CMOS DAA UNIT I MOS TRANSISTOR UNIT I PRINCIPLES INTRODUCTION 9 MOS Technology and VLSI, Process parameters and considerations for, MOS and CMOS, Electrical properties of CMOS circuits and Device modelling. CMOS Inverter Scaling CMOS circuits, Scaling principles and fundamental limits. UNIT II COMBINATIONAL LOGIC CIRCUITS 9 Propagation Delays, Stick diagram, Layout diagrams, Examples of combinational logic design, Elmores constant, Dynamic Logic Gates, Pass Transistor Logic, Power Dissipation, Low Power Design principles. UNIT III SEQUENTIAL LOGIC CIRCUITS 9 Static and Dynamic Latches and Registers, Timing Issues, Pipelines, Clocking strategies, Memory Architectures, and Memory control circuits, Synchronous and Asynchronous Design. UNIT IV DESIGNING ARITHMETIC BUILDING BLOCKS 9 Datapath circuits, Architectures for Adders, Accumulators, Multipliers, 9 Polynomial and Exponential algorithms, big "oh" and small "oh" notation, exact algorithms and heuristics, direct / indirect / deterministic algorithms, static and dynamic complexity, stepwise refinement. UNIT II DESIGN TECHNIQUES 9 Subgoals method, working backwards, work tracking, branch and bound algorithms for traveling salesman problem and knapsack problem, hill climbing techniques, divide and conquer method, dynamic programming, greedy methods. UNIT III SEARCHING AND SORTING 9 Sequential search, binary search, block search, Fibonacci search, bubble sort, bucket sorting, quick sort, heap sort, average case and worst case behavior UNIT IV GRAPH ALGORITHMS 9 Minimum spanning, tree, shortest path algorithms, Rconnected graphs, Even's and

Barrel Shifters, Speed and Area Tradeoffs UNIT V IMPLEMENTATION STRATEGIES 9 Full Custom and Semicustom Design, Standard Cell design and cell libraries, FPGA building block architectures, FPGA interconnect routing procedures, Benchmark Circuits, Case Studies.

Kleitman's flow min Steiglitz's algorithm. UNIT V TOPICS

algorithms,maxcut theorem, link deficit SELECTED

9 NP Completeness Approximation Algorithms, NP Hard Problems, Strasseu's Matrix Multiplication Algorithms, Magic Squares, Introduction To Parallel Algorithms and Genetic Algorithms, Monte-Carlo Methods, Amortised Analysis.

11.11.12 12.11.12 13.11.12 14.11.12 15.11.12 16.11.12 17.11.12 18.11.12 19.11.12 20.11.12 21.11.12 22.11.12 23.11.12 24.11.12 25.11.12 26.11.12 27.11.12 28.11.12 29.11.12 30.11.12 01.12.12 02.12.12 03.12.12 04.12.12 05.12.12 06.12.12 07.12.12 08.12.12

09.12.12 10.12.12 11.12.12 12.12.12 13.12.12 14.12.12 15.12.12