ABSTRACT
The algorithms for decimal multiplication are more complex than those for fixed-point multiplication. This is because decimal digits consist of four bits and have values in the range of 0 to 9, whereas fixed-point digits have values of 0 or 1. Decimal multiplication can be achieved by a process of repeated addition in which the multiplicand is added to the previous partial product a number of times that is equal to the multiplier. Converting from binary to binary-coded decimal (BCD) is accomplished by multiplying the BCD number by two repeatedly. Multiplying by two is accomplished by a left shift of one bit position followed by an adjustment, if necessary. The algorithm will be used for BCD multiplication by performing the multiply operation in the fixed-point number representation, and then converting the product to BCD notation. The design will be implemented using behavioral modeling.
