Results 281 to 290 of about 1,412,342 (324)
Some of the next articles are maybe not open access.
IEEE Transactions on Computers, 1996
Summary: 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.
L. Dadda, V. Piuri
openaire +1 more source
Summary: 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.
L. Dadda, V. Piuri
openaire +1 more source
ACM Computing Surveys, 1977
Pipelined computer architecture has received considerable attention since the 1960s when the need for faster and more cost-effective systems became critical. The merit of pipelining is that it can help to match the speeds of various subsystems without duplicating the cost of the entire system involved.
Ramamoorthy, C. V., Li, H. F.
openaire +2 more sources
Pipelined computer architecture has received considerable attention since the 1960s when the need for faster and more cost-effective systems became critical. The merit of pipelining is that it can help to match the speeds of various subsystems without duplicating the cost of the entire system involved.
Ramamoorthy, C. V., Li, H. F.
openaire +2 more sources