About: Kogge–Stone adder

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Kogge–Stone adder Goto Sponge NotDistinct Permalink

An Entity of Type : yago:WikicatAdders, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/c/7ke1JDDE4Z

In computing, the Kogge–Stone adder (KSA or KS) is a parallel prefix form carry look-ahead adder. Other (PPA) include the Brent–Kung adder (BKA), the (HCA), and the fastest known variation, the (STA). The Kogge–Stone adder concept was developed by Peter M. Kogge and Harold S. Stone, who published it in a seminal 1973 paper titled A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations.

Attributes	Values
rdf:type	yago:Adder109768753 yago:Calculator109887034 yago:CausalAgent100007347 yago:Expert109617867 yago:LivingThing100004258 yago:Object100002684 yago:Organism100004475 yago:Person100007846 yago:PhysicalEntity100001930 yago:YagoLegalActor yago:YagoLegalActorGeo reptile yago:Whole100003553 yago:WikicatAdders
rdfs:label	Kogge–Stone adder (en)
rdfs:comment	In computing, the Kogge–Stone adder (KSA or KS) is a parallel prefix form carry look-ahead adder. Other (PPA) include the Brent–Kung adder (BKA), the (HCA), and the fastest known variation, the (STA). The Kogge–Stone adder concept was developed by Peter M. Kogge and Harold S. Stone, who published it in a seminal 1973 paper titled A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations. (en)
foaf:depiction
dcterms:subject	Adders (electronics)
Wikipage page ID	7020797 (xsd:integer)
Wikipage revision ID	1091085278 (xsd:integer)
Link from a Wikipage to another Wikipage	Computing Adders (electronics) Brent–Kung adder Fan-out Harold S. Stone Peter M. Kogge Carry-skip adder Carry (arithmetic) Manchester carry chain Springer-Verlag XOR Carry look-ahead adder dbr:Parallel_prefix_adder dbr:Han–Carlson_adder dbr:Lynch–Swartzlander_adder dbr:Spanning_tree_adder
Link from a Wikipage to an external page	https://books.google.com/books%3Fid=LmfHof1p3qUC&q=9780387285948
sameAs	Kogge–Stone adder Kogge–Stone adder Kogge–Stone adder
dbp:wikiPageUsesTemplate	dbt:Anchor dbt:Cite_book dbt:Reflist dbt:Short_description dbt:Sidebar_arithmetic_logic_circuits
thumbnail	wiki-commons:Special:FilePath/4_bit_Kogge_Stone_Adder_Example_new.png?width=300
has abstract	In computing, the Kogge–Stone adder (KSA or KS) is a parallel prefix form carry look-ahead adder. Other (PPA) include the Brent–Kung adder (BKA), the (HCA), and the fastest known variation, the (STA). The Kogge–Stone adder takes more area to implement than the Brent–Kung adder, but has a lower fan-out at each stage, which increases performance for typical CMOS process nodes. However, wiring congestion is often a problem for Kogge–Stone adders. The Lynch–Swartzlander design is smaller, has lower fan-out, and does not suffer from wiring congestion; however to be used the process node must support Manchester carry chain implementations. The general problem of optimizing parallel prefix adders is identical to the variable block size, multi level, carry-skip adder optimization problem, a solution of which is found in Thomas Lynch's thesis of 1996. An example of a 4-bit Kogge–Stone adder is shown in the diagram. Each vertical stage produces a "propagate" and a "generate" bit, as shown. The culminating generate bits (the carries) are produced in the last stage (vertically), and these bits are XOR'd with the initial propagate after the input (the red boxes) to produce the sum bits. E.g., the first (least-significant) sum bit is calculated by XORing the propagate in the farthest-right red box (a "1") with the carry-in (a "0"), producing a "1". The second bit is calculated by XORing the propagate in second box from the right (a "0") with C0 (a "0"), producing a "0". The Kogge–Stone adder concept was developed by Peter M. Kogge and Harold S. Stone, who published it in a seminal 1973 paper titled A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations. (en)
expand	Components (en)
expand-components	Adder (en)
gold:hypernym	Adder
prov:wasDerivedFrom	wikipedia-en:Kogge–Stone_adder?oldid=1091085278&ns=0
page length (characters) of wiki page	8228 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Kogge–Stone_adder
is Link from a Wikipage to another Wikipage of	Adder (electronics) Brent–Kung adder Carry-lookahead adder Carry-select adder Sparse Kogge–Stone adder KSA (disambiguation) Sparse Kogge-Stone adder Sparse Kogge Stone Adder Sparse Kogge Stone adder Kogge-Stone Adder Kogge-Stone adder Kogge & Stone Kogge & Stone adder Kogge Stone Adder Kogge Stone adder Kogge–Stone Kogge–Stone Adder Kogge-Stone
is Wikipage redirect of	Sparse Kogge–Stone adder Sparse Kogge-Stone adder Sparse Kogge Stone Adder Sparse Kogge Stone adder Kogge-Stone Adder Kogge-Stone adder Kogge & Stone Kogge & Stone adder Kogge Stone Adder Kogge Stone adder Kogge–Stone Kogge–Stone Adder Kogge-Stone
is foaf:primaryTopic of	wikipedia-en:Kogge–Stone_adder

Faceted Search & Find service v1.17_git147 as of Sep 06 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3332 as of Dec 5 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 54 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software