13 search results - page 1 / 3 » Comparison of Branching CORDIC Implementations |
ASAP
2003
IEEE
13 years 8 months ago
2003
IEEE
In this paper we compare implementations of Duprat and Muller's Branching CORDIC and Phatak's Double Step Branching (DSB)
TC
1998
13 years 4 months 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...
ARITH
2005
IEEE
13 years 10 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...
ECCV
2002
Springer
14 years 6 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...
DISOPT
2008
13 years 4 months 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...