# WS 4

D 713
M.E. DEGREE EXAMINATION, APRIL/MAY 2003. Second Semester VLSI Design VL 141 — COMPUTER AIDED DESIGN OF VLSI CIRCUITS Time : Three hours Answer ALL questions. PART A — (10 × 2 = 20 marks) 1. Draw the Y-Chart of VLSI Design methodology based on top-down structural decomposition and bottom-up layout reconstruction. 2. What are the entities to be optimized in the VLSI Design Problem? 3. What is meant by logic synthesis? What are the different problems of logic synthesis? 4. Define : Combinational Optimization Problem. 5. Draw the representation of the RS-Latch using the cell-port-net data model and the clique model. 6. What are the optimization problems in Floor planning? 7. Write short note on ‘‘Gate Modeling’’. 8. What are the basic principles of ROBDD? 9. What is the significance of ASAP scheduling? 10.What is FPGA? What are its classifications? Maximum : 100 marks

(a) 15. z = c +d + x 13. It can be solved by the Breadth first search method.Consider the shortest – path problem for directed graphs in which the length of a path is the number of edges in the path.(a) where the nodes allowed in the DFG are either two-input additions or two input multiplications.. Or (b) Explain the Unit-Size placement problem with possible placement solution and routing for the placement.(a) 14. 2 D 713 . Or (b) State and explain the basic issues in Combinational Logic Synthesis.(a) Show the NP-Completeness of the LONGEST PATH problem using a reduction from HAMILTONIAN CYCLE. Explain the array implementation and time-wheel implementation of the event queue.WS 4 PART B — (5 × 16 = 80 marks) 11. Implement the Half-Adder and Full-Adder circuit using VHDL. Or (b) Show how Lee’s algorithm can be interpreted to be a version of Dijikstra’s algorithm. What actions should be performed by the functions that ‘‘process’’ a vertex and an edge in order to actually compute the shortest path from any start vertex to all other vertices in the graph? 12. (The LONGEST PATH problem asks whether there exists a path with a length larger than ‘‘k’’ from a source to a target vertex in a graph with positive edge weights). Or (b) Draw and explain the different DFGs corresponding to x = a ∗b. Explain the different steps in the application of the Kernighan-Lin Algorithm.

WS 4 ——————— 3 D 713 .