

浏览全部资源
扫码关注微信
本文提出一种高速并行乘法器的新结构。该结构中
用Wallace树来简化改进的Booth算法
并用了一种便于用NMOS器件实现的斜进位全加器。在最后一级两位相加时
采用了具有高速进位性能的Manchester型全加器来代替一般通用的具有超前进位链的全加器
并提出了一种Manchester型全加器的新线路。该乘法器
不但门的总数比改进的Booth算法乘法器的少
且速度快。此外
它的全加器阵列形状规则
特别有利于VLSI的版图设计。
A new configuration of high speed parallel multiplier is presented. In this configuration
Wallace tree is used to simplify the modified Booth’s algorithm. Carry save adders
suitable for NMOS implementation
are used. In the last level of two bits addition
Manchester type adder with fast carry propagation is used instead of ordinary carry look -ahead adder. A new NMOS realization of Manchester adder is presented. The total gate count of this high speed parallel multiplier is less than that of the ordinary multiplier with modified Booth’s algorithm. The time of multiplicationis also reduced. Furthermore
the configuration of CSA array is much more regular. It is especially suitable for VLSI layout design.
0
Views
26
下载量
1
CSCD
Publicity Resources
Related Articles
Related Author
Related Institution
京公网安备11010802024621