Skip to search formSkip to main contentSemantic Scholar

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

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

2010

Highly Cited

2008

Highly Cited

2008

This paper presents an efficient reverse converter for transforming the redundant binary (RB) representation into two's… Expand

Is this relevant?

Highly Cited

2004

Highly Cited

2004

This paper presents the design of a new lightweight, hyper-redundant, deployable Binary Robotic Articulated Intelligent Device… Expand

Is this relevant?

2004

2004

Multiplication is a very important operation in digital computing systems. Both signed and unsigned multiplications are required… Expand

Is this relevant?

Highly Cited

2003

Highly Cited

2003

We propose an elliptic curve (EC) cryptographic processor architecture that can support Galois fields GF(p) and GF(2/sup n/) for… Expand

Is this relevant?

2002

2002

In the classical meldable heap data type we maintain an item-disjoint collection of heaps under the operations find-min, insert… Expand

Is this relevant?

2000

2000

Past recorders have added critical path delay for the more frequent case where both inputs are non redundant. Our proposed… Expand

Is this relevant?

Highly Cited

1987

Highly Cited

1987

A 16-bit /spl times/ 16-bit multiplier for 2 two's-complement binary numbers based on a new algorithm is described. This… Expand

Is this relevant?

Highly Cited

1978

Highly Cited

1978

This paper investigates the logical design of a redundant binary adder with two input digits and one output digit, all in the… Expand

Is this relevant?

Highly Cited

1962

Highly Cited

1962

The ( n /2)-out-of- n code is proved to be the least redundant binary block code which permits the detection of all errors in… Expand

Is this relevant?