Presentation is loading. Please wait.

Presentation is loading. Please wait.

2-input AND/OR/XOR gates Inverters 2:1 MUX

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "2-input AND/OR/XOR gates Inverters 2:1 MUX"— Presentation transcript:

1 2-input AND/OR/XOR gates Inverters 2:1 MUX
Design a 4-bit ALU that implements the following set of operations with only the following components (assume 2’s complement number representation, no need to implement overflow circuit) 1-bit Full-Adders (FA) 2-input AND/OR/XOR gates Inverters 2:1 MUX M2 M1 M0 Function Name F = Add A + B 1 Subtract A – B 1 Increment A + 1 1 1 Decrement A – 1 1 Multiply by 2 A * 2 1 1 Divide by 2 A / 2 1 1 Bitwise-AND A AND B 1 1 1 Bitwise-OR A OR B

2 M2 M1 M0 Function Name F = Add A + B 1 Subtract A – B 1 Increment A + 1 1 1 Decrement A – 1 1 Multiply by 2 A * 2 1 1 Divide by 2 A / 2 1 1 Bitwise-AND A AND B 1 1 1 Bitwise-OR A OR B

3 M2 M1 M0 Function Name F = Add A + B 1 Subtract A – B 1 Increment
Add A + B 1 Subtract A – B 1 Increment A + 1 1 1 Decrement A – 1 1 Multiply by 2 A * 2 1 1 Divide by 2 A / 2 1 1 Bitwise-AND A AND B 1 1 1 Bitwise-OR A OR B MUX M2 Fi

4 M2 M1 M0 Function Name F = Add A + B 1 Subtract A – B 1 Increment
Add A + B 1 Subtract A – B 1 Increment A + 1 1 1 Decrement A – 1 1 Multiply by 2 A * 2 1 1 Divide by 2 A / 2 1 1 Bitwise-AND A AND B 1 1 1 Bitwise-OR A OR B A * 2 = left-shift e.g. 3 * 2 = “011” * 2 = “110” = 6 A / 2 = right-shift e.g. 3 / 2 = “011” / 2 = “001” = 1 MUX M1 MUX M2 Fi

5 M2 M1 M0 Function Name F = Add A + B 1 Subtract A – B 1 Increment
Add A + B 1 Subtract A – B 1 Increment A + 1 1 1 Decrement A – 1 1 Multiply by 2 A * 2 1 1 Divide by 2 A / 2 1 1 Bitwise-AND A AND B 1 1 1 Bitwise-OR A OR B Ai-1 Ai+1 A * 2 = left-shift e.g. 3 * 2 = “011” * 2 = “110” = 6 MUX M0 A / 2 = right-shift e.g. 3 / 2 = “011” / 2 = “001” = 1 MUX M1 MUX M2 Fi

6 M2 M1 M0 Function Name F = Add A + B 1 Subtract A – B 1 Increment
Add A + B 1 Subtract A – B 1 Increment A + 1 1 1 Decrement A – 1 1 Multiply by 2 A * 2 1 1 Divide by 2 A / 2 Ai Bi Ai Bi 1 1 Bitwise-AND A AND B 1 1 1 Bitwise-OR A OR B Ai-1 Ai+1 MUX MUX M0 M0 MUX M1 MUX M2 Fi

7 M2 M1 M0 Function Name F = Add A + B 1 Subtract A – B 1 Increment
Add A + B 1 Subtract A – B 1 Increment A + 1 1 1 Decrement A – 1 1 Multiply by 2 A * 2 1 1 Divide by 2 A / 2 Ai Bi Ai Bi 1 1 Bitwise-AND A AND B 1 1 1 Bitwise-OR A OR B Ai-1 Ai+1 MUX MUX M0 M0 MUX M1 MUX M2 Fi

8 M2 M1 M0 Function Name F = Add A + B 1 Subtract A – B 1 Increment
Add A + B 1 Subtract A – B 1 Increment A + 1 1 1 Decrement A – 1 1 Multiply by 2 A * 2 1 1 Divide by 2 A / 2 Ai Bi Ai Bi 1 1 Bitwise-AND A AND B 1 1 1 Bitwise-OR A OR B Ai-1 Ai+1 MUX MUX M0 M0 Ai MUX M1 FA Ci+1 Ci MUX M2 Fi

9 M2 M1 M0 Function Name F = C0 Add A + B Bi 1 Subtract A – B NOT(Bi) 1
Add A + B Bi 1 Subtract A – B NOT(Bi) 1 1 Increment A + 1 “0” 1 1 1 Decrement A – 1 “1” 1 Multiply by 2 A * 2 1 1 Divide by 2 A / 2 Ai Bi Ai Bi 1 1 Bitwise-AND A AND B 1 1 1 Bitwise-OR A OR B Ai-1 Ai+1 MUX MUX M0 M0 Ai MUX M1 FA Ci+1 Ci MUX M2 Fi

