期刊文献+

32位最大速率流水加法器的研究与实现 被引量:2

Research and Implementation of 32-Bit Maximum Rate Pipelined Adder
在线阅读 下载PDF
导出
摘要 与传统的流水线方法不同,最大速率流水移除了数字电路内部的同步器件,利用电路的延时特性,在一段组合电路中同时传播多个数据行波,达到了高速运算的目的。文章首先介绍了最大速率流水技术的时钟约束和使用CMOS工艺进行最大速率流水设计需要解决的问题,然后使用最大速率流水的思想设计了一个32位超前进位加法器。与传统流水的加法器的比较结果表明最大速率流水技术显著提高了加法器的运算速度。 Maximum Rate Pipeline technique removes the inner synchronous units in digital circuits, and allows multiple data waves propagating along the combinational logic at the same time, therefore leading to noticeable acceleration of computation. This paper introduced the timing constraints of Maximum Rate Pipeline and the problems of applying it onto CMOS technology, and then designed a 32-bit adder with the maximum rate pipeline requirement. Its comparison result with traditional adder reveals its noticeable superiority.
作者 李振 高德远
出处 《微电子学与计算机》 CSCD 北大核心 2006年第8期21-24,共4页 Microelectronics & Computer
关键词 最大速率流水 行波流水 K-S结构 Maximum rote pipeline, Pipeline, K-S adder
  • 相关文献

参考文献5

  • 1K Nowka.High-Performance CMOS System Design Using Wave Pipelining.PhD Dissertation,Department of Electrical Engineering,Stanford University,1995
  • 2DC Wong,G De Micheli,MJ Flynn Wong:Designing highperformance digital circuits using wave pipelining:algorithms and practical Experiences.IEEE Trans.On Computer Aided Design of Integrated Circuits and Systems,1993
  • 3F Klass.Balancing Circuits for Wave Pipelining.Technical report CSL-TR-92 -549,Stanford University,October 1992
  • 4T S Kim,W Burleson,M Ciesielski.Delay buffer insertion for wave-pipelined circuits.in Notes of IFIP Int.Workshop Logic Architecture Synthesis,Grenoble,France,Dec.1993
  • 5W Burleson,M Ciesielski,E Klass,W.Liu.Wave-Pipelining:A Tutorial and Research Survey.IEEE Transactions 011 VLSI Systems,1998,6(3):464~474

同被引文献13

  • 1王礼平,王观凤.超前进位加法器混合模块延迟公式及优化序列[J].微电子学与计算机,2005,22(1):152-155. 被引量:4
  • 2Smith A Beaumont, Lira C. Parallel Prefix Adder Design [A]. Proc. 15th IEEE Symposium Computer Arithmetic [C]. 2001:218-225.
  • 3Huang C, Wang J, Huang Y. Design of High - performance CMOS Priority Encoders and Incrementer/Decrementers using Multilevel Lookahead and Multilevel Folding Techniques[J]. IEEE Solid - State Circuits,2002,37(1) :6:3 - 76.
  • 4Parhami B. Computer Arithmetic: Algorithms and Hardware Designs[M]. Oxford : Oxford University Press, 2000.
  • 5David Harris. A Taxonomy of Parallel Prefix Networks[A]. Proc. 37th Asilomar Conf. Signals, Systems and Computers [C]. 2003:2 213-2 217.
  • 6Neit H E Weste,David Harris. CMOS VLSI Design: A Circuits and Systems Perspective [M].北京:机械工业出版社.2005.
  • 7Weste N, Eshraghiam K. Principles of CMOS VLSI Design [M]. Boston: Addison Wesley, 1993.
  • 8Harris D, Horowitz M A. Skew - Tolerant Domino Circuits[J]. IEEE Journal of Solid - State Circuit, 1997,32 : 1 702 -1 711.
  • 9Rabaey Jan M.数字集成电路设计透视[M].北京:清华大学出版社,1998.
  • 10Peter M Kogge, Harold S Stone. A parallel algorithm for the efficient solution of a general class of recurrence equations [J]. IEEE Transactions on Computers, 1973, 22 (8) :786-792.

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部