Low Power Binding for Switching Activity Reduction Based on Table Decomposition Method

Low power design in earlier stage of design process is more effective to reduce dynamic power. In this paper, we focus on the problem of reducing switching activity in high-level synthesis, especially, in binding functional module, bus, register, etc. We propose low power binding algorithm for switc...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Jihyung Kim, Byeongwhee Yoon, Sungho Park, Jundong Cho
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 185
container_issue
container_start_page 181
container_title
container_volume 1
creator Jihyung Kim
Byeongwhee Yoon
Sungho Park
Jundong Cho
description Low power design in earlier stage of design process is more effective to reduce dynamic power. In this paper, we focus on the problem of reducing switching activity in high-level synthesis, especially, in binding functional module, bus, register, etc. We propose low power binding algorithm for switching activity reduction based on table decomposition method. The proposed algorithm finds optimal or close-to-optimal binding with fast calculation time by using the property of optimal substructure. Experimental result shows that the proposed method finds a solution 1.7-14.4% more accurately in comparison to conventional heuristic methods, and gets a solution 8.0-479.2 times faster than optimal method does.
doi_str_mv 10.1109/ICCEA.2010.43
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5445841</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5445841</ieee_id><sourcerecordid>5445841</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-a73c1174d09a093632ae6d83606c666dfc6fa0ee75b4057399b86b2895447fae3</originalsourceid><addsrcrecordid>eNo9jE1PAjEURWsMiYosXbnpHwBf29d2uoQRlQSjUXRLOtM3UgOUzIwS_r3jR7ybe09Ochm7EDASAtzVLM-n45GEjlEdsTOBEtFABtnxP1iHPXYmAZxDaZ07YYOmeYcuqCVoPGWv87Tnj2lPNZ_EbYjbN16lmj_vY1uuvmlctvEztgf-ROGj22nLJ76hwLux8MWa-DWVabNLTfyR99SuUjhnvcqvGxr8dZ-93EwX-d1w_nA7y8fzYRRWt0NvVSmExQDOg1NGSU8mZMqAKY0xoSpN5YHI6gJBW-VckZlCZk4j2sqT6rPL399IRMtdHTe-Piw7qzMU6gvViFIa</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Low Power Binding for Switching Activity Reduction Based on Table Decomposition Method</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Jihyung Kim ; Byeongwhee Yoon ; Sungho Park ; Jundong Cho</creator><creatorcontrib>Jihyung Kim ; Byeongwhee Yoon ; Sungho Park ; Jundong Cho</creatorcontrib><description>Low power design in earlier stage of design process is more effective to reduce dynamic power. In this paper, we focus on the problem of reducing switching activity in high-level synthesis, especially, in binding functional module, bus, register, etc. We propose low power binding algorithm for switching activity reduction based on table decomposition method. The proposed algorithm finds optimal or close-to-optimal binding with fast calculation time by using the property of optimal substructure. Experimental result shows that the proposed method finds a solution 1.7-14.4% more accurately in comparison to conventional heuristic methods, and gets a solution 8.0-479.2 times faster than optimal method does.</description><identifier>ISBN: 1424460794</identifier><identifier>ISBN: 9781424460793</identifier><identifier>EISBN: 1424460808</identifier><identifier>EISBN: 9781424460809</identifier><identifier>DOI: 10.1109/ICCEA.2010.43</identifier><identifier>LCCN: 2009942799</identifier><language>eng</language><publisher>IEEE</publisher><subject>Application software ; binding ; Circuits ; Communication switching ; Computer applications ; Design engineering ; High level synthesis ; Large scale integration ; low power ; optimal substructure ; Power engineering and energy ; Power engineering computing ; switching activity ; table decomposition ; Voltage</subject><ispartof>2010 Second International Conference on Computer Engineering and Applications, 2010, Vol.1, p.181-185</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5445841$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,778,782,787,788,2054,27908,54903</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5445841$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Jihyung Kim</creatorcontrib><creatorcontrib>Byeongwhee Yoon</creatorcontrib><creatorcontrib>Sungho Park</creatorcontrib><creatorcontrib>Jundong Cho</creatorcontrib><title>Low Power Binding for Switching Activity Reduction Based on Table Decomposition Method</title><title>2010 Second International Conference on Computer Engineering and Applications</title><addtitle>ICCEA</addtitle><description>Low power design in earlier stage of design process is more effective to reduce dynamic power. In this paper, we focus on the problem of reducing switching activity in high-level synthesis, especially, in binding functional module, bus, register, etc. We propose low power binding algorithm for switching activity reduction based on table decomposition method. The proposed algorithm finds optimal or close-to-optimal binding with fast calculation time by using the property of optimal substructure. Experimental result shows that the proposed method finds a solution 1.7-14.4% more accurately in comparison to conventional heuristic methods, and gets a solution 8.0-479.2 times faster than optimal method does.</description><subject>Application software</subject><subject>binding</subject><subject>Circuits</subject><subject>Communication switching</subject><subject>Computer applications</subject><subject>Design engineering</subject><subject>High level synthesis</subject><subject>Large scale integration</subject><subject>low power</subject><subject>optimal substructure</subject><subject>Power engineering and energy</subject><subject>Power engineering computing</subject><subject>switching activity</subject><subject>table decomposition</subject><subject>Voltage</subject><isbn>1424460794</isbn><isbn>9781424460793</isbn><isbn>1424460808</isbn><isbn>9781424460809</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2010</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo9jE1PAjEURWsMiYosXbnpHwBf29d2uoQRlQSjUXRLOtM3UgOUzIwS_r3jR7ybe09Ochm7EDASAtzVLM-n45GEjlEdsTOBEtFABtnxP1iHPXYmAZxDaZ07YYOmeYcuqCVoPGWv87Tnj2lPNZ_EbYjbN16lmj_vY1uuvmlctvEztgf-ROGj22nLJ76hwLux8MWa-DWVabNLTfyR99SuUjhnvcqvGxr8dZ-93EwX-d1w_nA7y8fzYRRWt0NvVSmExQDOg1NGSU8mZMqAKY0xoSpN5YHI6gJBW-VckZlCZk4j2sqT6rPL399IRMtdHTe-Piw7qzMU6gvViFIa</recordid><startdate>201003</startdate><enddate>201003</enddate><creator>Jihyung Kim</creator><creator>Byeongwhee Yoon</creator><creator>Sungho Park</creator><creator>Jundong Cho</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201003</creationdate><title>Low Power Binding for Switching Activity Reduction Based on Table Decomposition Method</title><author>Jihyung Kim ; Byeongwhee Yoon ; Sungho Park ; Jundong Cho</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-a73c1174d09a093632ae6d83606c666dfc6fa0ee75b4057399b86b2895447fae3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Application software</topic><topic>binding</topic><topic>Circuits</topic><topic>Communication switching</topic><topic>Computer applications</topic><topic>Design engineering</topic><topic>High level synthesis</topic><topic>Large scale integration</topic><topic>low power</topic><topic>optimal substructure</topic><topic>Power engineering and energy</topic><topic>Power engineering computing</topic><topic>switching activity</topic><topic>table decomposition</topic><topic>Voltage</topic><toplevel>online_resources</toplevel><creatorcontrib>Jihyung Kim</creatorcontrib><creatorcontrib>Byeongwhee Yoon</creatorcontrib><creatorcontrib>Sungho Park</creatorcontrib><creatorcontrib>Jundong Cho</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Jihyung Kim</au><au>Byeongwhee Yoon</au><au>Sungho Park</au><au>Jundong Cho</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Low Power Binding for Switching Activity Reduction Based on Table Decomposition Method</atitle><btitle>2010 Second International Conference on Computer Engineering and Applications</btitle><stitle>ICCEA</stitle><date>2010-03</date><risdate>2010</risdate><volume>1</volume><spage>181</spage><epage>185</epage><pages>181-185</pages><isbn>1424460794</isbn><isbn>9781424460793</isbn><eisbn>1424460808</eisbn><eisbn>9781424460809</eisbn><abstract>Low power design in earlier stage of design process is more effective to reduce dynamic power. In this paper, we focus on the problem of reducing switching activity in high-level synthesis, especially, in binding functional module, bus, register, etc. We propose low power binding algorithm for switching activity reduction based on table decomposition method. The proposed algorithm finds optimal or close-to-optimal binding with fast calculation time by using the property of optimal substructure. Experimental result shows that the proposed method finds a solution 1.7-14.4% more accurately in comparison to conventional heuristic methods, and gets a solution 8.0-479.2 times faster than optimal method does.</abstract><pub>IEEE</pub><doi>10.1109/ICCEA.2010.43</doi><tpages>5</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 1424460794
ispartof 2010 Second International Conference on Computer Engineering and Applications, 2010, Vol.1, p.181-185
issn
language eng
recordid cdi_ieee_primary_5445841
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Application software
binding
Circuits
Communication switching
Computer applications
Design engineering
High level synthesis
Large scale integration
low power
optimal substructure
Power engineering and energy
Power engineering computing
switching activity
table decomposition
Voltage
title Low Power Binding for Switching Activity Reduction Based on Table Decomposition Method
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-16T19%3A14%3A29IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Low%20Power%20Binding%20for%20Switching%20Activity%20Reduction%20Based%20on%20Table%20Decomposition%20Method&rft.btitle=2010%20Second%20International%20Conference%20on%20Computer%20Engineering%20and%20Applications&rft.au=Jihyung%20Kim&rft.date=2010-03&rft.volume=1&rft.spage=181&rft.epage=185&rft.pages=181-185&rft.isbn=1424460794&rft.isbn_list=9781424460793&rft_id=info:doi/10.1109/ICCEA.2010.43&rft_dat=%3Cieee_6IE%3E5445841%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=1424460808&rft.eisbn_list=9781424460809&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5445841&rfr_iscdi=true