Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

106

Voted

ASAP
2003
IEEE

112views Hardware» more ASAP 2003»

Comparison of Branching CORDIC Implementations

15 years 6 months ago

Comparison of Branching CORDIC Implementations

Download www.cs.umbc.edu

In this paper we compare implementations of Duprat and Muller's Branching CORDIC and Phatak's Double Step Branching (DSB)

Abhishek Singh, Dhananjay S. Phatak, Tom Goff, Mik

Real-time Traffic

ASAP 2003 | Classical Cordic Implementations | CORDIC | Double Step Branching | Hardware |

claim paper

Related Content

» Comments on Duprat and Mullers Branching CORDIC Paper

» Low Latency Pipelined Circular CORDIC

» A Comparison of Search Strategies for Geometric Branch and Bound Algorithms

» New updating criteria for conflictbased branching heuristics in DPLL algorithms for satisf...

» Super Scalar Sample Sort

» An Evolutionary Local Search Algorithm for the Satisfiability Problem

» Analytical models for leakage power estimation of memory array structures

» Detecting lateral gene transfers by statistical reconciliation of phylogenetic forests

» Bio NEXUS a Perl API for the NEXUS format for comparative biological data

Post Info
More Details (n/a)

Added	23 Aug 2010
Updated	23 Aug 2010
Type	Conference
Year	2003
Where	ASAP
Authors	Abhishek Singh, Dhananjay S. Phatak, Tom Goff, Mike Riggs, James F. Plusquellic, Chintan Patel

Comments (0)