A well-known scheme for obtaining high throughput adders is a pipeline in which each stage contains an array of half-adders performing a carry-save addition. This paper shows that other schemes can be designed, based on the idea of pipelining a serial-input adder or a ripple-carry adder. Such schemes offer a considerable savings of components while preserving high throughput. These schemes can be generalized by using (p, q) parallel counters to obtain pipelined adders for more than two numbers.

Pipelined adders / L. Dadda, V. Piuri. - In: IEEE TRANSACTIONS ON COMPUTERS. - ISSN 0018-9340. - 45:3(1996), pp. 348-356.

Pipelined adders

V. Piuri
Ultimo
1996

Abstract

A well-known scheme for obtaining high throughput adders is a pipeline in which each stage contains an array of half-adders performing a carry-save addition. This paper shows that other schemes can be designed, based on the idea of pipelining a serial-input adder or a ripple-carry adder. Such schemes offer a considerable savings of components while preserving high throughput. These schemes can be generalized by using (p, q) parallel counters to obtain pipelined adders for more than two numbers.
Settore ING-INF/05 - Sistemi di Elaborazione delle Informazioni
1996
Article (author)
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2434/160349
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 32
  • ???jsp.display-item.citation.isi??? 23
social impact