Redundant binary representation

Known as: Redundant Binary 
A redundant binary representation (RBR) is a numeral system that uses more bits than needed to represent a single binary digit so that most numbers… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1978-2017
0519782017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
This paper introduces a memristor based redundant binary adder for canonic signed digit code, that coding eliminates the carry… (More)
  • table II
  • table I
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2009
2009
The use of redundant binary (RB) arithmetic in the design of high-speed digital multipliers is beneficial due to its high… (More)
  • table I
  • figure 1
  • table II
  • table III
  • figure 3
Is this relevant?
2008
2008
This paper presents an efficient reverse converter for transforming the redundant binary (RB) representation into two's… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
The benefit of high radix Booth encoders in reducing the number of partial products in fast multipliers has been hampered by the… (More)
  • table I
  • table II
  • table IV
  • table V
  • figure 2
Is this relevant?
2004
2004
This work addresses the feasibility of re-engineering the multiplier architecture that is based on a new redundant number… (More)
  • figure 1
  • figure 6
  • table 3
  • table 4
  • table 5
Is this relevant?
1989
1989
  • Sau-Gee Chen
  • Eighth Annual International Phoenix Conference on…
  • 1989
An addition rule for signed-digit representation (SDR), generalized from the addition rule of redundant binary representation, is… (More)
Is this relevant?
1987
1987
A high speed multiplier and divider for MOS LSI based on a new algorithm is presented. When we implement the multiplier and the… (More)
  • table I
  • table III
  • table IV
Is this relevant?
1987
1987
An on-line error-detectable high-speed multiplier is described. It is based on the multiplication algorithm which we have… (More)
  • figure 2
  • figure 3
  • figure 5
  • figure 6
  • figure 8
Is this relevant?
1986
1986
In this paper, we propose hardware algorithms for computing exponentials and logarithms utilizing the redundant binary… (More)
  • table 1
  • table 2
  • table 3
  • figure 2
  • table 4
Is this relevant?
Highly Cited
1985
Highly Cited
1985
A high-speed VLSI multiplication algorithm internally using redundant binary representation is proposed. In n bit binary integer… (More)
  • table I
  • figure 3
  • table II
  • figure 4
  • table III
Is this relevant?