13 search results - page 1 / 3 » Comparison of Branching CORDIC Implementations |
90
Voted
ASAP
2003
IEEE
15 years 4 months ago
2003
IEEE
In this paper we compare implementations of Duprat and Muller's Branching CORDIC and Phatak's Double Step Branching (DSB)
100
click to vote
TC
1998
15 years 2 days ago
1998
In [1], Duprat and Muller introduced the ingenious “Branching CORDIC” algorithm. It enables a fast implementation of CORDIC algorithm using signed digits and requires a consta...
82
Voted
ARITH
2005
IEEE
15 years 6 months ago
2005
IEEE
The pipelined CORDIC with linear approximation to rotation has been proposed to achieve reductions in delay, power and area; however, the schemes for rotation (multiplication) and...
94
Voted
ECCV
2002
Springer
16 years 2 months ago
2002
Springer
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
104
click to vote
DISOPT
2008
15 years 15 days ago
2008
The paper is concerned with the computational evaluation and comparison of a new family of conflict-based branching heuristics for evolved DPLL Satisfiability solvers. Such a fami...