Hi , I have Computer Architecture homework assignment and I need help. Let me know if you can help...

Question

Hi , I have Computer Architecture homework assignment and I need help. Let me know if you can help me and how can I send you the description.
	
Document Preview: 2) 	(40 pts) Given the following traffic light sequence: a) 	(10 pts) Give the minimum number of flip flops for such sequence. Be aware that the binary numbers where all the inputs are equal (e.g., 0 and 3) are not being used. You may treat impossible states as don’t cares (Justify your answer): b) 	(10 pts) Write the truth table for this sequence: c) 	(10 pts) Use Quine McCluskey to find the smallest sequential logic circuit needed this sequence: d) 	(10 pts) Draw the circuit found in part c

David · Accepted Answer

2)  (40 pts) Given the following traffic light sequence:  
a)  (10 pts) Give the minimum number of flip flops for such sequence. Be aware that the 
binary numbers where all the inputs are equal (e.g., 0 and 3) are not being used. You 
may treat impossible states as don’t cares (Justify your answer):  
 
Solution: 
Number of State = 4. 
Since use of “00” and “11” states are restricted for the state assignment. 
Therefore the least number of FFs needed is 3. 
Although, 3 FFs will give 8 states. Out of which “000” and “111” are not 
allowed. So we can choose any 4, out of remaining 6 combinations. 
 
 
 
Red-    001 
Yellow-  010 
Green-  100 
Error-   101 
 
 
 
 
 
 

b)  (10 pts) Write the truth table for this sequence:  
 
Solution: 
Truth Table can be constructed as per given assumptions and the State 
Diagram and is tabulated below.

Hi , I have Computer Architecture homework assignment and I need help. Let me know if you can help me and how can I send you the description. Document Preview: 2) (40 pts) Given the following traffic...

Solution

Answer To This Question Is Available To Download

Related Questions & Answers

Submit New Assignment