Scribd
Upload
56 views6 pages

Lec7 BCD Adder

The document discusses a binary coded decimal (BCD) adder. It explains that a BCD adder can add two 4-bit BCD numbers and accounts for carrying digits over 9. The adder is implemented using two 4-bit binary adders, where the first adds the BCD inputs in binary and the second corrects by adding 6 if the first result is over 9.

Uploaded by

yacine.ray.gas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
56 views6 pages

Lec7 BCD Adder

The document discusses a binary coded decimal (BCD) adder. It explains that a BCD adder can add two 4-bit BCD numbers and accounts for carrying digits over 9. The adder is implemented using two 4-bit binary adders, where the first adds the BCD inputs in binary and the second corrects by adding 6 if the first result is over 9.

Uploaded by

yacine.ray.gas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Digital Systems Design I

Lecture 7:
Combinational Logic –
BCD Adder
Fadi El-Hassan, Ph.D., P.Eng.
ECE – Concordia University
References & Copyrights
• Digital Design: With an Introduction to the Verilog HDL, VHDL, and
SystemVerilog, by M. Morris Mano and Michael D. Ciletti, 6th
Edition, Pearson, 2018.
• Digital Logic Circuit Analysis and Design, by V. P. Nelson, H. T. Nagle, B.
D. Carroll, & J. D. Irwin (1995). 2002.
• Digital Fundamentals, by T. L. Floyd, 11th edition, Pearson, 2014.
• Dr. Soleimani's lecture notes
• Dr. Gomar’s lecture notes
BCD Adder: Concept
Maximum BCD number is Examples:
9 → (1001) 7 0111
2+ 0010
Adding two BCD numbers: 9 1001
max. 9 + 9 + 1 = 19,
where 1 is the input carry. 1st stage 2nd stage
7 0111 1111
If the BCD sum > 9, a 6
8+ 1000 0110
(0110) is added to the
15 (15 > 9) 1111 10101
sum.

2-stage implementation:
Binary Sum BCD Sum
1st stage: normal binary 21 15
addition → 4-bit In decimal
2nd stage: add 6 if result of
1st stage > 9
BCD Adder
Maximum BCD
number is 9

Adding two BCD


numbers:
max. 9 + 9 + 1 = 19,
where 1 is the input
carry.

If the BCD sum > 9,


a 6 is added to the
sum.

C is a function of
the Binary Sum
inputs.
BCD Adder Truth Table

𝐶 = 𝐾 + 𝑍8 𝑍2 + 𝑍8 𝑍4
BCD Adder Implementation
The BCD Adder can be
implemented using two 4-bit
binary adders:
• One is used to add the two
BCD numbers in binary
• The second one is used to do
the correction and add the
result of the top adder with 6
if the result of the top adder is
greater than 9.
• Greater than 9 situation is
detected when there is a
decimal carry out (C=1)
𝐶 = 𝐾 + 𝑍8 𝑍2 + 𝑍8 𝑍4

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy