Reg. No.

29
Question Paper Code : 97602

M.E. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2010

First Semester

4
Applied Electronics

AP 9212 — ADVANCED DIGITAL SYSTEM DESIGN

(Common to M.E. VLSI Design)

(Regulation 2009)

Time : Three hours Maximum : 100 Marks

Answer ALL questions

29
PART A — (10 × 2 = 20 Marks)
1. A controlled digital system, a sequential machine and a finite machine one -
These three are the same or different?
2. Define Class A, B, C, D, E MACHINES.
3. What is a Unit distance state assignment?
4. Give an example for non critical race.
4

5. Name the Tolerance techniques.

6. Define MTBF.
7. What is the difference between FPLA and PROM?
8. Use 4 × 4 ROM to convert four bit BCD to an Excess -3 code.
9. List the steps involved in VHDL test bench.
10. What is the difference between Behavioral model and test bench?
29

PART B — (5 × 16 = 80 Marks)

11. (a) Discuss using timing diagram, the operation of a binary cell developed
around NOR gates. Draw a distinction between NAND and NOR cell.
What should be the direct consequence of a SET OPERATION?
Or
(b) Write down the design steps involved in designing Traditional
synchronous sequential circuits.
4
12. (a) Illustrate the generation of a hazard with an example. Also show the
excitation map of the circuit indicating the hazardous transition and the

29
timing diagram that illustrates the hazard.

Or
(b) Design a single step pulse circuit whose inputs are system clock and
single step. This circuit is to issue one and only one clean positive going
clock pulse each time the single step input is cycled.

13. (a) Distinguish between different fault table methods and discuss any one in
detail.

4
Or
(b) Prove that in a circuit in which all gates have a fan-out of 1, any set of
tests that detects all single faults on the Input wires detects all single
faults in the entire circuit.

14. (a) Using the direct addressed ROM or PLA configuration develop the ROM
program table for the control logic of vending machine controller.
29 Or
(b) Consider the function f (x1 , x 2 , x 3 ) = x1 x 2′ + x1 x 3 + x 2 x3′ . Show a circuit using
5 two input look up tables (LUTs ) to implement this expression. Give the
truth table implemented in each LUT. You need not show the wires in
the FPGA.

15. (a) Write the behavioral model of a multiplier for unsigned binary numbers
that multiplies a 4-bit multiplicand by a 4-bit multiplier to give an 68-bit
product.
4

Or
(b) Write the VHDL code for a Dice game simulator.

————————
29
4

2 97602