Enviar pesquisa
Carregar
105_2_digitalSystem_Chap_3_part_3.ppt
•
Transferir como PPT, PDF
•
0 gostou
•
20 visualizações
J
Jeanie Delos Arcos
Seguir
Number System
Leia menos
Leia mais
Tecnologia
Vista de apresentação de diapositivos
Denunciar
Compartilhar
Vista de apresentação de diapositivos
Denunciar
Compartilhar
1 de 49
Baixar agora
Recomendados
Lec20
Lec20
Zain Ul Abedeen
Unit 04
Unit 04
Partha_bappa
Combinational and sequential logic
Combinational and sequential logic
Deepak John
UNIT - II.pptx
UNIT - II.pptx
amudhak10
Comp Arithmetic Basic.ppt
Comp Arithmetic Basic.ppt
skatiarrahaman
computer arithmatic
computer arithmatic
mahesh kumar prajapat
Comparison among Different Adders
Comparison among Different Adders
iosrjce
cs 3351 dpco
cs 3351 dpco
udhayaveenaa
Recomendados
Lec20
Lec20
Zain Ul Abedeen
Unit 04
Unit 04
Partha_bappa
Combinational and sequential logic
Combinational and sequential logic
Deepak John
UNIT - II.pptx
UNIT - II.pptx
amudhak10
Comp Arithmetic Basic.ppt
Comp Arithmetic Basic.ppt
skatiarrahaman
computer arithmatic
computer arithmatic
mahesh kumar prajapat
Comparison among Different Adders
Comparison among Different Adders
iosrjce
cs 3351 dpco
cs 3351 dpco
udhayaveenaa
100_2_digitalSystem_Chap1 (2).ppt
100_2_digitalSystem_Chap1 (2).ppt
namraashraf56
Binary Adders.pdf
Binary Adders.pdf
RamKumar612299
Computer organization and architecture lab manual
Computer organization and architecture lab manual
Shankar Gangaju
Arithmetic micro operations
Arithmetic micro operations
Nitesh Bichwani
Logic System Design KTU Chapter-4.ppt
Logic System Design KTU Chapter-4.ppt
Albin562191
digital systems and information
digital systems and information
Kamran Zafar
ArithmeticCircuits.Ivy Nile vs. Rhea Ripley
ArithmeticCircuits.Ivy Nile vs. Rhea Ripley
RudraBhai3
Addition and subtraction with signed magnitude data (mano
Addition and subtraction with signed magnitude data (mano
cs19club
Arithmetic Unit Addition Subtraction Multiplication and Division
Arithmetic Unit Addition Subtraction Multiplication and Division
RNShukla7
Binary Adder Design(COA).ppt
Binary Adder Design(COA).ppt
RohitPaul71
Computer Architecture refers to those attributes of a system that have a dire...
Computer Architecture refers to those attributes of a system that have a dire...
mayurjagdale4
Chapter 07 Digital Alrithmetic and Arithmetic Circuits
Chapter 07 Digital Alrithmetic and Arithmetic Circuits
SSE_AndyLi
index of all of the financial accounts in a company's general ledger. In shor...
index of all of the financial accounts in a company's general ledger. In shor...
mayurjagdale4
Unit 4 dica
Unit 4 dica
Pavan Mukku
adder and subtractor
adder and subtractor
Unsa Shakir
07_arithmeticcircuits digital electronics.pptx
07_arithmeticcircuits digital electronics.pptx
Elisée Ndjabu
Logic Design
Logic Design
Partha_bappa
Unit 3 Arithmetic building blocks and memory Design (1).pdf
Unit 3 Arithmetic building blocks and memory Design (1).pdf
ShreyasMahesh
International Journal of Engineering Research and Development
International Journal of Engineering Research and Development
IJERD Editor
combinational-circuit (1).ppt
combinational-circuit (1).ppt
Krishnavenimanickam2
Chapter005
Chapter005
Jeanie Delos Arcos
Chapter008
Chapter008
Jeanie Delos Arcos
Mais conteúdo relacionado
Semelhante a 105_2_digitalSystem_Chap_3_part_3.ppt
100_2_digitalSystem_Chap1 (2).ppt
100_2_digitalSystem_Chap1 (2).ppt
namraashraf56
Binary Adders.pdf
Binary Adders.pdf
RamKumar612299
Computer organization and architecture lab manual
Computer organization and architecture lab manual
Shankar Gangaju
Arithmetic micro operations
Arithmetic micro operations
Nitesh Bichwani
Logic System Design KTU Chapter-4.ppt
Logic System Design KTU Chapter-4.ppt
Albin562191
digital systems and information
digital systems and information
Kamran Zafar
ArithmeticCircuits.Ivy Nile vs. Rhea Ripley
ArithmeticCircuits.Ivy Nile vs. Rhea Ripley
RudraBhai3
Addition and subtraction with signed magnitude data (mano
Addition and subtraction with signed magnitude data (mano
cs19club
Arithmetic Unit Addition Subtraction Multiplication and Division
Arithmetic Unit Addition Subtraction Multiplication and Division
RNShukla7
Binary Adder Design(COA).ppt
Binary Adder Design(COA).ppt
RohitPaul71
Computer Architecture refers to those attributes of a system that have a dire...
Computer Architecture refers to those attributes of a system that have a dire...
mayurjagdale4
Chapter 07 Digital Alrithmetic and Arithmetic Circuits
Chapter 07 Digital Alrithmetic and Arithmetic Circuits
SSE_AndyLi
index of all of the financial accounts in a company's general ledger. In shor...
index of all of the financial accounts in a company's general ledger. In shor...
mayurjagdale4
Unit 4 dica
Unit 4 dica
Pavan Mukku
adder and subtractor
adder and subtractor
Unsa Shakir
07_arithmeticcircuits digital electronics.pptx
07_arithmeticcircuits digital electronics.pptx
Elisée Ndjabu
Logic Design
Logic Design
Partha_bappa
Unit 3 Arithmetic building blocks and memory Design (1).pdf
Unit 3 Arithmetic building blocks and memory Design (1).pdf
ShreyasMahesh
International Journal of Engineering Research and Development
International Journal of Engineering Research and Development
IJERD Editor
combinational-circuit (1).ppt
combinational-circuit (1).ppt
Krishnavenimanickam2
Semelhante a 105_2_digitalSystem_Chap_3_part_3.ppt
(20)
100_2_digitalSystem_Chap1 (2).ppt
100_2_digitalSystem_Chap1 (2).ppt
Binary Adders.pdf
Binary Adders.pdf
Computer organization and architecture lab manual
Computer organization and architecture lab manual
Arithmetic micro operations
Arithmetic micro operations
Logic System Design KTU Chapter-4.ppt
Logic System Design KTU Chapter-4.ppt
digital systems and information
digital systems and information
ArithmeticCircuits.Ivy Nile vs. Rhea Ripley
ArithmeticCircuits.Ivy Nile vs. Rhea Ripley
Addition and subtraction with signed magnitude data (mano
Addition and subtraction with signed magnitude data (mano
Arithmetic Unit Addition Subtraction Multiplication and Division
Arithmetic Unit Addition Subtraction Multiplication and Division
Binary Adder Design(COA).ppt
Binary Adder Design(COA).ppt
Computer Architecture refers to those attributes of a system that have a dire...
Computer Architecture refers to those attributes of a system that have a dire...
Chapter 07 Digital Alrithmetic and Arithmetic Circuits
Chapter 07 Digital Alrithmetic and Arithmetic Circuits
index of all of the financial accounts in a company's general ledger. In shor...
index of all of the financial accounts in a company's general ledger. In shor...
Unit 4 dica
Unit 4 dica
adder and subtractor
adder and subtractor
07_arithmeticcircuits digital electronics.pptx
07_arithmeticcircuits digital electronics.pptx
Logic Design
Logic Design
Unit 3 Arithmetic building blocks and memory Design (1).pdf
Unit 3 Arithmetic building blocks and memory Design (1).pdf
International Journal of Engineering Research and Development
International Journal of Engineering Research and Development
combinational-circuit (1).ppt
combinational-circuit (1).ppt
Mais de Jeanie Delos Arcos
Chapter005
Chapter005
Jeanie Delos Arcos
Chapter008
Chapter008
Jeanie Delos Arcos
Chapter006
Chapter006
Jeanie Delos Arcos
Chapter004
Chapter004
Jeanie Delos Arcos
Chapter003
Chapter003
Jeanie Delos Arcos
Pentium II
Pentium II
Jeanie Delos Arcos
Celeron
Celeron
Jeanie Delos Arcos
80486
80486
Jeanie Delos Arcos
Pentium 3
Pentium 3
Jeanie Delos Arcos
03 Buses
03 Buses
Jeanie Delos Arcos
02 Computer Evolution And Performance
02 Computer Evolution And Performance
Jeanie Delos Arcos
07 Input Output
07 Input Output
Jeanie Delos Arcos
10 Instruction Sets Characteristics
10 Instruction Sets Characteristics
Jeanie Delos Arcos
06 External Memory
06 External Memory
Jeanie Delos Arcos
08 Operating System Support
08 Operating System Support
Jeanie Delos Arcos
05 Internal Memory
05 Internal Memory
Jeanie Delos Arcos
09 Arithmetic
09 Arithmetic
Jeanie Delos Arcos
04 Cache Memory
04 Cache Memory
Jeanie Delos Arcos
01 Introduction
01 Introduction
Jeanie Delos Arcos
ISM424 RM
ISM424 RM
Jeanie Delos Arcos
Mais de Jeanie Delos Arcos
(20)
Chapter005
Chapter005
Chapter008
Chapter008
Chapter006
Chapter006
Chapter004
Chapter004
Chapter003
Chapter003
Pentium II
Pentium II
Celeron
Celeron
80486
80486
Pentium 3
Pentium 3
03 Buses
03 Buses
02 Computer Evolution And Performance
02 Computer Evolution And Performance
07 Input Output
07 Input Output
10 Instruction Sets Characteristics
10 Instruction Sets Characteristics
06 External Memory
06 External Memory
08 Operating System Support
08 Operating System Support
05 Internal Memory
05 Internal Memory
09 Arithmetic
09 Arithmetic
04 Cache Memory
04 Cache Memory
01 Introduction
01 Introduction
ISM424 RM
ISM424 RM
Último
Workshop - Best of Both Worlds_ Combine KG and Vector search for enhanced R...
Workshop - Best of Both Worlds_ Combine KG and Vector search for enhanced R...
Neo4j
04-2024-HHUG-Sales-and-Marketing-Alignment.pptx
04-2024-HHUG-Sales-and-Marketing-Alignment.pptx
HampshireHUG
Data Cloud, More than a CDP by Matt Robison
Data Cloud, More than a CDP by Matt Robison
Anna Loughnan Colquhoun
How to convert PDF to text with Nanonets
How to convert PDF to text with Nanonets
naman860154
08448380779 Call Girls In Greater Kailash - I Women Seeking Men
08448380779 Call Girls In Greater Kailash - I Women Seeking Men
Delhi Call girls
Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...
Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...
Miguel Araújo
08448380779 Call Girls In Friends Colony Women Seeking Men
08448380779 Call Girls In Friends Colony Women Seeking Men
Delhi Call girls
IAC 2024 - IA Fast Track to Search Focused AI Solutions
IAC 2024 - IA Fast Track to Search Focused AI Solutions
Enterprise Knowledge
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
Drew Madelung
Factors to Consider When Choosing Accounts Payable Services Providers.pptx
Factors to Consider When Choosing Accounts Payable Services Providers.pptx
Katpro Technologies
Histor y of HAM Radio presentation slide
Histor y of HAM Radio presentation slide
vu2urc
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdf
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdf
Enterprise Knowledge
GenCyber Cyber Security Day Presentation
GenCyber Cyber Security Day Presentation
Michael W. Hawkins
Salesforce Community Group Quito, Salesforce 101
Salesforce Community Group Quito, Salesforce 101
Paola De la Torre
EIS-Webinar-Prompt-Knowledge-Eng-2024-04-08.pptx
EIS-Webinar-Prompt-Knowledge-Eng-2024-04-08.pptx
Earley Information Science
The 7 Things I Know About Cyber Security After 25 Years | April 2024
The 7 Things I Know About Cyber Security After 25 Years | April 2024
Rafal Los
Breaking the Kubernetes Kill Chain: Host Path Mount
Breaking the Kubernetes Kill Chain: Host Path Mount
Puma Security, LLC
Kalyanpur ) Call Girls in Lucknow Finest Escorts Service 🍸 8923113531 🎰 Avail...
Kalyanpur ) Call Girls in Lucknow Finest Escorts Service 🍸 8923113531 🎰 Avail...
gurkirankumar98700
A Domino Admins Adventures (Engage 2024)
A Domino Admins Adventures (Engage 2024)
Gabriella Davis
WhatsApp 9892124323 ✓Call Girls In Kalyan ( Mumbai ) secure service
WhatsApp 9892124323 ✓Call Girls In Kalyan ( Mumbai ) secure service
Pooja Nehwal
Último
(20)
Workshop - Best of Both Worlds_ Combine KG and Vector search for enhanced R...
Workshop - Best of Both Worlds_ Combine KG and Vector search for enhanced R...
04-2024-HHUG-Sales-and-Marketing-Alignment.pptx
04-2024-HHUG-Sales-and-Marketing-Alignment.pptx
Data Cloud, More than a CDP by Matt Robison
Data Cloud, More than a CDP by Matt Robison
How to convert PDF to text with Nanonets
How to convert PDF to text with Nanonets
08448380779 Call Girls In Greater Kailash - I Women Seeking Men
08448380779 Call Girls In Greater Kailash - I Women Seeking Men
Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...
Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...
08448380779 Call Girls In Friends Colony Women Seeking Men
08448380779 Call Girls In Friends Colony Women Seeking Men
IAC 2024 - IA Fast Track to Search Focused AI Solutions
IAC 2024 - IA Fast Track to Search Focused AI Solutions
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
Factors to Consider When Choosing Accounts Payable Services Providers.pptx
Factors to Consider When Choosing Accounts Payable Services Providers.pptx
Histor y of HAM Radio presentation slide
Histor y of HAM Radio presentation slide
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdf
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdf
GenCyber Cyber Security Day Presentation
GenCyber Cyber Security Day Presentation
Salesforce Community Group Quito, Salesforce 101
Salesforce Community Group Quito, Salesforce 101
EIS-Webinar-Prompt-Knowledge-Eng-2024-04-08.pptx
EIS-Webinar-Prompt-Knowledge-Eng-2024-04-08.pptx
The 7 Things I Know About Cyber Security After 25 Years | April 2024
The 7 Things I Know About Cyber Security After 25 Years | April 2024
Breaking the Kubernetes Kill Chain: Host Path Mount
Breaking the Kubernetes Kill Chain: Host Path Mount
Kalyanpur ) Call Girls in Lucknow Finest Escorts Service 🍸 8923113531 🎰 Avail...
Kalyanpur ) Call Girls in Lucknow Finest Escorts Service 🍸 8923113531 🎰 Avail...
A Domino Admins Adventures (Engage 2024)
A Domino Admins Adventures (Engage 2024)
WhatsApp 9892124323 ✓Call Girls In Kalyan ( Mumbai ) secure service
WhatsApp 9892124323 ✓Call Girls In Kalyan ( Mumbai ) secure service
105_2_digitalSystem_Chap_3_part_3.ppt
1.
Charles Kime &
Thomas Kaminski © Pearson Education, Inc. Chapter 3 – Combinational Logic Design Part 3 – Arithmetic Functions Logic and Computer Design Fundamentals
2.
© Pearson Education,
Inc. Overview Part 1 – Design Procedure Part 2 – Combinational Logic Part 3 – Arithmetic Functions • Iterative combinational circuits • Binary adders Half and full adders Ripple carry and carry lookahead adders • Binary subtraction • Binary adder-subtractors Signed binary numbers Signed binary addition and subtraction Overflow • Binary multiplication • Other arithmetic functions Design by contraction Chapter 3 - Part 3 2
3.
© Pearson Education,
Inc. Iterative Combinational Circuits Arithmetic functions • Operate on binary vectors • Use the same subfunction in each bit position Can design functional block for subfunction and repeat to obtain functional block for overall function Cell - subfunction block Iterative array - a array of interconnected cells An iterative array can be in a single dimension (1D) or multiple dimensions Chapter 3 - Part 3 3 3-8 Iterative Combinational Circuits
4.
© Pearson Education,
Inc. Block Diagram of a 1D Iterative Array Example: n = 32 • Number of inputs = ? • Truth table rows = ? • Equations with up to ? input variables • Equations with huge number of terms • Design impractical! Iterative array takes advantage of the regularity to make design feasible Chapter 3 - Part 3 4 3-8 Iterative Combinational Circuits
5.
© Pearson Education,
Inc. Functional Blocks: Addition Binary addition used frequently Addition Development: • Half-Adder (HA), a 2-input bit-wise addition functional block, • Full-Adder (FA), a 3-input bit-wise addition functional block, • Ripple Carry Adder, an iterative array to perform binary addition, and • Carry-Look-Ahead Adder (CLA), a hierarchical structure to improve performance. Chapter 3 - Part 3 5 3-9 Binary Adders
6.
© Pearson Education,
Inc. Functional Block: Half-Adder A 2-input, 1-bit width binary adder that performs the following computations: A half adder adds two bits to produce a two-bit sum The sum is expressed as a sum bit , S and a carry bit, C The half adder can be specified as a truth table for S and C X 0 0 1 1 + Y + 0 + 1 + 0 + 1 C S 0 0 0 1 0 1 1 0 X Y C S 0 0 0 0 0 1 0 1 1 0 0 1 1 1 1 0 Chapter 3 - Part 3 6 Half Adder
7.
© Pearson Education,
Inc. Logic Simplification: Half-Adder The K-Map for S, C is: This is a pretty trivial map! By inspection: and These equations lead to several implementations. Y X 0 1 3 2 1 1 S Y X 0 1 3 2 1 C ) Y X ( ) Y X ( S Y X Y X Y X S + × + = = × + × = ) ( C Y X C ) Y X ( × = × = Chapter 3 - Part 3 7 Half Adder
8.
© Pearson Education,
Inc. Five Implementations: Half-Adder We can derive following sets of equations for a half- adder: (a), (b), and (e) are SOP, POS, and XOR implementations for S. In (c), the C function is used as a term in the AND- NOR implementation of S, and in (d), the function is used in a POS term for S. Y X C ) ( S ) c ( Y X C ) Y X ( ) Y X ( S ) b ( Y X C Y X Y X S ) a ( Y X C × = = × = + × + = × = × + × = × + Y X C Y X S ) e ( ) Y X ( C C ) Y X ( S ) d ( × = = + = × + = C Chapter 3 - Part 3 8 Half Adder
9.
© Pearson Education,
Inc. Implementations: Half-Adder The most common half adder implementation is: (e) A NAND only implementation is: Y X C Y X S × = = X Y C S X Y C S Chapter 3 - Part 3 9 Half Adder Y X C C Y C X C Y C X C Y X S = = + = + = ) ( ) ( ) (
10.
© Pearson Education,
Inc. Functional Block: Full-Adder A full adder is similar to a half adder, but includes a carry-in bit from lower stages. Like the half-adder, it computes a sum bit, S and a carry bit, C. • For a carry-in (Z) of 0, it is the same as the half-adder: • For a carry- in (Z) of 1: Z 0 0 0 0 X 0 0 1 1 + Y + 0 + 1 + 0 + 1 C S 0 0 0 1 0 1 1 0 Z 1 1 1 1 X 0 0 1 1 + Y + 0 + 1 + 0 + 1 C S 0 1 1 0 1 0 1 1 Chapter 3 - Part 3 10 Full Adder
11.
© Pearson Education,
Inc. Logic Optimization: Full-Adder Full-Adder Truth Table: Full-Adder K-Map: X Y Z C S 0 0 0 0 0 0 0 1 0 1 0 1 0 0 1 0 1 1 1 0 1 0 0 0 1 1 0 1 1 0 1 1 0 1 0 1 1 1 1 1 X Y Z 0 1 3 2 4 5 7 6 1 1 1 1 S X Y Z 0 1 3 2 4 5 7 6 1 1 1 1 C Chapter 3 - Part 3 11 Full Adder
12.
© Pearson Education,
Inc. Equations: Full-Adder From the K-Map, we get: The S function is the three-bit XOR function (Odd Function): The Carry bit C is 1 if both X and Y are 1 (the sum is 2), or if the sum is 1 and a carry-in (Z) occurs. Thus C can be re-written as: The term X·Y is carry generate. The term XY is carry propagate. Z Y Z X Y X C Z Y X Z Y X Z Y X Z Y X S + + = + + + = Z Y X S = Z ) Y X ( Y X C + = Chapter 3 - Part 3 12 Full Adder
13.
© Pearson Education,
Inc. Logic diagram of full adder Chapter 3 - Part 3 13 Z Y X S = Z ) Y X ( Y X C + =
14.
© Pearson Education,
Inc. Another Implementation of full adder Full Adder Schematic Here X, Y, and Z, and C (from the previous pages) are Ai, Bi, Ci and Ci+1, respectively. Also, G = generate and P = propagate. Note: This is really a combination of a 3-bit odd function (for S)) and Carry logic (for Ci+1): (G = Generate) OR (P =Propagate AND Ci = Carry In) Ci+1 = G + P · Ci Ai Bi Ci Ci+1 Gi Pi Si Chapter 3 - Part 3 14 Full Adder
15.
© Pearson Education,
Inc. Binary Adders To add multiple operands, we “bundle” logical signals together into vectors and use functional blocks that operate on the vectors Example: 4-bit ripple carry adder: Adds input vectors A(3:0) and B(3:0) to get a sum vector S(3:0) Note: carry out of cell i becomes carry in of cell i + 1 Description Subscript 3 2 1 0 Name Carry In 0 1 1 0 Ci Augend 1 0 1 1 Ai Addend 0 0 1 1 Bi Sum 1 1 1 0 Si Carry out 0 0 1 1 Ci+1 Chapter 3 - Part 3 15 Binary Ripple Carry Adders
16.
© Pearson Education,
Inc. 4-bit Ripple-Carry Binary Adder A four-bit Ripple Carry Adder made from four 1-bit Full Adders: B3 A 3 FA B2 A 2 FA B1 S3 C4 C0 C3 C2 C1 S2 S1 S0 A 1 FA B0 A 0 FA Chapter 3 - Part 3 16 Binary Ripple Carry Adders
17.
© Pearson Education,
Inc. Unsigned Subtraction Algorithm: • Subtract the subtrahend N from the minuend M • If no end borrow occurs, then M N, and the result is a non-negative number and correct. • If an end borrow occurs, the N > M and the difference M - N + 2n is subtracted from 2n, and a minus sign is appended to the result. Examples: 0 1 1001 0100 - 0111 - 0111 0010 1101 10000 - 1101 (-) 0011 Chapter 3 - Part 3 17 3-10 Binary Subtraction
18.
© Pearson Education,
Inc. Example for Unsigned Subtraction Chapter 3 - Part 3 18
19.
© Pearson Education,
Inc. Unsigned Subtraction (continued) The subtraction, 2n - X, is taking the 2’s complement of X To do both unsigned addition and unsigned subtraction requires: Quite complex! Goal: Shared simpler logic for both addition and subtraction Introduce complements as an approach A B Binary adder Binary subtractor Selective 2's complementer Quadruple 2-to-1 multiplexer Result Borrow Complement S 0 1 Subtract/Add Chapter 3 - Part 3 19 3-10 Binary Subtraction
20.
© Pearson Education,
Inc. Complements Two complements: • Diminished Radix Complement of N (r - 1)’s complement for radix r 1’s complement for radix 2 Defined as (rn - 1) - N • Radix Complement r’s complement for radix r 2’s complement in binary Defined as rn - N Subtraction is done by adding the complement of the subtrahend If the result is negative, takes its 2’s complement Chapter 3 - Part 3 20 Complements
21.
© Pearson Education,
Inc. Binary 1's Complement For r = 2, N = 011100112, n = 8 (8 digits): (rn – 1) = 256 -1 = 25510 or 111111112 The 1's complement of 011100112 is then: 11111111 – 01110011 10001100 Since the 2n – 1 factor consists of all 1's and since 1 – 0 = 1 and 1 – 1 = 0, the one's complement is obtained by complementing each individual bit (bitwise NOT). Chapter 3 - Part 3 21 Complements
22.
© Pearson Education,
Inc. Binary 2's Complement For r = 2, N = 011100112, n = 8 (8 digits), we have: (rn ) = 25610 or 1000000002 The 2's complement of 01110011 is then: 100000000 – 01110011 10001101 Note the result is the 1's complement plus 1, a fact that can be used in designing hardware Chapter 3 - Part 3 22 Complements
23.
© Pearson Education,
Inc. Alternate 2’s Complement Method Given: an n-bit binary number, beginning at the least significant bit and proceeding upward: • Copy all least significant 0’s • Copy the first 1 • Complement all bits thereafter. 2’s Complement Example: 10010100 • Copy underlined bits: 100 • and complement bits to the left: 01101100 Chapter 3 - Part 3 23 Complements
24.
© Pearson Education,
Inc. Subtraction with 2’s Complement For n-digit, unsigned numbers M and N, find M - N in base 2: • Add the 2's complement of the subtrahend N to the minuend M: M + (2n - N) = M - N + 2n • If M N, the sum produces end carry rn which is discarded; from above, M - N remains. • If M < N, the sum does not produce an end carry and, from above, is equal to 2n - ( N - M ), the 2's complement of ( N - M ). • To obtain the result - (N – M) , take the 2's complement of the sum and place a - to its left. Chapter 3 - Part 3 24 Subtraction Using 2s Complement
25.
© Pearson Education,
Inc. Unsigned 2’s Complement Subtraction Example 1 Find 010101002 – 010000112 01010100 01010100 – 01000011 + 10111101 00010001 The carry of 1 indicates that no correction of the result is required. 1 2’s comp Chapter 3 - Part 3 25 Subtraction Using 2s Complement
26.
© Pearson Education,
Inc. Unsigned 2’s Complement Subtraction Example 2 Find 010000112 – 010101002 01000011 01000011 – 01010100 + 10101100 11101111 00010001 The carry of 0 indicates that a correction of the result is required. Result = – (00010001) 0 2’s comp 2’s comp Chapter 3 - Part 3 26 Subtraction Using 2s Complement
27.
© Pearson Education,
Inc. Chapter 3 - Part 3 27
28.
© Pearson Education,
Inc. 3-11 Binary Adder-Subtractors ADDER-SUBTRACTORS Chapter 3 - Part 3 28
29.
© Pearson Education,
Inc. Signed Integers Positive numbers and zero can be represented by unsigned n-digit, radix r numbers. We need a representation for negative numbers. To represent a sign (+ or –) we need exactly one more bit of information (1 binary digit gives 21 = 2 elements which is exactly what is needed). Since computers use binary numbers, by convention, the most significant bit is interpreted as a sign bit: s an–2 a2a1a0 where: s = 0 for Positive numbers s = 1 for Negative numbers and ai = 0 or 1 represent the magnitude in some form. Chapter 3 - Part 3 29 3-11 Binary Adder-Subtraction
30.
© Pearson Education,
Inc. Signed Integer Representations Signed-Magnitude – here the n – 1 digits are interpreted as a positive magnitude. Signed-Complement – here the digits are interpreted as the rest of the complement of the number. There are two possibilities here: • Signed 1's Complement Uses 1's Complement Arithmetic • Signed 2's Complement Uses 2's Complement Arithmetic Chapter 3 - Part 3 30 Signed Binary Numbers
31.
© Pearson Education,
Inc. Signed Integer Representation Example r =2, n=3 Number Sign -Mag. 1's Comp. 2's Comp. +3 011 011 011 +2 010 010 010 +1 001 001 001 +0 000 000 000 – 0 100 111 — – 1 101 110 111 – 2 110 101 110 – 3 111 100 101 – 4 — — 100 Chapter 3 - Part 3 31 Signed Binary Numbers
32.
© Pearson Education,
Inc. Signed Integer Representation Chapter 3 - Part 3 32
33.
© Pearson Education,
Inc. Signed-Magnitude Arithmetic If the parity of the two signs is 0: 1. Add the magnitudes. 2. Check for overflow (a carry out of the MSB) 3. The sign of the result is the same as the sign of the first operand. If the parity of the two signs is 1: 1. Subtract the second magnitude from the first. 2. If a borrow occurs: • take the two’s complement of result • and make the result sign the complement of the sign of the first operand. 3. Overflow will never occur. Chapter 3 - Part 3 33 Signed Binary Addition and Subtraction
34.
© Pearson Education,
Inc. Example 1: 0010 +0101 Example 2: 0010 +1101 Example 3: 1010 - 0101 Sign-Magnitude Arithmetic Examples Chapter 3 - Part 3 34 Signed Binary Addition and Subtraction
35.
© Pearson Education,
Inc. Signed-Complement Arithmetic Addition: 1. Add the numbers including the sign bits, discarding a carry out of the sign bits (2's Complement), or using an end-around carry (1's Complement). 2. If the sign bits were the same for both numbers and the sign of the result is different, an overflow has occurred. 3. The sign of the result is computed in step 1. Subtraction: Form the complement of the number you are subtracting and follow the rules for addition. Chapter 3 - Part 3 35 Signed Binary Addition and Subtraction
36.
© Pearson Education,
Inc. Example 1: 1101 +0011 Example 2: 1101 -0011 Signed 2’s Complement Examples Chapter 3 - Part 3 36 Signed Binary Addition and Subtraction
37.
© Pearson Education,
Inc. Signed Binary Addition Chapter 3 - Part 3 37
38.
© Pearson Education,
Inc. Signed Binary Subtraction Chapter 3 - Part 3 38
39.
© Pearson Education,
Inc. Overflow Detection Overflow occurs if n + 1 bits are required to contain the result from an n-bit addition or subtraction Overflow can occur for: • Addition of two operands with the same sign • Subtraction of operands with different signs Signed number overflow cases with correct result sign 0 0 1 1 + 0 - 1 - 0 + 1 0 0 1 1 Detection can be performed by examining the result signs which should match the signs of the top operand Chapter 3 - Part 3 39 Overflow
40.
© Pearson Education,
Inc. Overflow Detection Signed number cases with carries Cn and Cn-1 shown for correct result signs: 0 0 0 0 1 1 1 1 0 0 1 1 + 0 -1 -0 +1 0 0 1 1 Signed number cases with carries shown for erroneous result signs (indicating overflow): 0 1 0 1 1 0 1 0 0 0 1 1 + 0 - 1 -0 + 1 1 1 0 0 Simplest way to implement overflow V = Cn + Cn - 1 This works correctly only if 1’s complement and the addition of the carry in of 1 is used to implement the complementation! Otherwise fails for - 10 ... 0 Chapter 3 - Part 3 40 Overflow
41.
© Pearson Education,
Inc. Overflow Detection Chapter 3 - Part 3 41
42.
© Pearson Education,
Inc. 3-12 Other Arithmetic Functions Convenient to design the functional blocks by contraction - removal of redundancy from circuit to which input fixing has been applied Functions • Incrementing • Decrementing • Multiplication by Constant • Division by Constant • Zero Fill and Extension Chapter 3 - Part 3 42 3-12 Other Arithmetic Functions
43.
© Pearson Education,
Inc. Design by Contraction Contraction is a technique for simplifying the logic in a functional block to implement a different function • The new function must be realizable from the original function by applying rudimentary functions to its inputs • Contraction is treated here only for application of 0s and 1s (not for X and X) • After application of 0s and 1s, equations or the logic diagram are simplified by using rules given on pages 224 - 225 of the text. Chapter 3 - Part 3 43
44.
© Pearson Education,
Inc. Design by Contraction Example Contraction of a ripple carry adder to incrementer for n = 3 • Set B = 001 • The middle cell can be repeated to make an incrementer with n > 3. Chapter 3 - Part 3 44
45.
© Pearson Education,
Inc. Incrementing & Decrementing Incrementing • Adding a fixed value to an arithmetic variable • Fixed value is often 1, called counting (up) • Examples: A + 1, B + 4 • Functional block is called incrementer Decrementing • Subtracting a fixed value from an arithmetic variable • Fixed value is often 1, called counting (down) • Examples: A - 1, B - 4 • Functional block is called decrementer Chapter 3 - Part 3 45
46.
© Pearson Education,
Inc. Multiplication/Division by 2n (a) Multiplication by 100 • Shift left by 2 (b) Division by 100 • Shift right by 2 • Remainder preserved B0 B1 B2 B3 C0 C1 0 0 C2 C3 C4 C5 (a) B0 B1 B2 B3 C0 C2 1 C2 2 C1 C2 0 0 C3 (b) Chapter 3 - Part 3 46
47.
© Pearson Education,
Inc. Multiplication by a Constant Multiplication of B(3:0) by 101 Chapter 3 - Part 3 47
48.
© Pearson Education,
Inc. Zero Fill Zero fill - filling an m-bit operand with 0s to become an n-bit operand with n > m Filling usually is applied to the MSB end of the operand, but can also be done on the LSB end Example: 11110101 filled to 16 bits • MSB end: 0000000011110101 • LSB end: 1111010100000000 Chapter 3 - Part 3 48 Zero Fill and Extension
49.
© Pearson Education,
Inc. Extension Extension - increase in the number of bits at the MSB end of an operand by using a complement representation • Copies the MSB of the operand into the new positions • Positive operand example - 01110101 extended to 16 bits: 0000000001110101 • Negative operand example - 11110101 extended to 16 bits: 1111111111110101 Chapter 3 - Part 3 49 Zero Fill and Extension
Baixar agora