Skip to main navigation Skip to search Skip to main content

A regular parallel multiplier which utilizes multiple carry-propagate adders

  • Heizrik Eriksson
  • , Per Larsson-Edefors
  • , William P. Marnane
  • Linköping University

Research output: Chapter in Book/Report/Conference proceedings › Conference proceeding › peer-review

Abstract

A new regular partial-product reduction tree for parallel multipliers is presented in this paper. The reduction tree has a simple and efficient interconnect configuration and a minimal hardware usage. The reduction tree has a gate structure, which allows for extensive use of carry-propagation adders. Since carry-propagation adders can be very efficiently implemented, significant delay reduction is expected for large multipliers.

Original languageEnglish
Title of host publicationISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings
Pages166-169
Number of pages4
DOIs
Publication statusPublished - 2001
Event2001 IEEE International Symposium on Circuits and Systems, ISCAS 2001 - Sydney, NSW, Australia
Duration: 6 May 2001 → 9 May 2001

Publication series

NameISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings
Volume4

Conference

Conference2001 IEEE International Symposium on Circuits and Systems, ISCAS 2001
Country/TerritoryAustralia
CitySydney, NSW
Period6/05/01 → 9/05/01

Fingerprint

Dive into the research topics of 'A regular parallel multiplier which utilizes multiple carry-propagate adders'. Together they form a unique fingerprint.

Cite this