Binary Addition Section 4.5. Binary Addition Example.
-
Upload
christopher-davis -
Category
Documents
-
view
229 -
download
5
Transcript of Binary Addition Section 4.5. Binary Addition Example.
![Page 1: Binary Addition Section 4.5. Binary Addition Example.](https://reader036.fdocuments.net/reader036/viewer/2022062518/56649e565503460f94b4e963/html5/thumbnails/1.jpg)
Binary Addition
Section 4.5
![Page 2: Binary Addition Section 4.5. Binary Addition Example.](https://reader036.fdocuments.net/reader036/viewer/2022062518/56649e565503460f94b4e963/html5/thumbnails/2.jpg)
Binary Addition Example
![Page 3: Binary Addition Section 4.5. Binary Addition Example.](https://reader036.fdocuments.net/reader036/viewer/2022062518/56649e565503460f94b4e963/html5/thumbnails/3.jpg)
Binary Addition (2)
![Page 4: Binary Addition Section 4.5. Binary Addition Example.](https://reader036.fdocuments.net/reader036/viewer/2022062518/56649e565503460f94b4e963/html5/thumbnails/4.jpg)
Derivation of ∑
Question: What primitive best implements ∑? • Inputs: A, B• Outputs: ∑=
B A ∑
0 0 0
1 0 1
0 1 1
1 1 0
![Page 5: Binary Addition Section 4.5. Binary Addition Example.](https://reader036.fdocuments.net/reader036/viewer/2022062518/56649e565503460f94b4e963/html5/thumbnails/5.jpg)
Derivation of Carry Out
Question: What primitive best implements Co? • Inputs: A, B• Outputs: Co =A∙B
B A Co
0 0 0
1 0 0
0 1 0
1 1 1
![Page 6: Binary Addition Section 4.5. Binary Addition Example.](https://reader036.fdocuments.net/reader036/viewer/2022062518/56649e565503460f94b4e963/html5/thumbnails/6.jpg)
Implementation of a Half-Adder
![Page 7: Binary Addition Section 4.5. Binary Addition Example.](https://reader036.fdocuments.net/reader036/viewer/2022062518/56649e565503460f94b4e963/html5/thumbnails/7.jpg)
Limitation of a Half Adder
A half-adder does not account for carry-in.
![Page 8: Binary Addition Section 4.5. Binary Addition Example.](https://reader036.fdocuments.net/reader036/viewer/2022062518/56649e565503460f94b4e963/html5/thumbnails/8.jpg)
Truth Table for a Full Adder
carry-in
![Page 9: Binary Addition Section 4.5. Binary Addition Example.](https://reader036.fdocuments.net/reader036/viewer/2022062518/56649e565503460f94b4e963/html5/thumbnails/9.jpg)
Karnaugh Map For the Sum Bit
= = =
![Page 10: Binary Addition Section 4.5. Binary Addition Example.](https://reader036.fdocuments.net/reader036/viewer/2022062518/56649e565503460f94b4e963/html5/thumbnails/10.jpg)
Karnaugh Map For the Carry-Out Bit
C=𝑥 ′ 𝑦𝑧+𝑥 𝑦 ′ 𝑧+𝑥𝑦=𝑧 (𝑥⊕𝑦 )+𝑥𝑦
![Page 11: Binary Addition Section 4.5. Binary Addition Example.](https://reader036.fdocuments.net/reader036/viewer/2022062518/56649e565503460f94b4e963/html5/thumbnails/11.jpg)
Implementation of a Full Adder
𝑆=𝑧 (𝑥⊕ 𝑦 )+𝑥𝑦C=𝑧⊕(𝑥⊕𝑦 )
(carry-in)
![Page 12: Binary Addition Section 4.5. Binary Addition Example.](https://reader036.fdocuments.net/reader036/viewer/2022062518/56649e565503460f94b4e963/html5/thumbnails/12.jpg)
Four-Bit Adder
C4 is calculated last because it takes C0 8 gates to reach C4.
![Page 13: Binary Addition Section 4.5. Binary Addition Example.](https://reader036.fdocuments.net/reader036/viewer/2022062518/56649e565503460f94b4e963/html5/thumbnails/13.jpg)
Alternative Naming Convention for the Full Adder
𝐺𝑖=𝐴𝑖𝐵 𝑖P i=(𝐴𝑖⊕𝐵𝑖)
C 𝑖+1=𝐺𝑖+𝑃𝑖𝐶𝑖S i=(𝑃𝑖⊕𝐶𝑖)
![Page 14: Binary Addition Section 4.5. Binary Addition Example.](https://reader036.fdocuments.net/reader036/viewer/2022062518/56649e565503460f94b4e963/html5/thumbnails/14.jpg)
Hardware Simplificationinput carry
)
2 gate delays for C3!
![Page 15: Binary Addition Section 4.5. Binary Addition Example.](https://reader036.fdocuments.net/reader036/viewer/2022062518/56649e565503460f94b4e963/html5/thumbnails/15.jpg)
Four-bit adder with Carry Lookahead