Abstract
A simple approach for implementing integer binary multiplication without rounding is proposed. In two versions of this approach, multiplication is implemented through the use of adders together with a small ROM that stores either a table of the squares of integers or half of such a table. The improved version of this approach has several advantages over other existing approaches for table-assisted multiplication, including smaller ROM size and simpler and/or less arithmetic operations. The extension of the present approach to complex multiplication is also explored.