Variable Latency Speculative Han-Carlson Adder

Variable latency adders have been recently proposed in literature. A variable latency adder employs speculation: the exact arithmetic function is replaced with an approximated one that is faster and gives the correct result most of the time, but not always. The approximated adder is augmented with a...
Ausführliche Beschreibung

Gespeichert in:

Autor*in:	Esposito, Darjn [verfasserIn] De Caro, Davide Napoli, Ettore Petra, Nicola Strollo, Antonio Giuseppe Maria

Format:	Artikel
Sprache:	Englisch

Erschienen:	2015

Schlagwörter:	approximated adder size 65 nm error signal variable latency Kogge-Stone topology error probability reduction operand lengths Topology variable latency adders adders speculative variable latency adders average delay reduction variable latency speculative prefix adders approximated arithmetic function UMC library Complexity theory Addition Han-Carlson parallel-prefix topology error statistics Logic gates parallel-prefix adders error detection Computer architecture variable latency speculative Han-Carlson adder speculative adders digital arithmetic Delays speculative functional units error detection network exact arithmetic function Error correction nonspeculative adders Mathematical functions Error correction & detection Signal processing Network architecture Methods Distribution (Probability theory) Approximation theory Innovations Usage

Übergeordnetes Werk:	Enthalten in: IEEE transactions on circuits and systems / 1 - New York, NY : Institute of Electrical and Electronics Engineers, 1992, 62(2015), 5, Seite 1353-1361
Übergeordnetes Werk:	volume:62 ; year:2015 ; number:5 ; pages:1353-1361

Links:	Volltext Link aufrufen Link aufrufen

DOI / URN:	10.1109/TCSI.2015.2403036

Katalog-ID:	OLC1959251856

Internformat


LEADER	01000caa a2200265 4500
001	OLC1959251856
003	DE-627
005	20210715225527.0
007	tu
008	160206s2015 xx \|\|\|\|\| 00\| \|\|eng c
024	7		\|a 10.1109/TCSI.2015.2403036 \|2 doi
028	5	2	\|a PQ20160617
035			\|a (DE-627)OLC1959251856
035			\|a (DE-599)GBVOLC1959251856
035			\|a (PRQ)c2646-b78b41b2fafa5bceff3bf5ba0782c5cfe3fd08cfa2addf893a26b4150300b3d50
035			\|a (KEY)0213966920150000062000501353variablelatencyspeculativehancarlsonadder
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
041			\|a eng
082	0	4	\|a 000 \|a 620 \|q DNB
100	1		\|a Esposito, Darjn \|e verfasserin \|4 aut
245	1	0	\|a Variable Latency Speculative Han-Carlson Adder
264		1	\|c 2015
336			\|a Text \|b txt \|2 rdacontent
337			\|a ohne Hilfsmittel zu benutzen \|b n \|2 rdamedia
338			\|a Band \|b nc \|2 rdacarrier
520			\|a Variable latency adders have been recently proposed in literature. A variable latency adder employs speculation: the exact arithmetic function is replaced with an approximated one that is faster and gives the correct result most of the time, but not always. The approximated adder is augmented with an error detection network that asserts an error signal when speculation fails. Speculative variable latency adders have attracted strong interest thanks to their capability to reduce average delay compared to traditional architectures. This paper proposes a novel variable latency speculative adder based on Han-Carlson parallel-prefix topology that resulted more effective than variable latency Kogge-Stone topology. The paper describes the stages in which variable latency speculative prefix adders can be subdivided and presents a novel error detection network that reduces error probability compared to previous approaches. Several variable latency speculative adders, for various operand lengths, using both Han-Carlson and Kogge-Stone topology, have been synthesized using the UMC 65 nm library. Obtained results show that proposed variable latency Han-Carlson adder outperforms both previously proposed speculative Kogge-Stone architectures and non-speculative adders, when high-speed is required. It is also shown that non-speculative adders remain the best choice when the speed constraint is relaxed.
650		4	\|a approximated adder
650		4	\|a size 65 nm
650		4	\|a error signal
650		4	\|a variable latency Kogge-Stone topology
650		4	\|a error probability reduction
650		4	\|a operand lengths
650		4	\|a Topology
650		4	\|a variable latency adders
650		4	\|a adders
650		4	\|a speculative variable latency adders
650		4	\|a average delay reduction
650		4	\|a variable latency speculative prefix adders
650		4	\|a approximated arithmetic function
650		4	\|a UMC library
650		4	\|a Complexity theory
650		4	\|a Addition
650		4	\|a Han-Carlson parallel-prefix topology
650		4	\|a error statistics
650		4	\|a Logic gates
650		4	\|a parallel-prefix adders
650		4	\|a error detection
650		4	\|a Computer architecture
650		4	\|a variable latency speculative Han-Carlson adder
650		4	\|a speculative adders
650		4	\|a digital arithmetic
650		4	\|a Delays
650		4	\|a speculative functional units
650		4	\|a error detection network
650		4	\|a exact arithmetic function
650		4	\|a Error correction
650		4	\|a nonspeculative adders
650		4	\|a Mathematical functions
650		4	\|a Error correction & detection
650		4	\|a Signal processing
650		4	\|a Network architecture
650		4	\|a Methods
650		4	\|a Distribution (Probability theory)
650		4	\|a Approximation theory
650		4	\|a Innovations
650		4	\|a Usage
700	1		\|a De Caro, Davide \|4 oth
700	1		\|a Napoli, Ettore \|4 oth
700	1		\|a Petra, Nicola \|4 oth
700	1		\|a Strollo, Antonio Giuseppe Maria \|4 oth
773	0	8	\|i Enthalten in \|t IEEE transactions on circuits and systems / 1 \|d New York, NY : Institute of Electrical and Electronics Engineers, 1992 \|g 62(2015), 5, Seite 1353-1361 \|w (DE-627)131043080 \|w (DE-600)1100194-X \|w (DE-576)02804679X \|x 1549-8328 \|7 nnns
773	1	8	\|g volume:62 \|g year:2015 \|g number:5 \|g pages:1353-1361
856	4	1	\|u http://dx.doi.org/10.1109/TCSI.2015.2403036 \|3 Volltext
856	4	2	\|u http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=7080926
856	4	2	\|u http://search.proquest.com/docview/1685290863
912			\|a GBV_USEFLAG_A
912			\|a SYSFLAG_A
912			\|a GBV_OLC
912			\|a SSG-OLC-TEC
912			\|a SSG-OLC-MAT
912			\|a GBV_ILN_30
912			\|a GBV_ILN_70
912			\|a GBV_ILN_2002
912			\|a GBV_ILN_2005
912			\|a GBV_ILN_2059
951			\|a AR
952			\|d 62 \|j 2015 \|e 5 \|h 1353-1361

