个性化文献订阅>期刊> IEEE Transactions on Computers
 

Reducing the Computation Time in (Short Bit-Width) Two's Complement Multipliers

  作者 Lamberti, F; Andrikos, N; Antelo, E; Montuschi, P  
  选自 期刊  IEEE Transactions on Computers;  卷期  2011年60-2;  页码  148-156  
  关联知识点  
 

[摘要]Two's complement multipliers are important for a wide range of applications. In this paper, we present a technique to reduce by one row the maximum height of the partial product array generated by a radix-4 Modified Booth Encoded multiplier, without any increase in the delay of the partial product generation stage. This reduction may allow for a faster compression of the partial product array and regular layouts. This technique is of particular interest in all multiplier designs, but especially in short bit-width two's complement multipliers for high-performance embedded cores. The proposed method is general and can be extended to higher radix encodings, as well as to any size square and m x n rectangular multipliers. We evaluated the proposed approach by comparison with some other possible solutions; the results based on a rough theoretical analysis and on logic synthesis showed its efficiency in terms of both area and delay.

 
      被申请数(0)  
 

[全文传递流程]

一般上传文献全文的时限在1个工作日内