My last column introduced the concepts underlying BCD (binary-coded-decimal) representations. In particular, we considered unsigned versus 10s-complement versions of BCD numbers. In this column we are ...

We worked our way up to logic gate implementations for half adders and full adders, as illustrated below. In closing, I asked you to start thinking about how we could use these functions to add two ...

Editor's Note: This is the first article in a two-part series on decimal representations and decimal arithmetic in general, and on Binary Coded Decimal (BCD) in particular. In this first installment, ...

Before we plunge headfirst into the fray with gusto and abandon, let’s briefly remind ourselves how we got here. In Part 1, we introduced the concepts of integers, signed integers, and unsigned ...