Multi-operand adder synthesis on FPGAs using generalized parallel counters

Taeko Matsunaga, Shinji Kimura, Yusuke Matsunaga

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

Abstract

Multi-operand adders usually consist of compression trees which reduce the number of operands per a bit to two, and a carry-propagate adder for the two operands in ASIC implementation. The former part is usually realized using full adders or (3;2) counters like Wallace-trees in ASIC, while adder trees or dedicated hardware are used in FPGA. In this paper, an approach to realize compression trees on FPGAs is proposed. In case of FPGA with m-input LUT, any counters with up to m inputs can be realized with one LUT per an output. Our approach utilizes generalized parallel counters (GPCs) with up to m inputs and synthesizes high-performance compression trees by setting some intermediate height limits in the compression process like Dadda's multipliers. Experimental results show its effectiveness against existing approaches at GPC level and on Altera's Stratix III.

Original languageEnglish
Title of host publication2010 15th Asia and South Pacific Design Automation Conference, ASP-DAC 2010
Pages337-342
Number of pages6
DOIs
Publication statusPublished - Apr 28 2010
Event2010 15th Asia and South Pacific Design Automation Conference, ASP-DAC 2010 - Taipei, Taiwan, Province of China
Duration: Jan 18 2010Jan 21 2010

Publication series

NameProceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC

Other

Other2010 15th Asia and South Pacific Design Automation Conference, ASP-DAC 2010
CountryTaiwan, Province of China
CityTaipei
Period1/18/101/21/10

Fingerprint

Adders
Field programmable gate arrays (FPGA)
Application specific integrated circuits
Hardware

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering

Cite this

Matsunaga, T., Kimura, S., & Matsunaga, Y. (2010). Multi-operand adder synthesis on FPGAs using generalized parallel counters. In 2010 15th Asia and South Pacific Design Automation Conference, ASP-DAC 2010 (pp. 337-342). [5419871] (Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC). https://doi.org/10.1109/ASPDAC.2010.5419871

Multi-operand adder synthesis on FPGAs using generalized parallel counters. / Matsunaga, Taeko; Kimura, Shinji; Matsunaga, Yusuke.

2010 15th Asia and South Pacific Design Automation Conference, ASP-DAC 2010. 2010. p. 337-342 5419871 (Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Matsunaga, T, Kimura, S & Matsunaga, Y 2010, Multi-operand adder synthesis on FPGAs using generalized parallel counters. in 2010 15th Asia and South Pacific Design Automation Conference, ASP-DAC 2010., 5419871, Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC, pp. 337-342, 2010 15th Asia and South Pacific Design Automation Conference, ASP-DAC 2010, Taipei, Taiwan, Province of China, 1/18/10. https://doi.org/10.1109/ASPDAC.2010.5419871
Matsunaga T, Kimura S, Matsunaga Y. Multi-operand adder synthesis on FPGAs using generalized parallel counters. In 2010 15th Asia and South Pacific Design Automation Conference, ASP-DAC 2010. 2010. p. 337-342. 5419871. (Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC). https://doi.org/10.1109/ASPDAC.2010.5419871
Matsunaga, Taeko ; Kimura, Shinji ; Matsunaga, Yusuke. / Multi-operand adder synthesis on FPGAs using generalized parallel counters. 2010 15th Asia and South Pacific Design Automation Conference, ASP-DAC 2010. 2010. pp. 337-342 (Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC).
@inproceedings{af26d91682124e94aad576cc105b0af5,
title = "Multi-operand adder synthesis on FPGAs using generalized parallel counters",
abstract = "Multi-operand adders usually consist of compression trees which reduce the number of operands per a bit to two, and a carry-propagate adder for the two operands in ASIC implementation. The former part is usually realized using full adders or (3;2) counters like Wallace-trees in ASIC, while adder trees or dedicated hardware are used in FPGA. In this paper, an approach to realize compression trees on FPGAs is proposed. In case of FPGA with m-input LUT, any counters with up to m inputs can be realized with one LUT per an output. Our approach utilizes generalized parallel counters (GPCs) with up to m inputs and synthesizes high-performance compression trees by setting some intermediate height limits in the compression process like Dadda's multipliers. Experimental results show its effectiveness against existing approaches at GPC level and on Altera's Stratix III.",
author = "Taeko Matsunaga and Shinji Kimura and Yusuke Matsunaga",
year = "2010",
month = "4",
day = "28",
doi = "10.1109/ASPDAC.2010.5419871",
language = "English",
isbn = "9781424457656",
series = "Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC",
pages = "337--342",
booktitle = "2010 15th Asia and South Pacific Design Automation Conference, ASP-DAC 2010",

}

TY - GEN

T1 - Multi-operand adder synthesis on FPGAs using generalized parallel counters

AU - Matsunaga, Taeko

AU - Kimura, Shinji

AU - Matsunaga, Yusuke

PY - 2010/4/28

Y1 - 2010/4/28

N2 - Multi-operand adders usually consist of compression trees which reduce the number of operands per a bit to two, and a carry-propagate adder for the two operands in ASIC implementation. The former part is usually realized using full adders or (3;2) counters like Wallace-trees in ASIC, while adder trees or dedicated hardware are used in FPGA. In this paper, an approach to realize compression trees on FPGAs is proposed. In case of FPGA with m-input LUT, any counters with up to m inputs can be realized with one LUT per an output. Our approach utilizes generalized parallel counters (GPCs) with up to m inputs and synthesizes high-performance compression trees by setting some intermediate height limits in the compression process like Dadda's multipliers. Experimental results show its effectiveness against existing approaches at GPC level and on Altera's Stratix III.

AB - Multi-operand adders usually consist of compression trees which reduce the number of operands per a bit to two, and a carry-propagate adder for the two operands in ASIC implementation. The former part is usually realized using full adders or (3;2) counters like Wallace-trees in ASIC, while adder trees or dedicated hardware are used in FPGA. In this paper, an approach to realize compression trees on FPGAs is proposed. In case of FPGA with m-input LUT, any counters with up to m inputs can be realized with one LUT per an output. Our approach utilizes generalized parallel counters (GPCs) with up to m inputs and synthesizes high-performance compression trees by setting some intermediate height limits in the compression process like Dadda's multipliers. Experimental results show its effectiveness against existing approaches at GPC level and on Altera's Stratix III.

UR - http://www.scopus.com/inward/record.url?scp=77951223648&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77951223648&partnerID=8YFLogxK

U2 - 10.1109/ASPDAC.2010.5419871

DO - 10.1109/ASPDAC.2010.5419871

M3 - Conference contribution

AN - SCOPUS:77951223648

SN - 9781424457656

T3 - Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC

SP - 337

EP - 342

BT - 2010 15th Asia and South Pacific Design Automation Conference, ASP-DAC 2010

ER -