# Minimization of Logical Equations

I have been giving a problem were I have to design 1-bit subtractor, which performs single bit binary subtraction. It has three inputs: the digits ai, bi (bi is subtracted from ai) and the borrow from the previous 1-bit subtractor Bi-1. The outputs are Di (the difference) and the borrow Bi from the next 1-bit subtractor. Present all four stages (truth tables of the both functions, sum of products, minimization and logical circuits). During minimization follow the same approach that we used in class for 1-bit adder design.

I have search around, but I still cannot figure out how to approach this problem. If anyone could shed some light it would be greatly appreciated.

• Write the truth table then Karnaugh-map for minimization? Commented Oct 15, 2012 at 17:36
• You seriously expect us to have a crystal ball and use it to see what approach was used in your class for the 1-bit adder?? Commented Oct 15, 2012 at 17:46
• @WoutervanOoijen I do not expect you to use a "crystal ball" I was asking if anyone could "shed light" on how to approach this problem. The professor does not teach. He gives you problems and yells "Do!" This is new to me and I just want to get a hold of it.
– Leo
Commented Oct 15, 2012 at 19:49
• @Leo but you question contains the phrase "follow the same approach we used in class". If that is not supposed to mean anything why did you include it? Commented Oct 15, 2012 at 20:03