This document describes how to design a combinational circuit to convert a binary number to a binary coded decimal (BCD) number using a shift-add-3 algorithm. The algorithm involves shifting each bit of the binary number left and adding 3 to the result if it is greater than 4. This converts it to a valid BCD value. The document provides examples and truth tables for implementing the shift-add-3 operation and an Add-3 module using logic gates or Verilog. The goal of the lab is to implement the full shift-add-3 circuit in a FPGA to convert an 8-bit binary number from switches to a BCD number displayed on a 7-segment LED display.
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
0 ratings0% found this document useful (0 votes)
498 views10 pages
Binary To BCD
This document describes how to design a combinational circuit to convert a binary number to a binary coded decimal (BCD) number using a shift-add-3 algorithm. The algorithm involves shifting each bit of the binary number left and adding 3 to the result if it is greater than 4. This converts it to a valid BCD value. The document provides examples and truth tables for implementing the shift-add-3 operation and an Add-3 module using logic gates or Verilog. The goal of the lab is to implement the full shift-add-3 circuit in a FPGA to convert an 8-bit binary number from switches to a BCD number displayed on a 7-segment LED display.