Scribd
Upload
867 views5 pages

Binary to BCD Conversion Guide

The document describes the double-dabble algorithm for converting binary numbers to binary-coded decimal (BCD). [1] It works by repeatedly shifting the binary number left by one bit and adding 3 to the decimal place value if it is 5 or greater. [2] The example shows converting the 8-bit binary number 11111111 to the BCD number 255. [3] Additional details are provided on implementing the algorithm for 6-bit binary numbers.

Uploaded by

Nguyễn Long
Copyright
© Attribution Non-Commercial (BY-NC)
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
867 views5 pages

Binary to BCD Conversion Guide

The document describes the double-dabble algorithm for converting binary numbers to binary-coded decimal (BCD). [1] It works by repeatedly shifting the binary number left by one bit and adding 3 to the decimal place value if it is 5 or greater. [2] The example shows converting the 8-bit binary number 11111111 to the BCD number 255. [3] Additional details are provided on implementing the algorithm for 6-bit binary numbers.

Uploaded by

Nguyễn Long
Copyright
© Attribution Non-Commercial (BY-NC)
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
  • Binary-to-BCD Converter
  • Double-Dabble Algorithm
  • Conversion Examples
  • Additional Concepts
  • Practical Application

Binary-to-BCD Converter

Double-Dabble Binary-to-BCD
Conversion Algorithm

Basic Idea
Y X
1 0 1 1
 YX, X is a 4-bit binary number 1 0 1 1
1 0 1 1
 Y is a 4-bit binary number (Binary to binary)
1 0 1 1
⇒ can be done by only shifting
1 0 1 1
ex: 1011  1011 (shift left 4 times )
 Y is a BCD number (Binary to BCD)
ПX: 0000~1111, U X
РY: 00~15 (two BCD digits, at least 5 bits)) 1 0 1 1
ex: 01000  1000 1 0 1 1
?  1011 Shift left 1 0 1 1
if (U > 4) U  U*2+X[3] 1 0 1 1
then U=U+3; 1 0 1 1
Shift left;
Out of range
if (U > 4) then U will be U=U+6;
Binary-to-BCD Converter
Out of range after “shift left” 2
Double-Dabble Binary-to-BCD
Conversion Algorithm
Shift and Add-3 Algorithm (consider 8-bit binary)
1. Shift the binary number left one bit.
2. If 8 shifts have taken place, the BCD number is in
the Hundreds, Tens, and Units column.
3. If the binary value in any of the BCD columns is 5
or greater, add 3 to that value in that BCD column.
4. Go to 1.
Example: 8 bits
Operation Hundreds Tens Units Binary
HEX F F
Start 1 1 1 1 1 1 1 1

Binary-to-BCD Converter 3

Steps to convert an 8-bit binary number to BCD


Operation Hundreds Tens Units Binary
HEX F F
Start 1 1 1 1 1 1 1 1
Shift 1 1 1 1 1 1 1 1 1
Shift 2 1 1 1 1 1 1 1 1
Shift 3 1 1 1 1 1 1 1 1
Add 3 1 0 1 0 1 1 1 1 1
Shift 4 1 0 1 0 1 1 1 1 1
Add 3 1 1 0 0 0 1 1 1 1
Shift 5 1 1 0 0 0 1 1 1 1
Shift 6 1 1 0 0 0 1 1 1 1
Add 3 1 0 0 1 0 0 1 1 1 1
Shift 7 1 0 0 1 0 0 1 1 1 1
Add 3 1 0 0 1 0 1 0 1 0 1
Shift 8 1 0 0 1 0 1 0 1 0 1
BCD 2 5 5

Binary-to-BCD Converter 4
Example of converting hex E to BCD

Operation Tens Units Binary


HEX E
Start 1 1 1 0
Shift 1 1 1 1 0
Shift 2 1 1 1 0
Shift 3 1 1 1 0
Shift 4 1 1 1 0
6 0 1 1 0
Add 6 1 0 1 0 0
BCD 1 4

Binary-to-BCD Converter 5

Steps to convert a 6-bit binary number to BCD


