Upper and lower bounds on switching energy in VLSI:
Abstract: "A technology independent framework is established for measuring the switching energy consumed by very large scale integrated (VLSI) circuits. Techniques are developed for analyzing functional energy consumption, and for designing energy-efficient VLSI circuits. A wire (or gate) in a...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1990
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
90,44 |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | Abstract: "A technology independent framework is established for measuring the switching energy consumed by very large scale integrated (VLSI) circuits. Techniques are developed for analyzing functional energy consumption, and for designing energy-efficient VLSI circuits. A wire (or gate) in a circuit uses switching energy when it changes state from 1 to 0 or vice versa. This paper develops the Uniswitch Model (USM) of energy consumption, which measures the differences between pairs of states of an embedded circuit. The following worst case lower bounds are obtained in USM. Monotone circuits require switching energy proportional to the circuit's area A class of n-input, boolean valued functions, including addition and multiplication, uses [omega](n log b2 s n) switching energy, when computed by a shallow depth circuit. A special case of the parity function is shown to require switching energy proportional to the area. This paper also derives upper bounds in USM. Novel circuits and layouts are obtained for n-bit OR and compare functions that have shallow depth and use only linear energy, in the worst case. A shallow depth n-bit addition circuit is laid out in a novel manner that uses linear energy, on the average. This is a log factor better than the worst case lower bound for addition. |
| Beschreibung: | 35 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008973932 | ||
| 003 | DE-604 | ||
| 005 | 20220221 | ||
| 007 | t | ||
| 008 | 940206s1990 |||| 00||| eng d | ||
| 035 | |a (OCoLC)23926746 | ||
| 035 | |a (DE-599)BVBBV008973932 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T |a DE-91G | ||
| 100 | 1 | |a Kissin, Gloria |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Upper and lower bounds on switching energy in VLSI |c Gloria Kissin |
| 264 | 1 | |a Amsterdam |c 1990 | |
| 300 | |a 35 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |v 90,44 | |
| 520 | 3 | |a Abstract: "A technology independent framework is established for measuring the switching energy consumed by very large scale integrated (VLSI) circuits. Techniques are developed for analyzing functional energy consumption, and for designing energy-efficient VLSI circuits. A wire (or gate) in a circuit uses switching energy when it changes state from 1 to 0 or vice versa. This paper develops the Uniswitch Model (USM) of energy consumption, which measures the differences between pairs of states of an embedded circuit. The following worst case lower bounds are obtained in USM. Monotone circuits require switching energy proportional to the circuit's area | |
| 520 | 3 | |a A class of n-input, boolean valued functions, including addition and multiplication, uses [omega](n log b2 s n) switching energy, when computed by a shallow depth circuit. A special case of the parity function is shown to require switching energy proportional to the area. This paper also derives upper bounds in USM. Novel circuits and layouts are obtained for n-bit OR and compare functions that have shallow depth and use only linear energy, in the worst case. A shallow depth n-bit addition circuit is laid out in a novel manner that uses linear energy, on the average. This is a log factor better than the worst case lower bound for addition. | |
| 650 | 4 | |a Integrated circuits |x Very large scale integration | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 90,44 |w (DE-604)BV008928356 |9 90,44 | |
| 856 | 4 | 1 | |u https://ir.cwi.nl/pub/5703 |x Verlag |z kostenfrei |3 Volltext |
| 912 | |a ebook | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005925582 | ||
Datensatz im Suchindex
| _version_ | 1804123311899148288 |
|---|---|
| any_adam_object | |
| author | Kissin, Gloria |
| author_facet | Kissin, Gloria |
| author_role | aut |
| author_sort | Kissin, Gloria |
| author_variant | g k gk |
| building | Verbundindex |
| bvnumber | BV008973932 |
| collection | ebook |
| ctrlnum | (OCoLC)23926746 (DE-599)BVBBV008973932 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02460nam a2200337 cb4500</leader><controlfield tag="001">BV008973932</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220221 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1990 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)23926746</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008973932</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kissin, Gloria</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Upper and lower bounds on switching energy in VLSI</subfield><subfield code="c">Gloria Kissin</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">35 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS</subfield><subfield code="v">90,44</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "A technology independent framework is established for measuring the switching energy consumed by very large scale integrated (VLSI) circuits. Techniques are developed for analyzing functional energy consumption, and for designing energy-efficient VLSI circuits. A wire (or gate) in a circuit uses switching energy when it changes state from 1 to 0 or vice versa. This paper develops the Uniswitch Model (USM) of energy consumption, which measures the differences between pairs of states of an embedded circuit. The following worst case lower bounds are obtained in USM. Monotone circuits require switching energy proportional to the circuit's area</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">A class of n-input, boolean valued functions, including addition and multiplication, uses [omega](n log b2 s n) switching energy, when computed by a shallow depth circuit. A special case of the parity function is shown to require switching energy proportional to the area. This paper also derives upper bounds in USM. Novel circuits and layouts are obtained for n-bit OR and compare functions that have shallow depth and use only linear energy, in the worst case. A shallow depth n-bit addition circuit is laid out in a novel manner that uses linear energy, on the average. This is a log factor better than the worst case lower bound for addition.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Integrated circuits</subfield><subfield code="x">Very large scale integration</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Report CS</subfield><subfield code="t">Centrum voor Wiskunde en Informatica <Amsterdam></subfield><subfield code="v">90,44</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">90,44</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://ir.cwi.nl/pub/5703</subfield><subfield code="x">Verlag</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ebook</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005925582</subfield></datafield></record></collection> |
| id | DE-604.BV008973932 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:27:46Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005925582 |
| oclc_num | 23926746 |
| open_access_boolean | 1 |
| owner | DE-29T DE-91G DE-BY-TUM |
| owner_facet | DE-29T DE-91G DE-BY-TUM |
| physical | 35 S. |
| psigel | ebook |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Kissin, Gloria Verfasser aut Upper and lower bounds on switching energy in VLSI Gloria Kissin Amsterdam 1990 35 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 90,44 Abstract: "A technology independent framework is established for measuring the switching energy consumed by very large scale integrated (VLSI) circuits. Techniques are developed for analyzing functional energy consumption, and for designing energy-efficient VLSI circuits. A wire (or gate) in a circuit uses switching energy when it changes state from 1 to 0 or vice versa. This paper develops the Uniswitch Model (USM) of energy consumption, which measures the differences between pairs of states of an embedded circuit. The following worst case lower bounds are obtained in USM. Monotone circuits require switching energy proportional to the circuit's area A class of n-input, boolean valued functions, including addition and multiplication, uses [omega](n log b2 s n) switching energy, when computed by a shallow depth circuit. A special case of the parity function is shown to require switching energy proportional to the area. This paper also derives upper bounds in USM. Novel circuits and layouts are obtained for n-bit OR and compare functions that have shallow depth and use only linear energy, in the worst case. A shallow depth n-bit addition circuit is laid out in a novel manner that uses linear energy, on the average. This is a log factor better than the worst case lower bound for addition. Integrated circuits Very large scale integration Erscheint auch als Online-Ausgabe Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 90,44 (DE-604)BV008928356 90,44 https://ir.cwi.nl/pub/5703 Verlag kostenfrei Volltext |
| spellingShingle | Kissin, Gloria Upper and lower bounds on switching energy in VLSI Integrated circuits Very large scale integration |
| title | Upper and lower bounds on switching energy in VLSI |
| title_auth | Upper and lower bounds on switching energy in VLSI |
| title_exact_search | Upper and lower bounds on switching energy in VLSI |
| title_full | Upper and lower bounds on switching energy in VLSI Gloria Kissin |
| title_fullStr | Upper and lower bounds on switching energy in VLSI Gloria Kissin |
| title_full_unstemmed | Upper and lower bounds on switching energy in VLSI Gloria Kissin |
| title_short | Upper and lower bounds on switching energy in VLSI |
| title_sort | upper and lower bounds on switching energy in vlsi |
| topic | Integrated circuits Very large scale integration |
| topic_facet | Integrated circuits Very large scale integration |
| url | https://ir.cwi.nl/pub/5703 |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT kissingloria upperandlowerboundsonswitchingenergyinvlsi |