二级进位跳跃加法器的优化方块分配.pdfVIP

2007 年 4 月 北 京 航 空 航 天 大 学 学 报 ApriI 2007 第33 卷 第4 期 JournaI of Beijing University of Aeronautics and Astronautics VoI. 33 No. 4 二级进位跳跃加法器的优化方块分配 崔晓平 王成华 （ 南京航空航天大学 信息科学与技术学院，南京 210016） 摘 要：提出了一种新的获得二级进位跳跃加法器优化方块分配的算法. 根据该算 法，在确定最坏路径延时的前提下，首先获得该延时下加法器最大的优化方块尺寸，然后确定 任意位二级进位跳跃加法器的优化方块尺寸. 优化方块分配的进位跳跃加法器可以缩短关键 路径的延时. 给出了加法器门级延时、复杂度的分析，分析结果显示，通过优化方块分配，可以 以较少的额外门电路获得快速的进位跳跃加法器. 该加法器已用 PSPICE 仿真工具进行了功 能验证和仿真. PSPICE 仿真分析表明，所提出的二级优化方块分配进位跳跃加法器的速度优 于等尺寸二级进位跳跃加法器. 关 键 词：加法器；进位跳跃加法器；门级延时；优化方块分配 中图分类号：TP 342. 21 文献标识码：A 文 章 编 号：1001-5965（2007）04-0495-05 Optimal block distribution in carry-skip adders Cui Xiaoping Wang Chenghua （ CoIIege of Information Science and TechnoIogy，Nanjing University of Aeronautics and Astronautics，Nanjing 210016，China） Abstract：A new type of optimaI bIock distribution aIgorithm of two IeveI carry-skip adder was described to determine optimaI bIock distribution sizes. According to this aIgorithm，with the given totaI worst case de- Iay，the maximum optimaI bIock distribution sizes of the adder for that deIay can be determined. It is simpIi- fied to obtain optimaI bIock distribution of any desired adder sizes. The carry skip adder optimaI bIock sizes can minimize criticaI path deIay. The anaIysis of gate deIay and compIexity were provided. AIthough the two- IeveI carry skip adder with optimaI bIock distribution uses a few extra gates，it provides better speed than the adders with fixed size bIocks. The adder has been functionaIIy verified and simuIated by using PSPICE. The simuIation anaIysis of time deIay reveaIs t