About this Journal Submit a Manuscript Table of Contents
VLSI Design
Volume 2013 (2013), Article ID 785281, 12 pages
http://dx.doi.org/10.1155/2013/785281
Research Article

A General Design Methodology for Synchronous Early-Completion-Prediction Adders in Nano-CMOS DSP Architectures

Department of Information Engineering, Electronics and Telecommunications, Sapienza University of Rome, Via Eudossiana 18, 00184 Rome, Italy

Received 12 September 2012; Revised 2 December 2012; Accepted 5 December 2012

Academic Editor: Meng-Hsueh Chiang

Copyright © 2013 Mauro Olivieri and Antonio Mastrandrea. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. Y. Kondo, N. Ikumi, K. Ueno, J. Mori, and M. Hirano, “Early-completion-detecting ALU for a 1 GHz 64 b datapath,” in Proceedings of theIEEE International Solid-State Circuits Conference (ISSCC '97), pp. 418–419, February 1997. View at Scopus
  2. Y. Chen, H. Li, C. K. Koh et al., “Variable-latency adder (VL-adder) designs for low power and NBTI tolerance,” IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 18, no. 11, pp. 1621–1624, 2010. View at Publisher · View at Google Scholar · View at Scopus
  3. J. Lee and K. Asada, “A synchronous completion prediction adder (SCPA),” IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol. E80-A, no. 3, pp. 606–609, 1997. View at Scopus
  4. M. Olivieri, “Design of synchronous and asynchronous variable-latency pipelined multipliers,” IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 9, no. 2, pp. 365–376, 2001. View at Publisher · View at Google Scholar · View at Scopus
  5. Y. Chen, H. Li, J. Li, and C. K. Koh, “Variable-latency adder (VL-adder): new arithmetic circuit design practice to overcome NBTI,” in International Symposium on Low Power Electronics and Design (ISLPED '07), pp. 195–200, Portland, Ore, USA, August 2007. View at Publisher · View at Google Scholar · View at Scopus
  6. A. De Gloria and M. Olivieri, “Statistical Carry Lookahead adders,” IEEE Transactions on Computers, vol. 45, no. 3, pp. 340–347, 1996. View at Scopus
  7. A. D. Gloria, “Completion-detecting carry select addition,” IEE Proceedings: Computers and Digital Techniques, vol. 147, no. 2, pp. 93–100, 2000. View at Publisher · View at Google Scholar · View at Scopus
  8. D. J. Kinniment, “An evaluation of asynchronous addition,” IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 4, no. 1, pp. 137–140, 1996. View at Scopus
  9. S. M. Nowick, K. Y. Yun, P. A. Beerel, and A. E. Dooply, “Speculative completion for the design of high-performance asynchronous dynamic adders,” in Proceedings of the 3rd International Symposium on Advanced Research Asynchronous Circuits and Systems, pp. 210–223, Eindhoven, The Netherlands, April 1997. View at Scopus
  10. O. J. Bedrij, “Carry-select adder,” IRE Transactions on Electronic Computers, vol. 11, pp. 340–346, 1962. View at Publisher · View at Google Scholar
  11. J. M. Rabaey, Digital Integrated Circuits: A Design Perspective, Prentice Hall, Upper Saddle River, NJ, USA, 2nd edition, 2003.
  12. N. H. Weste and K. Eshraghian, Principles of CMOS VLSI Design, Addison Wesley, Reading, Mass, USA, 2nd edition, 1994.
  13. D. Koes, T. Chelcea, C. Onyeama, and S. Goldstein, “Adding faster with application specific early termination,” Technical Report No. CMU-CS-05-101, Carnegie Mellon University, May 2005, http://www.cs.cmu.edu/~seth/papers/koes-tr05.html.
  14. B. E. Briley, “Some new results on average worst case carry,” IEEE Transactions on Computers, vol. 22, no. 5, pp. 459–463, 1973. View at Scopus
  15. G. W. Reitwiesner, “The determination of carry propagation length for binary addition,” IRE Transactions on Electronic Computers, vol. 9, no. 1, pp. 35–38, 1960. View at Publisher · View at Google Scholar
  16. I. Sutherland, B. Sproull, and D. Harris, Logical Effort: Designing Fast CMOS Circuits, Morgan-Kaufmann, San Francisco, Calif, USA, 1999.
  17. F. Lannutti, P. Nenzi, and M. Olivieri, “KLU sparse direct linear solver implementation into NGSPICE,” in Proceedings of the 19th International Conference on Mixed Design of Integrated Circuits and Systems (MIXDES '12), p. 69, 2012.
  18. A. Mastrandrea, M. Olivieri, and F. Menichelli, “A delay model allowing nano-CMOS standard cells statistical simulation at the logic level,” in Proceedings of the 7th IEEE Conference on Ph.D. Research in Microelectronics and Electronics (PRIME '11), pp. 217–220, Trento, Italy, July 2011.
  19. R. Vattikonda, W. Wang, and Y. Cao, “Modeling and minimization of PMOS NBTI effect for robust nanometer design,” in Proceedings of the 43rd Annual Design Automation Conference (DAC '06), pp. 1047–1052, ACM, San Francisco, Calif, USA, 2006. View at Publisher · View at Google Scholar