Power-efficient and slew-aware three dimensional gated clock tree synthesis

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

4 Citations (Scopus)

Abstract

This paper presents a three dimensional (3D) gated clock tree synthesis (CTS) approach, which consists of two steps: 1) abstract tree topology generation; and 2) 3D gated and buffered clock routing. 3D Pair Matching (3D-PM) algorithm is proposed to generate the initial tree topology and then the proposed TSV-minimization algorithm is applied to generate TSV-aware tree topology. Based on TSV-aware tree topology, 3D gated and buffered clock tree routing is done using the proposed 3D Gated and Buffered Deferred-Merge Embedding (3D-GB-DME) algorithm. The slew constraint satisfaction is considered and the clock skew is minimized in our approach. Experimental results show that the proposed method achieves 29.11% power reduction compared with the state-of-the-art 2D work.

Original languageEnglish
Title of host publication2016 IFIP/IEEE International Conference on Very Large Scale Integration, VLSI-SoC 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781509035618
DOIs
Publication statusPublished - 2016 Nov 22
Event24th Annual IFIP/IEEE International Conference on Very Large Scale Integration, VLSI-SoC 2016 - Tallinn, Estonia
Duration: 2016 Sep 262016 Sep 28

Other

Other24th Annual IFIP/IEEE International Conference on Very Large Scale Integration, VLSI-SoC 2016
CountryEstonia
CityTallinn
Period16/9/2616/9/28

Fingerprint

Trees (mathematics)
Clocks
Topology

Keywords

  • clock gating
  • clock tree synthesis (CTS)
  • low power
  • three dimensional integrated circuits (3D ICs)

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

Lin, M., Sun, H., & Kimura, S. (2016). Power-efficient and slew-aware three dimensional gated clock tree synthesis. In 2016 IFIP/IEEE International Conference on Very Large Scale Integration, VLSI-SoC 2016 [7753535] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/VLSI-SoC.2016.7753535

Power-efficient and slew-aware three dimensional gated clock tree synthesis. / Lin, Minghao; Sun, Heming; Kimura, Shinji.

2016 IFIP/IEEE International Conference on Very Large Scale Integration, VLSI-SoC 2016. Institute of Electrical and Electronics Engineers Inc., 2016. 7753535.

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

Lin, M, Sun, H & Kimura, S 2016, Power-efficient and slew-aware three dimensional gated clock tree synthesis. in 2016 IFIP/IEEE International Conference on Very Large Scale Integration, VLSI-SoC 2016., 7753535, Institute of Electrical and Electronics Engineers Inc., 24th Annual IFIP/IEEE International Conference on Very Large Scale Integration, VLSI-SoC 2016, Tallinn, Estonia, 16/9/26. https://doi.org/10.1109/VLSI-SoC.2016.7753535
Lin M, Sun H, Kimura S. Power-efficient and slew-aware three dimensional gated clock tree synthesis. In 2016 IFIP/IEEE International Conference on Very Large Scale Integration, VLSI-SoC 2016. Institute of Electrical and Electronics Engineers Inc. 2016. 7753535 https://doi.org/10.1109/VLSI-SoC.2016.7753535
Lin, Minghao ; Sun, Heming ; Kimura, Shinji. / Power-efficient and slew-aware three dimensional gated clock tree synthesis. 2016 IFIP/IEEE International Conference on Very Large Scale Integration, VLSI-SoC 2016. Institute of Electrical and Electronics Engineers Inc., 2016.
@inproceedings{6cd4c3bc4d1c472bbf49f1b19ec32576,
title = "Power-efficient and slew-aware three dimensional gated clock tree synthesis",
abstract = "This paper presents a three dimensional (3D) gated clock tree synthesis (CTS) approach, which consists of two steps: 1) abstract tree topology generation; and 2) 3D gated and buffered clock routing. 3D Pair Matching (3D-PM) algorithm is proposed to generate the initial tree topology and then the proposed TSV-minimization algorithm is applied to generate TSV-aware tree topology. Based on TSV-aware tree topology, 3D gated and buffered clock tree routing is done using the proposed 3D Gated and Buffered Deferred-Merge Embedding (3D-GB-DME) algorithm. The slew constraint satisfaction is considered and the clock skew is minimized in our approach. Experimental results show that the proposed method achieves 29.11{\%} power reduction compared with the state-of-the-art 2D work.",
keywords = "clock gating, clock tree synthesis (CTS), low power, three dimensional integrated circuits (3D ICs)",
author = "Minghao Lin and Heming Sun and Shinji Kimura",
year = "2016",
month = "11",
day = "22",
doi = "10.1109/VLSI-SoC.2016.7753535",
language = "English",
booktitle = "2016 IFIP/IEEE International Conference on Very Large Scale Integration, VLSI-SoC 2016",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

TY - GEN

T1 - Power-efficient and slew-aware three dimensional gated clock tree synthesis

AU - Lin, Minghao

AU - Sun, Heming

AU - Kimura, Shinji

PY - 2016/11/22

Y1 - 2016/11/22

N2 - This paper presents a three dimensional (3D) gated clock tree synthesis (CTS) approach, which consists of two steps: 1) abstract tree topology generation; and 2) 3D gated and buffered clock routing. 3D Pair Matching (3D-PM) algorithm is proposed to generate the initial tree topology and then the proposed TSV-minimization algorithm is applied to generate TSV-aware tree topology. Based on TSV-aware tree topology, 3D gated and buffered clock tree routing is done using the proposed 3D Gated and Buffered Deferred-Merge Embedding (3D-GB-DME) algorithm. The slew constraint satisfaction is considered and the clock skew is minimized in our approach. Experimental results show that the proposed method achieves 29.11% power reduction compared with the state-of-the-art 2D work.

AB - This paper presents a three dimensional (3D) gated clock tree synthesis (CTS) approach, which consists of two steps: 1) abstract tree topology generation; and 2) 3D gated and buffered clock routing. 3D Pair Matching (3D-PM) algorithm is proposed to generate the initial tree topology and then the proposed TSV-minimization algorithm is applied to generate TSV-aware tree topology. Based on TSV-aware tree topology, 3D gated and buffered clock tree routing is done using the proposed 3D Gated and Buffered Deferred-Merge Embedding (3D-GB-DME) algorithm. The slew constraint satisfaction is considered and the clock skew is minimized in our approach. Experimental results show that the proposed method achieves 29.11% power reduction compared with the state-of-the-art 2D work.

KW - clock gating

KW - clock tree synthesis (CTS)

KW - low power

KW - three dimensional integrated circuits (3D ICs)

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

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

U2 - 10.1109/VLSI-SoC.2016.7753535

DO - 10.1109/VLSI-SoC.2016.7753535

M3 - Conference contribution

BT - 2016 IFIP/IEEE International Conference on Very Large Scale Integration, VLSI-SoC 2016

PB - Institute of Electrical and Electronics Engineers Inc.

ER -