# Design the 2-digit binary-to-BCD code converter in the datapath for the Game of PIG. Design the least

## Question:

Design the 2-digit binary-to-BCD code converter in the datapath for the Game of PIG. Design the least significant digit as a function of (B_{3}, B_{2}, B_{1}, B_{0})

without an incoming carry C0. The outputs are to be C_{4}, D_{3}, D_{2}, D_{1}, D_{0}. Design the same circuit with an incoming carry C_{0} ixed to 1. For the most significant digit combine the results of these two designs to handle the actual case in which the incoming carry C_{0 }can be both 0 and 1. Minimize the combined result for the most significant digit.

Fantastic news! We've Found the answer you've been seeking!

## Step by Step Answer:

**Related Book For**

## Logic And Computer Design Fundamentals

**ISBN:** 9780133760637

5th Edition

**Authors:** M. Morris Mano, Charles Kime, Tom Martin