Download 1- Design a multiplier circuit that multiply two binary numbers with

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the work of artificial intelligence, which forms the content of this project

Document related concepts
no text concepts found
Transcript
‫جامعة الملك سعىد‬
‫كلية الهندسة‬
‫قسم الهندسة الكهربائية‬
‫ كهر‬208
‫الىاجب األول‬
King Saud University
College of Engineering
Electrical Engineering Department
EE 208
Home Work # 1
Answer all questions:
1- A circuit that multiplies two binary numbers, the multiplier, A, is 4-bits and the multiplicand, B, is
3-bits.
a) What type of adders should you use? Explain why? (different from the book: section 4.7 
4th edition)
b) How many AND gates should you use?
c) Design the circuit using 3-bit adders and AND gates.
d) Design the circuit using 2-bit adders and AND gates.
2- Implement a circuit that multiplies a 3-bit number with a 2-bit number. Use only AND gates and full
adder circuits to realize this circuit. In the implementation, use the block diagram form of the full
adder.
3- A magnitude comparator compares two n-bit numbers (A and
A2
B) and produces three outputs corresponding to A > B, A = B,
A1
and A < B. Figure 1 shows the block diagram of a three-bit
A0
A>B
magnitude comparator. Construct a 9-bit comparator using three
3-Bit
A=B
3-bit comparator and external gates (OR and AND gates).
Comparator
A<B
B2
B1
B0
Figure 1
4-Design a simplified 2-bit comparator that compares between two numbers A=A1A0 and B=B1B0
using K-map method.
I0
D0
5. Figure 2 shows a circuit consists of an active low 24
24
21
x
I1
D
1
decoder and a 41 MUX. Write a truth table
Low
41
Active
representing F(x,y) and express F as sum of
MUX
0
I
D
2
2
2 Decoder
y
minterms.
I3 S1
D3
F
S0
Figure 2
6-Write the truth table for F(A,B,C,D) as shown in Figure 3
F (A,B,C)
where F1(A,B,C)=ABC and F2(A,B,C)=(B`+C`)` and 1
express F as sum of minterms.
F2(A,B,C)
I0
I1
F(A,B,C,D)
21
MUX
S0
D
Figure 3
7-Drive the Boolean function, F(A,B,C,D), being
implemented in figure 4
A
21
B
0
2
D0
24
High D1
Active
Decoder D2
I0
1
0
D3
Figure 4
I1
41
MUX
I2
I3 S1
S0
C
D
F
Related documents