Table of Contents
ISRN Electronics
Volume 2012 (2012), Article ID 253742, 9 pages
http://dx.doi.org/10.5402/2012/253742
Research Article

Design of High-Speed Adders for Efficient Digital Design Blocks

Department of Electronics and Communication, People’s Education Society Institute of Technology, Karnataka Bangalore 560 085, India

Received 19 June 2012; Accepted 22 July 2012

Academic Editors: J. Solsona and Y. Takahashi

Copyright © 2012 Deepa Yagain et al. 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. I. Koren, Computer Arithmetic Algorithms, A. K. Peters, 2002.
  2. B. Parhami, Computer Arithmetic—Algorithms and Hardware Designs, Oxford University Press, 2000.
  3. M. Ergecovac and T. Lang, Digital Arithmetic, Morgan-Kauffman, 2003.
  4. P. M. Kogge and H. S. Stone, “A parallel algorithm for the efficient solution of a general class of recurrence equations,” IEEE Transactions on Computers, vol. C-22, no. 8, pp. 786–793, 1973. View at Google Scholar · View at Scopus
  5. J. Sklansky, “Conditional-sum addition logic,” IRE Transactions on Electronic Computers, vol. 9, pp. 226–231, 1960. View at Google Scholar
  6. R. P. Brent and H. T. Kung, “A Regular Layout for Parallel Adders,” IEEE Transactions on Computers, vol. C-31, no. 3, pp. 260–264, 1982. View at Google Scholar · View at Scopus
  7. T. Han and D. Carlson, “Fast area-efficient VLSI adders,” in Proceedings of IEEE Symposium on Computer Arithmetic, pp. 49–56, May 1987.
  8. H. Ling, “High-speed binary adder,” IBM Journal of Research and Development, vol. 25, pp. 156–166, 1981. View at Google Scholar
  9. A. Baliga and D. Yagain, “Design of High speed adders using CMOS and Transmission gates in Submicron Technology: a Comparative Study,” in Proceedings of the 4th International Conference on Emerging Trends in Engineering and Technology (ICETET '11), pp. 284–289, November 2011.
  10. S. Knowles, “A family of adders,” in Proceedings of the 15th IEEE Symposium on Computer Arithmetic, pp. 277–281, June 2001.
  11. S. Knowles, “A family of adders,” in Proceedings of the 14th IEEE Symposium on Computer Arithmetic, pp. 30–34, April 1999.
  12. R. E. Ladner and M. J. Fischer, “Parallel prefix computation,” Journal of the ACM, vol. 27, no. 4, pp. 831–838, 1980. View at Google Scholar
  13. S. Veeramachaneni, M. K. Krishna, L. Avinash, P. Sreekanth Reddy, and M. B. Srinivas, “Efficient design of 32-bit comparator using carry look-ahead logic,” in Proceedings of the IEEE North-East Workshop on Circuits and Systems (NEWCAS '07), pp. 867–870, August 2007. View at Publisher · View at Google Scholar · View at Scopus
  14. M. Nesenbergs and V. O. Mowery, “Logic synthesis of high speed digital comparators,” Bell System Technical Journal, vol. 38, pp. 19–44, 1959. View at Google Scholar