Indexfelder

author_variant	d e de
matchkey_str	article:15498328:2015----::aibeaecseuaieac
hierarchy_sort_str	2015
publishDate	2015
allfields	10.1109/TCSI.2015.2403036 doi PQ20160617 (DE-627)OLC1959251856 (DE-599)GBVOLC1959251856 (PRQ)c2646-b78b41b2fafa5bceff3bf5ba0782c5cfe3fd08cfa2addf893a26b4150300b3d50 (KEY)0213966920150000062000501353variablelatencyspeculativehancarlsonadder DE-627 ger DE-627 rakwb eng 000 620 DNB Esposito, Darjn verfasserin aut Variable Latency Speculative Han-Carlson Adder 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Variable latency adders have been recently proposed in literature. A variable latency adder employs speculation: the exact arithmetic function is replaced with an approximated one that is faster and gives the correct result most of the time, but not always. The approximated adder is augmented with an error detection network that asserts an error signal when speculation fails. Speculative variable latency adders have attracted strong interest thanks to their capability to reduce average delay compared to traditional architectures. This paper proposes a novel variable latency speculative adder based on Han-Carlson parallel-prefix topology that resulted more effective than variable latency Kogge-Stone topology. The paper describes the stages in which variable latency speculative prefix adders can be subdivided and presents a novel error detection network that reduces error probability compared to previous approaches. Several variable latency speculative adders, for various operand lengths, using both Han-Carlson and Kogge-Stone topology, have been synthesized using the UMC 65 nm library. Obtained results show that proposed variable latency Han-Carlson adder outperforms both previously proposed speculative Kogge-Stone architectures and non-speculative adders, when high-speed is required. It is also shown that non-speculative adders remain the best choice when the speed constraint is relaxed. approximated adder size 65 nm error signal variable latency Kogge-Stone topology error probability reduction operand lengths Topology variable latency adders adders speculative variable latency adders average delay reduction variable latency speculative prefix adders approximated arithmetic function UMC library Complexity theory Addition Han-Carlson parallel-prefix topology error statistics Logic gates parallel-prefix adders error detection Computer architecture variable latency speculative Han-Carlson adder speculative adders digital arithmetic Delays speculative functional units error detection network exact arithmetic function Error correction nonspeculative adders Mathematical functions Error correction & detection Signal processing Network architecture Methods Distribution (Probability theory) Approximation theory Innovations Usage De Caro, Davide oth Napoli, Ettore oth Petra, Nicola oth Strollo, Antonio Giuseppe Maria oth Enthalten in IEEE transactions on circuits and systems / 1 New York, NY : Institute of Electrical and Electronics Engineers, 1992 62(2015), 5, Seite 1353-1361 (DE-627)131043080 (DE-600)1100194-X (DE-576)02804679X 1549-8328 nnns volume:62 year:2015 number:5 pages:1353-1361 http://dx.doi.org/10.1109/TCSI.2015.2403036 Volltext http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=7080926 http://search.proquest.com/docview/1685290863 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_30 GBV_ILN_70 GBV_ILN_2002 GBV_ILN_2005 GBV_ILN_2059 AR 62 2015 5 1353-1361
spelling	10.1109/TCSI.2015.2403036 doi PQ20160617 (DE-627)OLC1959251856 (DE-599)GBVOLC1959251856 (PRQ)c2646-b78b41b2fafa5bceff3bf5ba0782c5cfe3fd08cfa2addf893a26b4150300b3d50 (KEY)0213966920150000062000501353variablelatencyspeculativehancarlsonadder DE-627 ger DE-627 rakwb eng 000 620 DNB Esposito, Darjn verfasserin aut Variable Latency Speculative Han-Carlson Adder 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Variable latency adders have been recently proposed in literature. A variable latency adder employs speculation: the exact arithmetic function is replaced with an approximated one that is faster and gives the correct result most of the time, but not always. The approximated adder is augmented with an error detection network that asserts an error signal when speculation fails. Speculative variable latency adders have attracted strong interest thanks to their capability to reduce average delay compared to traditional architectures. This paper proposes a novel variable latency speculative adder based on Han-Carlson parallel-prefix topology that resulted more effective than variable latency Kogge-Stone topology. The paper describes the stages in which variable latency speculative prefix adders can be subdivided and presents a novel error detection network that reduces error probability compared to previous approaches. Several variable latency speculative adders, for various operand lengths, using both Han-Carlson and Kogge-Stone topology, have been synthesized using the UMC 65 nm library. Obtained results show that proposed variable latency Han-Carlson adder outperforms both previously proposed speculative Kogge-Stone architectures and non-speculative adders, when high-speed is required. It is also shown that non-speculative adders remain the best choice when the speed constraint is relaxed. approximated adder size 65 nm error signal variable latency Kogge-Stone topology error probability reduction operand lengths Topology variable latency adders adders speculative variable latency adders average delay reduction variable latency speculative prefix adders approximated arithmetic function UMC library Complexity theory Addition Han-Carlson parallel-prefix topology error statistics Logic gates parallel-prefix adders error detection Computer architecture variable latency speculative Han-Carlson adder speculative adders digital arithmetic Delays speculative functional units error detection network exact arithmetic function Error correction nonspeculative adders Mathematical functions Error correction & detection Signal processing Network architecture Methods Distribution (Probability theory) Approximation theory Innovations Usage De Caro, Davide oth Napoli, Ettore oth Petra, Nicola oth Strollo, Antonio Giuseppe Maria oth Enthalten in IEEE transactions on circuits and systems / 1 New York, NY : Institute of Electrical and Electronics Engineers, 1992 62(2015), 5, Seite 1353-1361 (DE-627)131043080 (DE-600)1100194-X (DE-576)02804679X 1549-8328 nnns volume:62 year:2015 number:5 pages:1353-1361 http://dx.doi.org/10.1109/TCSI.2015.2403036 Volltext http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=7080926 http://search.proquest.com/docview/1685290863 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_30 GBV_ILN_70 GBV_ILN_2002 GBV_ILN_2005 GBV_ILN_2059 AR 62 2015 5 1353-1361
allfields_unstemmed	10.1109/TCSI.2015.2403036 doi PQ20160617 (DE-627)OLC1959251856 (DE-599)GBVOLC1959251856 (PRQ)c2646-b78b41b2fafa5bceff3bf5ba0782c5cfe3fd08cfa2addf893a26b4150300b3d50 (KEY)0213966920150000062000501353variablelatencyspeculativehancarlsonadder DE-627 ger DE-627 rakwb eng 000 620 DNB Esposito, Darjn verfasserin aut Variable Latency Speculative Han-Carlson Adder 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Variable latency adders have been recently proposed in literature. A variable latency adder employs speculation: the exact arithmetic function is replaced with an approximated one that is faster and gives the correct result most of the time, but not always. The approximated adder is augmented with an error detection network that asserts an error signal when speculation fails. Speculative variable latency adders have attracted strong interest thanks to their capability to reduce average delay compared to traditional architectures. This paper proposes a novel variable latency speculative adder based on Han-Carlson parallel-prefix topology that resulted more effective than variable latency Kogge-Stone topology. The paper describes the stages in which variable latency speculative prefix adders can be subdivided and presents a novel error detection network that reduces error probability compared to previous approaches. Several variable latency speculative adders, for various operand lengths, using both Han-Carlson and Kogge-Stone topology, have been synthesized using the UMC 65 nm library. Obtained results show that proposed variable latency Han-Carlson adder outperforms both previously proposed speculative Kogge-Stone architectures and non-speculative adders, when high-speed is required. It is also shown that non-speculative adders remain the best choice when the speed constraint is relaxed. approximated adder size 65 nm error signal variable latency Kogge-Stone topology error probability reduction operand lengths Topology variable latency adders adders speculative variable latency adders average delay reduction variable latency speculative prefix adders approximated arithmetic function UMC library Complexity theory Addition Han-Carlson parallel-prefix topology error statistics Logic gates parallel-prefix adders error detection Computer architecture variable latency speculative Han-Carlson adder speculative adders digital arithmetic Delays speculative functional units error detection network exact arithmetic function Error correction nonspeculative adders Mathematical functions Error correction & detection Signal processing Network architecture Methods Distribution (Probability theory) Approximation theory Innovations Usage De Caro, Davide oth Napoli, Ettore oth Petra, Nicola oth Strollo, Antonio Giuseppe Maria oth Enthalten in IEEE transactions on circuits and systems / 1 New York, NY : Institute of Electrical and Electronics Engineers, 1992 62(2015), 5, Seite 1353-1361 (DE-627)131043080 (DE-600)1100194-X (DE-576)02804679X 1549-8328 nnns volume:62 year:2015 number:5 pages:1353-1361 http://dx.doi.org/10.1109/TCSI.2015.2403036 Volltext http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=7080926 http://search.proquest.com/docview/1685290863 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_30 GBV_ILN_70 GBV_ILN_2002 GBV_ILN_2005 GBV_ILN_2059 AR 62 2015 5 1353-1361
allfieldsGer	10.1109/TCSI.2015.2403036 doi PQ20160617 (DE-627)OLC1959251856 (DE-599)GBVOLC1959251856 (PRQ)c2646-b78b41b2fafa5bceff3bf5ba0782c5cfe3fd08cfa2addf893a26b4150300b3d50 (KEY)0213966920150000062000501353variablelatencyspeculativehancarlsonadder DE-627 ger DE-627 rakwb eng 000 620 DNB Esposito, Darjn verfasserin aut Variable Latency Speculative Han-Carlson Adder 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Variable latency adders have been recently proposed in literature. A variable latency adder employs speculation: the exact arithmetic function is replaced with an approximated one that is faster and gives the correct result most of the time, but not always. The approximated adder is augmented with an error detection network that asserts an error signal when speculation fails. Speculative variable latency adders have attracted strong interest thanks to their capability to reduce average delay compared to traditional architectures. This paper proposes a novel variable latency speculative adder based on Han-Carlson parallel-prefix topology that resulted more effective than variable latency Kogge-Stone topology. The paper describes the stages in which variable latency speculative prefix adders can be subdivided and presents a novel error detection network that reduces error probability compared to previous approaches. Several variable latency speculative adders, for various operand lengths, using both Han-Carlson and Kogge-Stone topology, have been synthesized using the UMC 65 nm library. Obtained results show that proposed variable latency Han-Carlson adder outperforms both previously proposed speculative Kogge-Stone architectures and non-speculative adders, when high-speed is required. It is also shown that non-speculative adders remain the best choice when the speed constraint is relaxed. approximated adder size 65 nm error signal variable latency Kogge-Stone topology error probability reduction operand lengths Topology variable latency adders adders speculative variable latency adders average delay reduction variable latency speculative prefix adders approximated arithmetic function UMC library Complexity theory Addition Han-Carlson parallel-prefix topology error statistics Logic gates parallel-prefix adders error detection Computer architecture variable latency speculative Han-Carlson adder speculative adders digital arithmetic Delays speculative functional units error detection network exact arithmetic function Error correction nonspeculative adders Mathematical functions Error correction & detection Signal processing Network architecture Methods Distribution (Probability theory) Approximation theory Innovations Usage De Caro, Davide oth Napoli, Ettore oth Petra, Nicola oth Strollo, Antonio Giuseppe Maria oth Enthalten in IEEE transactions on circuits and systems / 1 New York, NY : Institute of Electrical and Electronics Engineers, 1992 62(2015), 5, Seite 1353-1361 (DE-627)131043080 (DE-600)1100194-X (DE-576)02804679X 1549-8328 nnns volume:62 year:2015 number:5 pages:1353-1361 http://dx.doi.org/10.1109/TCSI.2015.2403036 Volltext http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=7080926 http://search.proquest.com/docview/1685290863 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_30 GBV_ILN_70 GBV_ILN_2002 GBV_ILN_2005 GBV_ILN_2059 AR 62 2015 5 1353-1361
allfieldsSound	10.1109/TCSI.2015.2403036 doi PQ20160617 (DE-627)OLC1959251856 (DE-599)GBVOLC1959251856 (PRQ)c2646-b78b41b2fafa5bceff3bf5ba0782c5cfe3fd08cfa2addf893a26b4150300b3d50 (KEY)0213966920150000062000501353variablelatencyspeculativehancarlsonadder DE-627 ger DE-627 rakwb eng 000 620 DNB Esposito, Darjn verfasserin aut Variable Latency Speculative Han-Carlson Adder 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Variable latency adders have been recently proposed in literature. A variable latency adder employs speculation: the exact arithmetic function is replaced with an approximated one that is faster and gives the correct result most of the time, but not always. The approximated adder is augmented with an error detection network that asserts an error signal when speculation fails. Speculative variable latency adders have attracted strong interest thanks to their capability to reduce average delay compared to traditional architectures. This paper proposes a novel variable latency speculative adder based on Han-Carlson parallel-prefix topology that resulted more effective than variable latency Kogge-Stone topology. The paper describes the stages in which variable latency speculative prefix adders can be subdivided and presents a novel error detection network that reduces error probability compared to previous approaches. Several variable latency speculative adders, for various operand lengths, using both Han-Carlson and Kogge-Stone topology, have been synthesized using the UMC 65 nm library. Obtained results show that proposed variable latency Han-Carlson adder outperforms both previously proposed speculative Kogge-Stone architectures and non-speculative adders, when high-speed is required. It is also shown that non-speculative adders remain the best choice when the speed constraint is relaxed. approximated adder size 65 nm error signal variable latency Kogge-Stone topology error probability reduction operand lengths Topology variable latency adders adders speculative variable latency adders average delay reduction variable latency speculative prefix adders approximated arithmetic function UMC library Complexity theory Addition Han-Carlson parallel-prefix topology error statistics Logic gates parallel-prefix adders error detection Computer architecture variable latency speculative Han-Carlson adder speculative adders digital arithmetic Delays speculative functional units error detection network exact arithmetic function Error correction nonspeculative adders Mathematical functions Error correction & detection Signal processing Network architecture Methods Distribution (Probability theory) Approximation theory Innovations Usage De Caro, Davide oth Napoli, Ettore oth Petra, Nicola oth Strollo, Antonio Giuseppe Maria oth Enthalten in IEEE transactions on circuits and systems / 1 New York, NY : Institute of Electrical and Electronics Engineers, 1992 62(2015), 5, Seite 1353-1361 (DE-627)131043080 (DE-600)1100194-X (DE-576)02804679X 1549-8328 nnns volume:62 year:2015 number:5 pages:1353-1361 http://dx.doi.org/10.1109/TCSI.2015.2403036 Volltext http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=7080926 http://search.proquest.com/docview/1685290863 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_30 GBV_ILN_70 GBV_ILN_2002 GBV_ILN_2005 GBV_ILN_2059 AR 62 2015 5 1353-1361
language	English
source	Enthalten in IEEE transactions on circuits and systems / 1 62(2015), 5, Seite 1353-1361 volume:62 year:2015 number:5 pages:1353-1361
sourceStr	Enthalten in IEEE transactions on circuits and systems / 1 62(2015), 5, Seite 1353-1361 volume:62 year:2015 number:5 pages:1353-1361
format_phy_str_mv	Article
institution	findex.gbv.de
topic_facet	approximated adder size 65 nm error signal variable latency Kogge-Stone topology error probability reduction operand lengths Topology variable latency adders adders speculative variable latency adders average delay reduction variable latency speculative prefix adders approximated arithmetic function UMC library Complexity theory Addition Han-Carlson parallel-prefix topology error statistics Logic gates parallel-prefix adders error detection Computer architecture variable latency speculative Han-Carlson adder speculative adders digital arithmetic Delays speculative functional units error detection network exact arithmetic function Error correction nonspeculative adders Mathematical functions Error correction & detection Signal processing Network architecture Methods Distribution (Probability theory) Approximation theory Innovations Usage
dewey-raw	000
isfreeaccess_bool	false
container_title	IEEE transactions on circuits and systems / 1
authorswithroles_txt_mv	Esposito, Darjn @@aut@@ De Caro, Davide @@oth@@ Napoli, Ettore @@oth@@ Petra, Nicola @@oth@@ Strollo, Antonio Giuseppe Maria @@oth@@
publishDateDaySort_date	2015-01-01T00:00:00Z
hierarchy_top_id	131043080
dewey-sort	0
id	OLC1959251856
language_de	englisch
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">OLC1959251856</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20210715225527.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">160206s2015 xx \|\|\|\|\| 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1109/TCSI.2015.2403036</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20160617</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1959251856</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1959251856</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)c2646-b78b41b2fafa5bceff3bf5ba0782c5cfe3fd08cfa2addf893a26b4150300b3d50</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0213966920150000062000501353variablelatencyspeculativehancarlsonadder</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">000</subfield><subfield code="a">620</subfield><subfield code="q">DNB</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Esposito, Darjn</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Variable Latency Speculative Han-Carlson Adder</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2015</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Variable latency adders have been recently proposed in literature. A variable latency adder employs speculation: the exact arithmetic function is replaced with an approximated one that is faster and gives the correct result most of the time, but not always. The approximated adder is augmented with an error detection network that asserts an error signal when speculation fails. Speculative variable latency adders have attracted strong interest thanks to their capability to reduce average delay compared to traditional architectures. This paper proposes a novel variable latency speculative adder based on Han-Carlson parallel-prefix topology that resulted more effective than variable latency Kogge-Stone topology. The paper describes the stages in which variable latency speculative prefix adders can be subdivided and presents a novel error detection network that reduces error probability compared to previous approaches. Several variable latency speculative adders, for various operand lengths, using both Han-Carlson and Kogge-Stone topology, have been synthesized using the UMC 65 nm library. Obtained results show that proposed variable latency Han-Carlson adder outperforms both previously proposed speculative Kogge-Stone architectures and non-speculative adders, when high-speed is required. It is also shown that non-speculative adders remain the best choice when the speed constraint is relaxed.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">approximated adder</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">size 65 nm</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">error signal</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">variable latency Kogge-Stone topology</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">error probability reduction</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">operand lengths</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Topology</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">variable latency adders</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">adders</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">speculative variable latency adders</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">average delay reduction</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">variable latency speculative prefix adders</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">approximated arithmetic function</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">UMC library</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complexity theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Addition</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Han-Carlson parallel-prefix topology</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">error statistics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic gates</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">parallel-prefix adders</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">error detection</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer architecture</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">variable latency speculative Han-Carlson adder</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">speculative adders</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">digital arithmetic</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Delays</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">speculative functional units</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">error detection network</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">exact arithmetic function</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Error correction</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">nonspeculative adders</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical functions</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Error correction & detection</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Signal processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Network architecture</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Methods</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Distribution (Probability theory)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Approximation theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Innovations</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Usage</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">De Caro, Davide</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Napoli, Ettore</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Petra, Nicola</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Strollo, Antonio Giuseppe Maria</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">IEEE transactions on circuits and systems / 1</subfield><subfield code="d">New York, NY : Institute of Electrical and Electronics Engineers, 1992</subfield><subfield code="g">62(2015), 5, Seite 1353-1361</subfield><subfield code="w">(DE-627)131043080</subfield><subfield code="w">(DE-600)1100194-X</subfield><subfield code="w">(DE-576)02804679X</subfield><subfield code="x">1549-8328</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:62</subfield><subfield code="g">year:2015</subfield><subfield code="g">number:5</subfield><subfield code="g">pages:1353-1361</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://dx.doi.org/10.1109/TCSI.2015.2403036</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=7080926</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://search.proquest.com/docview/1685290863</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_30</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2002</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2059</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">62</subfield><subfield code="j">2015</subfield><subfield code="e">5</subfield><subfield code="h">1353-1361</subfield></datafield></record></collection>
author	Esposito, Darjn
spellingShingle	Esposito, Darjn ddc 000 misc approximated adder misc size 65 nm misc error signal misc variable latency Kogge-Stone topology misc error probability reduction misc operand lengths misc Topology misc variable latency adders misc adders misc speculative variable latency adders misc average delay reduction misc variable latency speculative prefix adders misc approximated arithmetic function misc UMC library misc Complexity theory misc Addition misc Han-Carlson parallel-prefix topology misc error statistics misc Logic gates misc parallel-prefix adders misc error detection misc Computer architecture misc variable latency speculative Han-Carlson adder misc speculative adders misc digital arithmetic misc Delays misc speculative functional units misc error detection network misc exact arithmetic function misc Error correction misc nonspeculative adders misc Mathematical functions misc Error correction & detection misc Signal processing misc Network architecture misc Methods misc Distribution (Probability theory) misc Approximation theory misc Innovations misc Usage Variable Latency Speculative Han-Carlson Adder
authorStr	Esposito, Darjn
ppnlink_with_tag_str_mv	@@773@@(DE-627)131043080
format	Article
dewey-ones	000 - Computer science, information & general works 620 - Engineering & allied operations
delete_txt_mv	keep
author_role	aut
collection	OLC
remote_str	false
illustrated	Not Illustrated
issn	1549-8328
topic_title	000 620 DNB Variable Latency Speculative Han-Carlson Adder approximated adder size 65 nm error signal variable latency Kogge-Stone topology error probability reduction operand lengths Topology variable latency adders adders speculative variable latency adders average delay reduction variable latency speculative prefix adders approximated arithmetic function UMC library Complexity theory Addition Han-Carlson parallel-prefix topology error statistics Logic gates parallel-prefix adders error detection Computer architecture variable latency speculative Han-Carlson adder speculative adders digital arithmetic Delays speculative functional units error detection network exact arithmetic function Error correction nonspeculative adders Mathematical functions Error correction & detection Signal processing Network architecture Methods Distribution (Probability theory) Approximation theory Innovations Usage
topic	ddc 000 misc approximated adder misc size 65 nm misc error signal misc variable latency Kogge-Stone topology misc error probability reduction misc operand lengths misc Topology misc variable latency adders misc adders misc speculative variable latency adders misc average delay reduction misc variable latency speculative prefix adders misc approximated arithmetic function misc UMC library misc Complexity theory misc Addition misc Han-Carlson parallel-prefix topology misc error statistics misc Logic gates misc parallel-prefix adders misc error detection misc Computer architecture misc variable latency speculative Han-Carlson adder misc speculative adders misc digital arithmetic misc Delays misc speculative functional units misc error detection network misc exact arithmetic function misc Error correction misc nonspeculative adders misc Mathematical functions misc Error correction & detection misc Signal processing misc Network architecture misc Methods misc Distribution (Probability theory) misc Approximation theory misc Innovations misc Usage
topic_unstemmed	ddc 000 misc approximated adder misc size 65 nm misc error signal misc variable latency Kogge-Stone topology misc error probability reduction misc operand lengths misc Topology misc variable latency adders misc adders misc speculative variable latency adders misc average delay reduction misc variable latency speculative prefix adders misc approximated arithmetic function misc UMC library misc Complexity theory misc Addition misc Han-Carlson parallel-prefix topology misc error statistics misc Logic gates misc parallel-prefix adders misc error detection misc Computer architecture misc variable latency speculative Han-Carlson adder misc speculative adders misc digital arithmetic misc Delays misc speculative functional units misc error detection network misc exact arithmetic function misc Error correction misc nonspeculative adders misc Mathematical functions misc Error correction & detection misc Signal processing misc Network architecture misc Methods misc Distribution (Probability theory) misc Approximation theory misc Innovations misc Usage
topic_browse	ddc 000 misc approximated adder misc size 65 nm misc error signal misc variable latency Kogge-Stone topology misc error probability reduction misc operand lengths misc Topology misc variable latency adders misc adders misc speculative variable latency adders misc average delay reduction misc variable latency speculative prefix adders misc approximated arithmetic function misc UMC library misc Complexity theory misc Addition misc Han-Carlson parallel-prefix topology misc error statistics misc Logic gates misc parallel-prefix adders misc error detection misc Computer architecture misc variable latency speculative Han-Carlson adder misc speculative adders misc digital arithmetic misc Delays misc speculative functional units misc error detection network misc exact arithmetic function misc Error correction misc nonspeculative adders misc Mathematical functions misc Error correction & detection misc Signal processing misc Network architecture misc Methods misc Distribution (Probability theory) misc Approximation theory misc Innovations misc Usage
format_facet	Aufsätze Gedruckte Aufsätze
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	nc
author2_variant	c d d cd cdd e n en n p np a g m s agm agms
hierarchy_parent_title	IEEE transactions on circuits and systems / 1
hierarchy_parent_id	131043080
dewey-tens	000 - Computer science, knowledge & systems 620 - Engineering
hierarchy_top_title	IEEE transactions on circuits and systems / 1
isfreeaccess_txt	false
familylinks_str_mv	(DE-627)131043080 (DE-600)1100194-X (DE-576)02804679X
title	Variable Latency Speculative Han-Carlson Adder
ctrlnum	(DE-627)OLC1959251856 (DE-599)GBVOLC1959251856 (PRQ)c2646-b78b41b2fafa5bceff3bf5ba0782c5cfe3fd08cfa2addf893a26b4150300b3d50 (KEY)0213966920150000062000501353variablelatencyspeculativehancarlsonadder
title_full	Variable Latency Speculative Han-Carlson Adder
author_sort	Esposito, Darjn
journal	IEEE transactions on circuits and systems / 1
journalStr	IEEE transactions on circuits and systems / 1
lang_code	eng
isOA_bool	false
dewey-hundreds	000 - Computer science, information & general works 600 - Technology
recordtype	marc
publishDateSort	2015
contenttype_str_mv	txt
container_start_page	1353
author_browse	Esposito, Darjn
container_volume	62
class	000 620 DNB
format_se	Aufsätze
author-letter	Esposito, Darjn
doi_str_mv	10.1109/TCSI.2015.2403036
dewey-full	000 620
title_sort	variable latency speculative han-carlson adder
title_auth	Variable Latency Speculative Han-Carlson Adder
abstract	Variable latency adders have been recently proposed in literature. A variable latency adder employs speculation: the exact arithmetic function is replaced with an approximated one that is faster and gives the correct result most of the time, but not always. The approximated adder is augmented with an error detection network that asserts an error signal when speculation fails. Speculative variable latency adders have attracted strong interest thanks to their capability to reduce average delay compared to traditional architectures. This paper proposes a novel variable latency speculative adder based on Han-Carlson parallel-prefix topology that resulted more effective than variable latency Kogge-Stone topology. The paper describes the stages in which variable latency speculative prefix adders can be subdivided and presents a novel error detection network that reduces error probability compared to previous approaches. Several variable latency speculative adders, for various operand lengths, using both Han-Carlson and Kogge-Stone topology, have been synthesized using the UMC 65 nm library. Obtained results show that proposed variable latency Han-Carlson adder outperforms both previously proposed speculative Kogge-Stone architectures and non-speculative adders, when high-speed is required. It is also shown that non-speculative adders remain the best choice when the speed constraint is relaxed.
abstractGer	Variable latency adders have been recently proposed in literature. A variable latency adder employs speculation: the exact arithmetic function is replaced with an approximated one that is faster and gives the correct result most of the time, but not always. The approximated adder is augmented with an error detection network that asserts an error signal when speculation fails. Speculative variable latency adders have attracted strong interest thanks to their capability to reduce average delay compared to traditional architectures. This paper proposes a novel variable latency speculative adder based on Han-Carlson parallel-prefix topology that resulted more effective than variable latency Kogge-Stone topology. The paper describes the stages in which variable latency speculative prefix adders can be subdivided and presents a novel error detection network that reduces error probability compared to previous approaches. Several variable latency speculative adders, for various operand lengths, using both Han-Carlson and Kogge-Stone topology, have been synthesized using the UMC 65 nm library. Obtained results show that proposed variable latency Han-Carlson adder outperforms both previously proposed speculative Kogge-Stone architectures and non-speculative adders, when high-speed is required. It is also shown that non-speculative adders remain the best choice when the speed constraint is relaxed.
abstract_unstemmed	Variable latency adders have been recently proposed in literature. A variable latency adder employs speculation: the exact arithmetic function is replaced with an approximated one that is faster and gives the correct result most of the time, but not always. The approximated adder is augmented with an error detection network that asserts an error signal when speculation fails. Speculative variable latency adders have attracted strong interest thanks to their capability to reduce average delay compared to traditional architectures. This paper proposes a novel variable latency speculative adder based on Han-Carlson parallel-prefix topology that resulted more effective than variable latency Kogge-Stone topology. The paper describes the stages in which variable latency speculative prefix adders can be subdivided and presents a novel error detection network that reduces error probability compared to previous approaches. Several variable latency speculative adders, for various operand lengths, using both Han-Carlson and Kogge-Stone topology, have been synthesized using the UMC 65 nm library. Obtained results show that proposed variable latency Han-Carlson adder outperforms both previously proposed speculative Kogge-Stone architectures and non-speculative adders, when high-speed is required. It is also shown that non-speculative adders remain the best choice when the speed constraint is relaxed.
collection_details	GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_30 GBV_ILN_70 GBV_ILN_2002 GBV_ILN_2005 GBV_ILN_2059
container_issue	5
title_short	Variable Latency Speculative Han-Carlson Adder
url	http://dx.doi.org/10.1109/TCSI.2015.2403036 http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=7080926 http://search.proquest.com/docview/1685290863
remote_bool	false
author2	De Caro, Davide Napoli, Ettore Petra, Nicola Strollo, Antonio Giuseppe Maria
author2Str	De Caro, Davide Napoli, Ettore Petra, Nicola Strollo, Antonio Giuseppe Maria
ppnlink	131043080
mediatype_str_mv	n
isOA_txt	false
hochschulschrift_bool	false
author2_role	oth oth oth oth
doi_str	10.1109/TCSI.2015.2403036
up_date	2024-07-03T16:29:32.775Z
_version_	1803576066996961280
fullrecord_marcxml	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">OLC1959251856</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20210715225527.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">160206s2015 xx \|\|\|\|\| 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1109/TCSI.2015.2403036</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20160617</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1959251856</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1959251856</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)c2646-b78b41b2fafa5bceff3bf5ba0782c5cfe3fd08cfa2addf893a26b4150300b3d50</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0213966920150000062000501353variablelatencyspeculativehancarlsonadder</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">000</subfield><subfield code="a">620</subfield><subfield code="q">DNB</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Esposito, Darjn</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Variable Latency Speculative Han-Carlson Adder</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2015</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Variable latency adders have been recently proposed in literature. A variable latency adder employs speculation: the exact arithmetic function is replaced with an approximated one that is faster and gives the correct result most of the time, but not always. The approximated adder is augmented with an error detection network that asserts an error signal when speculation fails. Speculative variable latency adders have attracted strong interest thanks to their capability to reduce average delay compared to traditional architectures. This paper proposes a novel variable latency speculative adder based on Han-Carlson parallel-prefix topology that resulted more effective than variable latency Kogge-Stone topology. The paper describes the stages in which variable latency speculative prefix adders can be subdivided and presents a novel error detection network that reduces error probability compared to previous approaches. Several variable latency speculative adders, for various operand lengths, using both Han-Carlson and Kogge-Stone topology, have been synthesized using the UMC 65 nm library. Obtained results show that proposed variable latency Han-Carlson adder outperforms both previously proposed speculative Kogge-Stone architectures and non-speculative adders, when high-speed is required. It is also shown that non-speculative adders remain the best choice when the speed constraint is relaxed.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">approximated adder</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">size 65 nm</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">error signal</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">variable latency Kogge-Stone topology</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">error probability reduction</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">operand lengths</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Topology</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">variable latency adders</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">adders</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">speculative variable latency adders</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">average delay reduction</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">variable latency speculative prefix adders</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">approximated arithmetic function</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">UMC library</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complexity theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Addition</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Han-Carlson parallel-prefix topology</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">error statistics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic gates</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">parallel-prefix adders</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">error detection</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer architecture</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">variable latency speculative Han-Carlson adder</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">speculative adders</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">digital arithmetic</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Delays</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">speculative functional units</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">error detection network</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">exact arithmetic function</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Error correction</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">nonspeculative adders</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical functions</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Error correction & detection</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Signal processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Network architecture</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Methods</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Distribution (Probability theory)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Approximation theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Innovations</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Usage</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">De Caro, Davide</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Napoli, Ettore</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Petra, Nicola</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Strollo, Antonio Giuseppe Maria</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">IEEE transactions on circuits and systems / 1</subfield><subfield code="d">New York, NY : Institute of Electrical and Electronics Engineers, 1992</subfield><subfield code="g">62(2015), 5, Seite 1353-1361</subfield><subfield code="w">(DE-627)131043080</subfield><subfield code="w">(DE-600)1100194-X</subfield><subfield code="w">(DE-576)02804679X</subfield><subfield code="x">1549-8328</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:62</subfield><subfield code="g">year:2015</subfield><subfield code="g">number:5</subfield><subfield code="g">pages:1353-1361</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://dx.doi.org/10.1109/TCSI.2015.2403036</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=7080926</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://search.proquest.com/docview/1685290863</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_30</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2002</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2059</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">62</subfield><subfield code="j">2015</subfield><subfield code="e">5</subfield><subfield code="h">1353-1361</subfield></datafield></record></collection>
score	7.3996487

Nicht das Richtige dabei?

Schreiben Sie uns!

Variable Latency Speculative Han-Carlson Adder

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?