This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: 2-input OR, and 2-input XOR gates. (d) Re-design your circuit so that it now becomes a divisible-by-6 circuit. Implement your modi±ed design with basic gates. (e) What about a divisible-by-2 circuit (in other words, an even-number detection circuit)? 5. Consider the design of a multiplier which accepts two 2-bit non-negative binary numbers – A 1 A and B 1 B – as inputs and yields the 4-bit output Y 3 Y 2 Y 1 Y . Assume that the stock room has an ample supply of basic gates as well as full adders. (a) Draw the circuit that performs the partial product of B and A 1 A . How about the product of B 1 and A 1 A ? (b) Use your result in Part a to implement the multiplier. Hint: use a cascade of full adders and beware of the shift. (c) Find the logic function for Y 3 , the multiplication over±ow bit. Due date: October 16 in class...
View Full Document
This note was uploaded on 02/02/2010 for the course ENGINEERIN 520.101 taught by Professor Tracdtran during the Winter '06 term at Johns Hopkins.
- Winter '06