Home.Verilog.Digital Design.Digital Basics.Python.RF Basics.
Previous.
Next.
Custom Search

Feedback ? Send it to admin@fullchipdesign.com or join me at fullchip@gmail.com

Legal Disclaimer

Chip Designing for ASIC/ FPGA Design engineers and Students
FULLCHIPDESIGN
Digital-logic Design...  Dream for many students… start learning front-end…
Try navigation bar on top to explore the contents @ fullchipdesign

Legal Disclaimer

Custom Search
Binary Numbers.

1s_complement.

2s_complement.

Binary Subtraction.

Examples.

Sign_magnitude.

Gray coding.

BCD coding.

Digital gates.

NAND NOR & XNOR.

Theorems.

Boolean Functions.

BFunc Examples.

Minterm Maxterm.

Sum of Minterms.

Prdt of Maxterms.

2 var K-map.

3 var K-map.

4 var K-map.

5 var K-map.

Prime Implicant.

PI example.

BCD Coding:

BCD stands for Binary Encoded Digital.

In BCD every decimal number is represented by four binary bits.

190 in decimal is equivalent to 0001 1001 0000 in binary

0 to 9 in decimal can be represented in binary using four digits and all integers can be represented by these 10 digits.

BCD addition and Decimal Arithmetic

Approach

In BCD addition of two numbers involve following rules:-

1. Maximum value of the sum for two digits = 9(max digit 1) + 9(max digit 2) + 1    (previous addition carry) = 19

2. If sum of two BCD digits is less than or equal to 9 (1001) without carry then the result is a correct BCD number.

3. If sum of two BCD digits is greater than or equal to 10 (1010) the result is in-correct  BCD number. Perform steps 4 for correct BCD sum.

4. Add 6 (0110) to the result.

Examples:- BCD Addition

Add 599 and 984

Answer.  Result of BCD addition is 1583

Sum I, II and III are greater than 9.

So, from Step 3 and 4 add ‘6’ to the sum.

I
II
III
0101
1001
1001
1001
1000
0100
1110
(14 decimal)
10001 (11 decimal)
1101
(13 decimal)
8
5
3
1