Digital circuits and design , Operating System

1. Draw a schematic diagram of a CMOS inverter and explain its operation.

2. Draw schematic diagrams of CMOS NAND and NOR gates, and explain their operation.

3. Explain what is meant by "strong" or "weak" logic levels. Your answer should include a discussion of how n-channel devices "conduct" 1s or 0s.

In each of the following questions, it will be useful to perform a Partition Minimisation procedure to ensure your FSM is minimal.

4. Design a synchronous, MEALY type FSM that has input w and output z. The machine generates an output z = 1 when the previous four values of w were 1001 or 1111, otherwise z = 0. Overlapping input patterns are should be detected. Here's some example output:

w : 010111100110011111

z : 000000100100010011

5. Design a synchronous, MOORE type FSM that also detects the sequences 1001 or 1111. Sketch some example output, and compare your design with the one for question 4.

6. A sequential circuit has two inputs, w1 and w2, and an output, z. Its function is to compare the input sequences on the two inputs. If w1 = w2 during any four consecutive clock cycles the circuit produces z = 1; otherwise z = 0. Derive a state machine that performs this action. Example inputs and outputs:

w1 : 0110111000110

w2 : 1110101000111

z : 0000100001110

(With reference to the example, is this a Moore or a Mealy machine?)

7. Describe what is meant by a RACE or a HAZARD in an asynchronous circuit. How can they be avoided in designs?

8. A control mechanism for a vending machine accepts 10p and 5p pieces. It dispenses a chocolate bar when 20p is deposited (prices now better reflect the current economic climate); the mechanism does not give change if 25p is deposited. Design an asynchronous FSM that implements the mechanism-use as few states as possible. Use Partition Minimisation and State Merge to ensure your design is as small as possible.

9. How many single stuck-at faults are there in the circuit F = A.B + C? How many double stuck-at faults? How many triple stuck at faults? Use the path sensitisation technique to derive a minimal set of tests for all the single stuck-at faults in the circuit.

10. Draw a schematic diagram of a five-bit array multiplier. Explain its operation. Estimate the worst-case delay through the circuit (in units of full-adder and gate delays).

11. Draw a schematic of a five bit Wallace Tree Multiplier. Estimate the worst-case delay for this circuit.

12. Design a five bit Dadda tree multiplier, and compare its cost and speed with the Wallace Tree Multiplier from question 5.

13. Design a four bit carry-lookahead adder and compare its cost and delay with a four bit ripple carry adder.


Posted Date: 2/25/2013 3:08:57 AM | Location : United States

Related Discussions:- Digital circuits and design , Assignment Help, Ask Question on Digital circuits and design , Get Answer, Expert's Help, Digital circuits and design Discussions

Write discussion on Digital circuits and design
Your posts are moderated
Related Questions
In the mean while the fork() system call the Kernel creates a copy of the parent process's address space and adds it to the child process. But the vfork() system call do no

Q. Data transfer between two processes? Communication: Data transfer between two processes is essential for some time. Both processes are on the one computer or on different

Write a short note about process. Unceremoniously, a process is a program in implementation. A process is too much than the program code, which is occasionally known as the tex

What is a pure demand paging? When starting implementation of a process with no pages in memory, the operating system sets the instruction pointer to the first instruction of t

Find the optimal solution and optimal value of the following linear program. Use both (a) the enumerating the corner points method and (b) the iso-profit line method. Also identify

The term Operating System (OS) is often misused. It is common, for example, for people to speak of an OS when they are in fact referring to an OS and to a set of additional applica

Debugging a multi threaded program The following list points out few of the more frequent oversights and errors that can cause bugs in multithreaded programs. 1.    Ephemeral

Question: (a) Answer the following questions based on the code snippet below. 1. int main (int argc, char *argv[]) 2. { 3. 4. pid_t processId; 5. 6. processId =

Discuss the high barriers to entry in the market for PL operating systems