Multi-operand adder synthesis targeting FPGAs

Taeko Matsunaga, Shinji Kimura, Yusuke Matsunaga

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

Multi-operand adders, which calculates the summation of more than two operands, usually consist of compressor trees which reduce the number of operands to two without any carry propagation, and a carrypropagate adder for the two operands in ASIC implementation. The former part is usually realized using full adders or (3;2) counters likeWallace-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 highperformance compressor trees by setting some intermediate height limits in the compression process like Dadda's multipliers. Experimental results show that the number of GPCs are reduced by up to 22% compared to the existing heuristic. Its effectivity on reduction of delay is also shown against existing approaches on Altera's Stratix III.

Original languageEnglish
Pages (from-to)2579-2586
Number of pages8
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE94-A
Issue number12
DOIs
Publication statusPublished - 2011 Dec

Fingerprint

Adders
Field Programmable Gate Array
Field programmable gate arrays (FPGA)
Synthesis
Application specific integrated circuits
Compressors
Compressor
Compression
Summation
Multiplier
Hardware
Heuristics
Propagation
Calculate
Output
Experimental Results

Keywords

  • Arithmetic synthesis
  • FPGA
  • Generalized parallel counter
  • Multi-operand adder

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Graphics and Computer-Aided Design
  • Applied Mathematics
  • Signal Processing

Cite this

Multi-operand adder synthesis targeting FPGAs. / Matsunaga, Taeko; Kimura, Shinji; Matsunaga, Yusuke.

In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E94-A, No. 12, 12.2011, p. 2579-2586.

Research output: Contribution to journalArticle

@article{ff9bb8784a844b94a9e0bcfc48bfa6e3,
title = "Multi-operand adder synthesis targeting FPGAs",
abstract = "Multi-operand adders, which calculates the summation of more than two operands, usually consist of compressor trees which reduce the number of operands to two without any carry propagation, and a carrypropagate adder for the two operands in ASIC implementation. The former part is usually realized using full adders or (3;2) counters likeWallace-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 highperformance compressor trees by setting some intermediate height limits in the compression process like Dadda's multipliers. Experimental results show that the number of GPCs are reduced by up to 22{\%} compared to the existing heuristic. Its effectivity on reduction of delay is also shown against existing approaches on Altera's Stratix III.",
keywords = "Arithmetic synthesis, FPGA, Generalized parallel counter, Multi-operand adder",
author = "Taeko Matsunaga and Shinji Kimura and Yusuke Matsunaga",
year = "2011",
month = "12",
doi = "10.1587/transfun.E94.A.2579",
language = "English",
volume = "E94-A",
pages = "2579--2586",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "12",

}

TY - JOUR

T1 - Multi-operand adder synthesis targeting FPGAs

AU - Matsunaga, Taeko

AU - Kimura, Shinji

AU - Matsunaga, Yusuke

PY - 2011/12

Y1 - 2011/12

N2 - Multi-operand adders, which calculates the summation of more than two operands, usually consist of compressor trees which reduce the number of operands to two without any carry propagation, and a carrypropagate adder for the two operands in ASIC implementation. The former part is usually realized using full adders or (3;2) counters likeWallace-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 highperformance compressor trees by setting some intermediate height limits in the compression process like Dadda's multipliers. Experimental results show that the number of GPCs are reduced by up to 22% compared to the existing heuristic. Its effectivity on reduction of delay is also shown against existing approaches on Altera's Stratix III.

AB - Multi-operand adders, which calculates the summation of more than two operands, usually consist of compressor trees which reduce the number of operands to two without any carry propagation, and a carrypropagate adder for the two operands in ASIC implementation. The former part is usually realized using full adders or (3;2) counters likeWallace-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 highperformance compressor trees by setting some intermediate height limits in the compression process like Dadda's multipliers. Experimental results show that the number of GPCs are reduced by up to 22% compared to the existing heuristic. Its effectivity on reduction of delay is also shown against existing approaches on Altera's Stratix III.

KW - Arithmetic synthesis

KW - FPGA

KW - Generalized parallel counter

KW - Multi-operand adder

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

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

U2 - 10.1587/transfun.E94.A.2579

DO - 10.1587/transfun.E94.A.2579

M3 - Article

AN - SCOPUS:82655165402

VL - E94-A

SP - 2579

EP - 2586

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 12

ER -