%0 Journal Article
%T High speed multiplier algorithm based on four-tree structure<br>基于四叉树的高速乘法器算法研究
%A LIU Lei
%A YAN Xiao-lang
%A MENG Jian-yi
%A GE Hai-tong
%A <br>刘磊
%A 严晓浪
%A 孟建熠
%A 葛海通
%J 计算机应用研究
%D 2010
%I 
%X This paper used an auto-synthesizing optimized arithmetic for speed up multiplier velocity. It used four-tree recursive method to reduce critical path, instead of traditional part product carry-in chain to generate high part of long-latency multiplier. Then it reduced hardware cost by branch breaking and combing to implement logic share between tree structures. Also it supported auto-synthesize within different area constraints. This new multiplier gets 10% faster than the one based on Booth arithmetic and Wallace tree.
%K carry chain
%K delay
%K four-tree
%K branch combining
%K branch breaking
%K tree traversal<br>进位链
%K 延迟
%K 四叉树
%K 分支合并
%K 分支折合
%K 遍历
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=382BF7C64F06D4040E14231A3909F02D&yid=140ECF96957D60B2&vid=DB817633AA4F79B9&iid=F3090AE9B60B7ED1&sid=4231CFBD7C99A971&eid=DCCD8D64CE91829B&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=12