Operation Tens Units Binary
1. Clear all bits of z to zero B 5 4 3 2 1 0

2. Shift B left 3 bits HEX 3 F


1 1 1 1 1 1
Start
z[8:3] = B[5:0]; Shift 1 1 1 1 1 1 1
3. Do 3 times Shift 2 1 1 1 1 1 1

if Units > 4 Shift 3 1 1 1 1 1 1


Add 3 1 0 1 0 1 1 1
then add 3 to Units Shift 4 1 0 1 0 1 1 1
(note: Units = z[9:6]) Add 3 1 1 0 0 0 1 1

Shift z left 1 bit Shift 5 1 1 0 0 0 1 1

4. Tens = P[6:4] = z[12:10] Shift 6 1 1 0 0 0 1 1


BCD 6 3
Units = P[3:0] = z[9:6] P 7 4 3 0
z 13 10 9 6 5 0

How to implement?
Binary-to-BCD Converter 6
Steps to convert a 6-bit binary number to BCD
Hex 3F
(Cont’d) 6-bit binary input

Operation Tens Units Binary


0 B5 B4 B3 B2 B1 B0
B 5 4 3 2 1 0
1 1 1 1 1 1
HEX 3 F
Start 1 1 1 1 1 1 C1
Shift 1 1 1 1 1 1 1
1 0 1 0
Shift 2 1 1 1 1 1 1
Shift 3 1 1 1 1 1 1 C2

Add 3 1 0 1 0 1 1 1 1 0 0 0
Shift 4 1 0 1 0 1 1 1
0 C3
Add 3 1 1 0 0 0 1 1
1 1 0 0 0 1 1 1 1 0 0 0 1 1
Shift 5
Shift 6 1 1 0 0 0 1 1
P7 P6 P5 P4 P3 P2 P1 P0
BCD 6 3
P 7 4 3 0
tens units
z 13 10 9 6 5 0 6 3
BCD output

Binary-to-BCD Converter 7

Truth table for Add-3 Module


A3 A2 A1 A0 S3 S2 S1 S0
0 0 0 0 0 0 0 0
0 0 0 1 0 0 0 1
A3 A2 A1 A0 0 0 1 0 0 0 1 0
0 0 1 1 0 0 1 1
0 1 0 0 0 1 0 0
0 1 0 1 1 0 0 0
Add-3 0 1 1 0 1 0 0 1
0 1 1 1 1 0 1 0
1 0 0 0 1 0 1 1
1 0 0 1 1 1 0 0
S3 S2 S1 S0 1 0 1 0 x x x x
1 0 1 1 x x x x
1 1 0 0 x x x x
1 1 0 1 x x x x
1 1 1 0 x x x x
1 1 1 1 x x x x

Binary-to-BCD Converter 8
K-Map for S3 A1 A0
A3 A2 A1 A0 S3 S2 S1 S0 A3 A2 00 01 11 10
0 0 0 0 0 0 0 0 00
0 0 0 1 0 0 0 1
0 0 1 0 0 0 1 0
0 0 1 1 0 0 1 1 01 1 1 1
0 1 0 0 0 1 0 0
0 1 0 1 1 0 0 0
0 1 1 0 1 0 0 1 11 x x x x
0 1 1 1 1 0 1 0
1 0 0 0 1 0 1 1
1 0 0 1 1 1 0 0 10 1 1 x x
1 0 1 0 x x x x
1 0 1 1 x x x x
1 1 0 0 x x x x S3 = A3+A2A0+A2A1
1 1 0 1 x x x x S2 = A3A0+A2A1’A0’
1 1 1 0 x x x x
1 1 1 1 x x x x S1 = A3A0’+A2’A1+A1A0
S0 = A3A0’+A3’A2’A0+A2A1A0’

Binary-to-BCD Converter 9

exercise

 Design a Verilog module to convert an


8-bit binary number to the BCD form.
module Binary_to_BCD_8(P,B);
output [9:0] P; //BCD form of B
input [7:0] B;
. . .
endmodule

Binary-to-BCD Converter 10

You might also like