Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2014

2014

In this paper, we propose 128-bit Kogge-Stone, Ladner-Fischer, Spanning tree parallel prefix adders and compared with Ripple… Expand

Is this relevant?

2014

2014

Two architectures for modulo 2 n +1 adders are introduced in this paper. The first one is built around a sparse carry computation… Expand

Is this relevant?

2014

2014

In this paper, we propse 16-bit sparse tree RSFQ adder (Rapid single flux quantam), kogge-stone adder, carry lookahead adder. In… Expand

Is this relevant?

2012

2012

Two architectures for modulo 2n+1 adders are introduced in this paper. The first one is built around a sparse carry computation… Expand

Is this relevant?

2011

2011

The major constraint in VLSI design is the tradeoff between area, power and speed. Hence, it is very important to obtain an… Expand

Is this relevant?

2010

2010

The paper presents an algebraic analysis for the correctness of prefix-based adders. In contrast to using higher-order functions… Expand

Is this relevant?

2008

2008

Two-operand binary addition is the most widely used arithmetic operation in modern datapath designs. To improve the efficiency of… Expand

Is this relevant?

Highly Cited

2002

Highly Cited

2002

A robotic assistance system is presented which enables a human to handle unwieldy long objects by providing only one point of… Expand

Is this relevant?

2001

2001

We present a unified framework to compare and optimize various adders in the literature including carry-ripple adders, carry-look… Expand

Is this relevant?

1991

1991

This paper examines some of the short -term social implications for workers of introducing robots onto Australian construction… Expand

Is this relevant?