Framework for parallel prefix adder synthesis considering switching activities

Taeko Matsunaga, Shinji Kimura, Yusuke Matsunaga

研究成果: ジャーナルへの寄稿記事

抄録

This paper addresses parallel prefix adder synthesis which aims at minimizing the total switching activity under bitwise timing constraints. This problem is treated as synthesis of prefix graphs which represent global structures of parallel prefix adders at technology-independent level. An approach for timing-driven area minimization of prefix graphs has been already proposed which first finds the exact minimum solution on a specific subset of prefix graphs by dynamic programming, then restructures the result for further reduction by removing restrictions on the subset. In this paper, a switching cost of each node of a prefix graph is defined, and an approach to minimize the total switching cost is presented where our area minimization algorithm is extended to be able to calculate the switching cost using Ordered Binary-Decision Diagrams (OBDDs). Furthermore, a heuristic is integrated which estimates the effect of the restructuring phase in the dynamic programming phase, to improve the robustness of our algorithm under severe timing constraints. Through a series of experiments, the proposed approach is shown to be effective especially when timing constraints are not tight and/or there are comparably a large number of nodes with very low switching costs.

元の言語英語
ページ(範囲)212-221
ページ数10
ジャーナルIPSJ Transactions on System LSI Design Methodology
2
DOI
出版物ステータス出版済み - 12 1 2009

Fingerprint

Adders
Thermodynamic properties
Dynamic programming
Costs
Binary decision diagrams
Experiments

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering
  • Computer Science Applications

これを引用

Framework for parallel prefix adder synthesis considering switching activities. / Matsunaga, Taeko; Kimura, Shinji; Matsunaga, Yusuke.

:: IPSJ Transactions on System LSI Design Methodology, 巻 2, 01.12.2009, p. 212-221.

研究成果: ジャーナルへの寄稿記事

@article{ee10fcf18ac3439b85b653463281e983,
title = "Framework for parallel prefix adder synthesis considering switching activities",
abstract = "This paper addresses parallel prefix adder synthesis which aims at minimizing the total switching activity under bitwise timing constraints. This problem is treated as synthesis of prefix graphs which represent global structures of parallel prefix adders at technology-independent level. An approach for timing-driven area minimization of prefix graphs has been already proposed which first finds the exact minimum solution on a specific subset of prefix graphs by dynamic programming, then restructures the result for further reduction by removing restrictions on the subset. In this paper, a switching cost of each node of a prefix graph is defined, and an approach to minimize the total switching cost is presented where our area minimization algorithm is extended to be able to calculate the switching cost using Ordered Binary-Decision Diagrams (OBDDs). Furthermore, a heuristic is integrated which estimates the effect of the restructuring phase in the dynamic programming phase, to improve the robustness of our algorithm under severe timing constraints. Through a series of experiments, the proposed approach is shown to be effective especially when timing constraints are not tight and/or there are comparably a large number of nodes with very low switching costs.",
author = "Taeko Matsunaga and Shinji Kimura and Yusuke Matsunaga",
year = "2009",
month = "12",
day = "1",
doi = "10.2197/ipsjtsldm.2.212",
language = "English",
volume = "2",
pages = "212--221",
journal = "IPSJ Transactions on System LSI Design Methodology",
issn = "1882-6687",
publisher = "Information Processing Society of Japan",

}

TY - JOUR

T1 - Framework for parallel prefix adder synthesis considering switching activities

AU - Matsunaga, Taeko

AU - Kimura, Shinji

AU - Matsunaga, Yusuke

PY - 2009/12/1

Y1 - 2009/12/1

N2 - This paper addresses parallel prefix adder synthesis which aims at minimizing the total switching activity under bitwise timing constraints. This problem is treated as synthesis of prefix graphs which represent global structures of parallel prefix adders at technology-independent level. An approach for timing-driven area minimization of prefix graphs has been already proposed which first finds the exact minimum solution on a specific subset of prefix graphs by dynamic programming, then restructures the result for further reduction by removing restrictions on the subset. In this paper, a switching cost of each node of a prefix graph is defined, and an approach to minimize the total switching cost is presented where our area minimization algorithm is extended to be able to calculate the switching cost using Ordered Binary-Decision Diagrams (OBDDs). Furthermore, a heuristic is integrated which estimates the effect of the restructuring phase in the dynamic programming phase, to improve the robustness of our algorithm under severe timing constraints. Through a series of experiments, the proposed approach is shown to be effective especially when timing constraints are not tight and/or there are comparably a large number of nodes with very low switching costs.

AB - This paper addresses parallel prefix adder synthesis which aims at minimizing the total switching activity under bitwise timing constraints. This problem is treated as synthesis of prefix graphs which represent global structures of parallel prefix adders at technology-independent level. An approach for timing-driven area minimization of prefix graphs has been already proposed which first finds the exact minimum solution on a specific subset of prefix graphs by dynamic programming, then restructures the result for further reduction by removing restrictions on the subset. In this paper, a switching cost of each node of a prefix graph is defined, and an approach to minimize the total switching cost is presented where our area minimization algorithm is extended to be able to calculate the switching cost using Ordered Binary-Decision Diagrams (OBDDs). Furthermore, a heuristic is integrated which estimates the effect of the restructuring phase in the dynamic programming phase, to improve the robustness of our algorithm under severe timing constraints. Through a series of experiments, the proposed approach is shown to be effective especially when timing constraints are not tight and/or there are comparably a large number of nodes with very low switching costs.

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

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

U2 - 10.2197/ipsjtsldm.2.212

DO - 10.2197/ipsjtsldm.2.212

M3 - Article

AN - SCOPUS:79954459222

VL - 2

SP - 212

EP - 221

JO - IPSJ Transactions on System LSI Design Methodology

JF - IPSJ Transactions on System LSI Design Methodology

SN - 1882-6687

ER -