All numerical values are fundamentally handled as binary numbers inside the FPGA. But that is not so human readable, isnt it? Even when we write a VHDL program, most of us would prefer to write,
a <= 10; instead of a <= "1010";.
When viewing signals in a simulation waveform, we can easily change the radix of the signal as per our convenience. But when we test the design on a real FPGA board, we would need to use dedicated display panels such as 7 segment decoders to see the binary numbers in decimal format. This is where BCD format comes in.
The decimal number 10, when converter to BCD format would be "10". Looks the same, except that, here each digit is given 4 bits for their storage. Though 4 bits can store from 0 to 15, we limit the range from 0 to 9, just like that of a regular decimal number.
In this blog post, I want to share a VHDL function for converting an 8 bit binary number into a 3 digit (or 12 bit binary) BCD number. BCD stands for Binary Coded Decimal. The algorithm used is known as double dabble. You can read more on it here at, Double Dabble(wiki).
A self checking testbench has been written as well, to verify the function.
BCD Converter + Testbench:
library ieee; use ieee.std_logic_1164.all; use ieee.numeric_std.all; --empty entity for testbenches. entity tb_bcd_conversion is end tb_bcd_conversion; architecture Behavioral of tb_bcd_conversion is --Function definition function to_bcd ( bin : unsigned(7 downto 0) ) return unsigned is variable i : integer:=0; variable bcd : unsigned(11 downto 0) := (others => '0'); begin for i in 7 downto 1 loop --iterating 7 times. --left shifting the bits and padding to the lsb bcd := bcd(10 downto 0) & bin(i); --increment 3 if BCD digit at 1's is greater than 4. if(bcd(3 downto 0) > 4) then bcd(3 downto 0) := bcd(3 downto 0) + 3; end if; --increment 3 if BCD digit at 10's is greater than 4. if(bcd(7 downto 4) > 4) then bcd(7 downto 4) := bcd(7 downto 4) + 3; end if; --we dont need to repeat the above if statement for 100's position. Why? --Because input is 8 bit, which means maximum value at 100's position is 2. end loop; bcd := bcd(10 downto 0) & bin(0); --final left shifting return bcd; --return the result end function to_bcd; --End of function definition --signals used to test the function. --They help us to view the results in simulation waveform signal bcd_out : unsigned(11 downto 0); signal bcd_out_int: integer; begin --process where we test the binary to bcd function stimulus_process: process --variables used for testing. --Varibales are useful because they get updated rightaway. --But they cant be seen in simulation waveform, thats why we assign --them to signals before exiting the process. variable bcd_out_int_var : integer; variable bcd_out_var : unsigned(11 downto 0); begin --test for all the 256 values the 8 bit input can take. for i in 0 to 255 loop bcd_out_var := to_bcd(to_unsigned(i,8)); --convert bcd to decimal value by multiplying respective digits with 1,10 and 100. bcd_out_int_var := to_integer(bcd_out_var(3 downto 0)) + to_integer(bcd_out_var(7 downto 4))*10 + to_integer(bcd_out_var(11 downto 8))*100; --the assert statement is used to implement a self checking testbench. --we dont need to manually verify if each input is correctly converted, --but the testbench does it for us. If the statement in the 'assert' is --incorrect a 'warning' message will be reported in modelsim assert bcd_out_int_var = i; --assign to signals to see the results in simulation waveform bcd_out_int <= bcd_out_int_var; bcd_out <= bcd_out_var; --let the results stay the same for some time, so that human eyes could catch it. wait for 10 ns; end loop; wait; --testing done. wait Endlessly. end process; end Behavioral;
Simulation Waveform:
binary = "01100011", output = "0000 1001 1001" (99).
binary = "11111110", output = "0010 0101 0100" (254).
binary = "10111011", output = "0001 1000 0111" (187).
The code was synthesised using Xilinx Vivado 2023.2. The schematic generated after synthesis is shared below:
Note :- The code can be modified to convert any length binary number to corresponding BCD digits. This require very little change in the code. May be you could try that as a homework.
15 Comments
Hi,
ReplyDeleteis it possible to create these netlist-graphics from the command-line using xilinx tools?
@marvin2k : See this link from xilinx.
ReplyDeletehttp://www.xilinx.com/itp/xilinx4/data/docs/xst/command_line9.html
@vipin: this is to synthesize a design? I meant something like the "RTL Viewer" mentioned in other posts (sorry, in fact I wanted to post in another blogentry of your blog...) to view the generated netlist.
ReplyDeleteThere is a command like this in that link :
ReplyDeleterun -ifn watchvhd.vhd -ifmt VHDL -ofn watchvhd.ngc -ofmt NGC -p xcv50-bg256-6 -opt_mode Speed
-opt_level 1
This will generate the ngc file.You have to open this file with a xilinx ngc file viewer.
Yes, and my question was if one can invoke such a tool from the commandline... sorry for this much text...
ReplyDeleteI havent explored command line options till.I guess you should try whatever is given in that link.Also share your experience here.
ReplyDeletecould we make it for n bit??
ReplyDelete@rourab : yes. you just have to understand the concept.you can make it for n bit. But the code will be more complicated.
ReplyDeletefunction to_bcd ( bin : std_logic_vector((n-1) downto 0) ) return std_logic_vector is
ReplyDeletevariable i : integer:=0;
variable j : integer:=1;
variable bcd : std_logic_vector(((4*q)-1) downto 0) := (others => '0');
variable bint : std_logic_vector((n-1) downto 0) := bin;
begin
for i in 0 to n-1 loop -- repeating 8 times.
bcd(((4*q)-1) downto 1) := bcd(((4*q)-2) downto 0); --shifting the bits.
bcd(0) := bint(n-1);
bint((n-1) downto 1) := bint((n-2) downto 0);
bint(0) :='0';
l1: for j in 1 to q loop
if(i < n-1 and bcd(((4*q)-1) downto ((4*q)-4)) > "0100") then --add 3 if BCD digit is greater than 4.
bcd(((4*q)-1) downto ((4*q)-4)) := bcd(((4*q)-1) downto ((4*q)-4)) + "0011";
end if;
end loop l1;
end loop;
return bcd;
end to_bcd;
the previous code i have written in generic form ,where q is the number bcd digit,in that case i got the desire result up to 9 but when it exceed over 9 it gives the A,B,C,D,E,F. i cant get my mistake,
ReplyDeletevipin i have solved my problem just replacing the q by j in the inner loop
ReplyDeleterourab, please, can you tell me which q you replaced by j in the inner loop?
ReplyDeleteI wrote similar code, but without generic parameter, and I had same problem (A,B,C..F).
function to_bcd ( bin : std_logic_vector((n-1) downto 0) ) return std_logic_vector is
ReplyDeletevariable i : integer:=0;
variable j : integer:=1;
variable bcd : std_logic_vector(((4*q)-1) downto 0) := (others => '0');
variable bint : std_logic_vector((n-1) downto 0) := bin;
begin
for i in 0 to n-1 loop -- repeating 8 times.
bcd(((4*q)-1) downto 1) := bcd(((4*q)-2) downto 0); --shifting the bits.
bcd(0) := bint(n-1);
bint((n-1) downto 1) := bint((n-2) downto 0);
bint(0) :='0';
l1: for j in 1 to q loop
if(i < n-1 and bcd(((4*j)-1) downto ((4*j)-4)) > "0100") then --add 3 if BCD digit is greater than 4.
bcd(((4*j)-1) downto ((4*j)-4)) := bcd(((4*j)-1) downto ((4*j)-4)) + "0011";
end if;
end loop l1;
end loop;
return bcd;
end to_bcd;
this is my code
rourab,
ReplyDeletethank you very much, but I still have problem with this code, even when its generic.
I wanted to convert 24-bit binary to 32-bit bcd and I inserted your function into my code, where I defined q := 8, because (4*q)-1) would be 32 bits.
When I wanna do 8-bit bin to 12-bit bcd, I need to define q := 3.
My question is:
What is relation between n and q, what is relation between number of bits for input (bin) and number of bits for output (bcd)?
Please, answer again...I am beginner and your little help is very great for me.
Sory for my bad english, i hope that you can understand me.
I found answer for my question, but I need help for implementing that solution.
ReplyDeleteRelation between n and q is :
**********************************************
q = round(n*(log(2)))
where q must be rounded to greater integer !!!,
**********************************************
for example:
for n = 24 and q = 8 it would be:
q = round (32*(log (2)))= round (24*0.3010)=round (7.224)= 8
I need help for implement this calculus for generic parameter (I want to make automatic calculus q = f(n)).
Is this possible to be done with "real" data type,could we use not-synthesizable data type for generic parameter , to make synthesizable entity ?