基于四叉树的高速乘法器算法研究  

High speed multiplier algorithm based on four-tree structure

作　　者：刘磊[1] 严晓浪[1] 孟建熠[1] 葛海通[1] 

机构地区：[1]浙江大学超大规模集成电路设计研究所,杭州310027

出　　处：《计算机应用研究》2010年第10期3727-3730,共4页Application Research of Computers

摘　　要：提出了一种基于四叉树结构的高速乘法器自动综合优化算法以提升乘法器运算速度。首先对延时较大的高位积采用四叉树递归直接构建,取代传统部分积进位链,缩短关键路径时延,进而进行分支折合和合并,相邻乘法结果共享部分四叉树,降低硬件开销。算法同时支持不同面积约束下的自动综合。依此算法的乘法器相比基于Booth算法和Wallace树的乘法器速度提高了10%。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.

关 键 词：进位链 延迟 四叉树 分支合并 分支折合 遍历 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]