An algorithm for direct two''s-complement and sign-magnitude parallel multiplication is described. The partial product matrix representing the multiplication is converted to an equivalent matrix by encryption. Its reduction, producing the final result, needs no specialized adders and can be added with any parallel array addition technique. It contains no negative terms and no extra “correction” rows; in addition, it produces the multiplication with fewer than the minimal number of rows required for a direct multiplication process.
展开▼