10 M2 M1 M0 Function Name F = C0 Add A + B Bi 1 Subtract A – B NOT(Bi) 1
Add A + B Bi 1 Subtract A – B NOT(Bi) 1 1 Increment A + 1 “0” 1 1 1 Decrement A – 1 “1” 1 Multiply by 2 A * 2 1 1 Divide by 2 A / 2 Ai Bi Ai Bi 1 1 Bitwise-AND A AND B 1 1 1 Bitwise-OR A OR B Ai-1 Ai+1 Bi M0 MUX MUX M0 M0 Ai MUX M1 MUX M1 FA Ci+1 Ci MUX M2 Fi

11 M2 M1 M0 Function Name F = C0 Add A + B Bi 1 Subtract A – B NOT(Bi) 1
Add A + B Bi 1 Subtract A – B NOT(Bi) 1 1 Increment A + 1 “0” 1 1 1 Decrement A – 1 “1” 1 Multiply by 2 A * 2 1 1 Divide by 2 A / 2 Ai Bi Ai Bi 1 1 Bitwise-AND A AND B 1 1 1 Bitwise-OR A OR B Ai-1 Ai+1 Bi M0 MUX MUX M0 M0 Ai MUX M1 MUX M1 FA Ci+1 Ci MUX M2 Fi

12 M2 M1 M0 Function Name F = C0 Add A + B Bi 1 Subtract A – B NOT(Bi) 1
Add A + B Bi 1 Subtract A – B NOT(Bi) 1 1 Increment A + 1 “0” 1 1 1 Decrement A – 1 “1” 1 Multiply by 2 A * 2 1 1 Divide by 2 A / 2 Ai Bi Ai Bi 1 1 Bitwise-AND A AND B 1 1 1 Bitwise-OR A OR B Ai-1 Ai+1 Bi M0 MUX MUX M0 M0 M0 Ai MUX M1 MUX M1 FA Ci+1 Ci MUX M2 Fi

13 M2 M1 M0 Function Name F = C0 Add A + B Bi 1 Subtract A – B NOT(Bi) 1
Add A + B Bi 1 Subtract A – B NOT(Bi) 1 1 Increment A + 1 “0” 1 1 1 Decrement A – 1 “1” 1 Multiply by 2 A * 2 1 1 Divide by 2 A / 2 Ai Bi Ai Bi 1 1 Bitwise-AND A AND B 1 1 1 Bitwise-OR A OR B Ai-1 Ai+1 Bi M0 MUX MUX M0 M0 M0 Ai MUX M1 MUX M1 FA Ci+1 Ci MUX M2 Fi

14 M1 M0 M2 M1 M0 Function Name F = C0 Add A + B Bi 1 Subtract A – B
Add A + B Bi 1 Subtract A – B NOT(Bi) 1 1 Increment A + 1 “0” 1 1 1 Decrement A – 1 “1” C0 1 Multiply by 2 A * 2 1 1 Divide by 2 A / 2 Ai Bi Ai Bi 1 1 Bitwise-AND A AND B 1 1 1 Bitwise-OR A OR B Ai-1 Ai+1 Bi M0 MUX MUX M0 M0 M0 Ai MUX M1 MUX M1 FA Ci+1 Ci MUX M2 Fi

15 M1 M0 M2 M1 M0 Function Name F = C0 1 1 Ai Bi Ai Bi 1 1 Ai-1 Ai+1 Bi
C0 1 1 Ai Bi Ai Bi 1 1 Ai-1 Ai+1 Bi M0 MUX MUX M0 M0 M0 Ai MUX M1 MUX M1 FA Ci+1 Ci MUX M2 Fi

16 M1 M0 M2 M1 M0 Function Name F = C0 1 1 Ai Bi Ai Bi 1 1 Bitwise-AND
C0 1 1 Ai Bi Ai Bi 1 1 Bitwise-AND A AND B 1 1 1 Bitwise-OR A OR B Ai-1 Ai+1 Bi M0 MUX MUX M0 M0 M0 Ai MUX M1 MUX M1 FA Ci+1 Ci MUX M2 Fi

17 M1 M0 M2 M1 M0 Function Name F = C0 1 1 Multiply by 2 A * 2 1 1
C0 1 1 Multiply by 2 A * 2 1 1 Divide by 2 A / 2 Ai Bi Ai Bi 1 1 Ai-1 Ai+1 Bi M0 MUX MUX M0 M0 M0 Ai MUX M1 MUX M1 FA Ci+1 Ci MUX M2 Fi

