| 摘要 |
A partitioned multiplier circuit which is designed for high speed operations. The multiplier of the present invention can perform one 32x32 bit multiplication, two 16x16 bit multiplications (simultaneously) or four 8x8 bit multiplications (simultaneously) depending on input partitioning signals. The time required to perform either the 32x32 bit or the 16x16 bit or the 8x8 bit multiplications is constant. Therefore, multiplication results are available with a constant latency regardless of operand bit-size. In one embodiment, the latency is two clock cycles but the multiplier circuit has a throughput of one clock cycle due to pipelining. The input operands can be signed or unsigned. The hardware is partitioned without any significant increase in the delay or area and the multiplier can provide six different modes of operation. In one embodiment, Booth encoding is used for the generation of 17 partial products which are compressed using a compression tree into two 64-bit values. This is performed in the first pipeline stage to generate a sum and a carry vector. These values are then added, in the second pipestage, using a carry propagate adder circuit to provide a single 64-bit result. In the case of 16x16 bit multiplication, the 64-bit result contains two 32-bit results. In the case of 8x8 bit multiplication, the 64-bit result contains four 16-bit results. Due to its high operating speed, the multiplier circuit is advantageous for use in multi-media applications, such as audio/visual rendering and playback.
|
