Bit-level two's complement matrix multiplication
We present a novel design of a bit-level matrix multiplier in which individual bits of a word do not have to be processed as a unit. In bit-level architectures the carry propagation delay is eliminated from the critical path. For example, in matrix multiplication, the carry chain of calculating the product of two numbers is broken by sending the partial sums and carries of the product to the accumulating operation instead of the whole finished word. In contrast, in a word-level matrix multiplier a product of two words has to be computed completely before it can be added to the next word-level product. Bit-level architectures for fixed-point matrix multiplication are proven to be times faster than the corresponding word-level architecture, where p is the word length. The design is modified from our previous work to handle two's complement numbers as well. The design procedure is shown in detail by presenting the dependence graph, time and space mappings of our design. In addition, the time optimality and conflict-free properties of the design are also proven.
bit-level matrix multiplication mapping algorithms to hardware reconfigurable computing