请高手帮忙翻译一下下面的英语文章,是电子方面的专业性文章。
Compressionofthesign-extensionbits,representedbyE,isachievedbyfirstmergingthesignsoft...
Compression of
the sign-extension bits, represented by E, is achieved by first
merging the signs of the partial products, represented by S,
with the multiplicand. Their sum is then pre-computed as
shown in each partial product row. This removes the sign-
extension bits from the critical path of the compressor tree. S
is 0 if partial product is positive, otherwise it is 1. E is XOR
function of the multiplicand and the partial product. 展开
the sign-extension bits, represented by E, is achieved by first
merging the signs of the partial products, represented by S,
with the multiplicand. Their sum is then pre-computed as
shown in each partial product row. This removes the sign-
extension bits from the critical path of the compressor tree. S
is 0 if partial product is positive, otherwise it is 1. E is XOR
function of the multiplicand and the partial product. 展开
2个回答
展开全部
压缩的
符号扩展位,由电子,取得的第一次
合并部分产品,由 S 的迹象
与被乘数。它们的总和然后 pre-computed 作为
每个部分产品行所示。此操作将删除标志-
将关键路径中的位数扩展名的压缩机树。S
如果部分产品是积极的否则就是 1 是 0。E 是异或
被乘数和部分产品的功能。
符号扩展位,由电子,取得的第一次
合并部分产品,由 S 的迹象
与被乘数。它们的总和然后 pre-computed 作为
每个部分产品行所示。此操作将删除标志-
将关键路径中的位数扩展名的压缩机树。S
如果部分产品是积极的否则就是 1 是 0。E 是异或
被乘数和部分产品的功能。
已赞过
已踩过<
评论
收起
你对这个回答的评价是?
推荐律师服务:
若未解决您的问题,请您详细描述您的问题,通过百度律临进行免费专业咨询