节点文献

顶层进位级联CLA的算法与设计规则

Algorithm of TC~2CLA (Top-level Carry Cascade Carry Lookahead Adders) and its design rule

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 王礼平王观凤

【Author】 Wang Lipin Wang Guanfeng Wang Lipin Assoc. Prof.; College of Electronic & Information Eng., South Central Univ. for Nationalities, Wuhan 430074, China.

【机构】 中南民族大学电子信息工程学院中南民族大学电子信息工程学院 湖北武汉430074湖北武汉430074

【摘要】 提出了一种新型加法器结构———顶层进位级联超前进位加法器 ,该结构将超前进位加法器 (CLA)底层进位改为顶层超前进位单元进位 .给出了顶层进位级联超前进位加法器延迟时间公式 .推导出该结构模块延迟时间公式、最大级联数Km(max) 、最优分组方案等重要结果 ,并归纳出优化设计规则

【Abstract】 The structure of Carry Lookahead Adder (CLA) replaced bottom level carry cascade with top level LAC (Look Ahead Carry) carry cascade among modules. The propagation delay time of the highest bit carry was reduced by K m(m-1)t pd and maximum delay time of the highest bit sum by K m(m-1)t pd . Resource expense and power dissipation were fixed. The delay time formulae of TC 2CLA were given based on the standard delayed model of logic gate and optimum circuit unit. The sense of all teams in the formulae was expounded. The delay time formulae of the module of TC 2CLA, the maximum cascade number K m (max) , the optimum layout of grouping and the above results were deducted. The optimum design rule of TC 2CLA was inducted from power dissipation and area constraint reflected by maximum fanin and fanout and speed constraint. The designed 32?bit TC 2CLA showed a maximum of 6 fanouts and a critical path with logic depth of 4.

  • 【文献出处】 华中科技大学学报(自然科学版) ,Journal of Huazhong University of Science and Technology , 编辑部邮箱 ,2004年07期
  • 【分类号】TP332
  • 【被引频次】7
  • 【下载频次】50
节点文献中: 

本文链接的文献网络图示:

本文的引文网络