Download ppt "2-input AND/OR/XOR gates Inverters 2:1 MUX"

Similar presentations

ES 112 Project 2 bit ALU.

ES 112 Project 2 bit ALU.
1 Register Transfer &  -operations Computer Organization Computer Architectures Lab REGISTER TRANSFER AND MICROOPERATIONS Register Transfer Language Register.

1 Register Transfer &  -operations Computer Organization Computer Architectures Lab REGISTER TRANSFER AND MICROOPERATIONS Register Transfer Language Register.
COE 202: Digital Logic Design Signed Numbers

COE 202: Digital Logic Design Signed Numbers
1 ALUs. 2 Topics: ALU Overview - core of the integer datapath - 2 operands, 32-bits wide, plus control signals Exercise: A simple multiplier.

1 ALUs. 2 Topics: ALU Overview - core of the integer datapath - 2 operands, 32-bits wide, plus control signals Exercise: A simple multiplier.
Henry Hexmoor1 Chapter 5 Arithmetic Functions Arithmetic functions –Operate on binary vectors –Use the same subfunction in each bit position Can design.

Henry Hexmoor1 Chapter 5 Arithmetic Functions Arithmetic functions –Operate on binary vectors –Use the same subfunction in each bit position Can design.
Arithmetic CPSC 321 Computer Architecture Andreas Klappenecker.

Arithmetic CPSC 321 Computer Architecture Andreas Klappenecker.
Chapter 6 Arithmetic. Addition 0111 + 0 0 1 1 1 1 0 0 0 1101 Carry in Carry out 7 + 6 13.

Chapter 6 Arithmetic. Addition Carry in Carry out
Cpe 252: Computer Organization1 Lo’ai Tawalbeh Lecture #4 Register Transfer and Microoperations 23/2/2006 Chapter 4:

Cpe 252: Computer Organization1 Lo’ai Tawalbeh Lecture #4 Register Transfer and Microoperations 23/2/2006 Chapter 4:
Homework Reading Machine Projects Labs

Homework Reading Machine Projects Labs
Overview Iterative combinational circuits Binary adders

Overview Iterative combinational circuits Binary adders
Chapter 5 Arithmetic Logic Functions. Page 2 This Chapter..  We will be looking at multi-valued arithmetic and logic functions  Bitwise AND, OR, EXOR,

Chapter 5 Arithmetic Logic Functions. Page 2 This Chapter..  We will be looking at multi-valued arithmetic and logic functions  Bitwise AND, OR, EXOR,
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 4 – Arithmetic Functions Logic and Computer.

Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 4 – Arithmetic Functions Logic and Computer.
L23 – Arithmetic Logic Units. Arithmetic Logic Units (ALU)  Modern ALU design  ALU is heart of datapath  Ref: text Unit 15 9/2/2012 – ECE 3561 Lect.

L23 – Arithmetic Logic Units. Arithmetic Logic Units (ALU)  Modern ALU design  ALU is heart of datapath  Ref: text Unit 15 9/2/2012 – ECE 3561 Lect.
Computer Science 210 Computer Organization The Arithmetic Logic Unit.

Computer Science 210 Computer Organization The Arithmetic Logic Unit.
Homework 2 Due 28 th May 2014. Implement This Function using 1)a 3-to-8 Line Decoder (with OR gates) 2) a 3-to-8 Line Active Low Decoder (with NAND gates)

Homework 2 Due 28 th May Implement This Function using 1)a 3-to-8 Line Decoder (with OR gates) 2) a 3-to-8 Line Active Low Decoder (with NAND gates)
 To add numbers in scientific notation: 1) Add the constants 2) Keep the exponent the same  Example: (2.1 x 10 5 ) + (3.2 x 10 5 ) = (2.1 + 3.2) x 10.

 To add numbers in scientific notation: 1) Add the constants 2) Keep the exponent the same  Example: (2.1 x 10 5 ) + (3.2 x 10 5 ) = ( ) x 10.
Computer System Configuration and Function Computer Architecture and Design Lecture 6.

Computer System Configuration and Function Computer Architecture and Design Lecture 6.
Dr. Ahmed El-Bialy, Dr. Sahar Fawzy Combinational Circuits Dr. Ahmed El-Bialy Dr. Sahar Fawzy.

Dr. Ahmed El-Bialy, Dr. Sahar Fawzy Combinational Circuits Dr. Ahmed El-Bialy Dr. Sahar Fawzy.
Computer Organization & Programming Chapter4 Combinatorial Components.

Computer Organization & Programming Chapter4 Combinatorial Components.
Chapter 6-1 ALU, Adder and Subtractor

Chapter 6-1 ALU, Adder and Subtractor

Similar presentations

Ads by Google