CORDIC ALGORITHM
computer science crazy Super Moderator Posts: 3,048 Joined: Dec 2008 
01102009, 07:24 AM
CORDIC ALGORITHM Radar works by bouncing electromagnetic energy off a target, recording the echo and making some useful observation from the data. A fundamental problem in radar is that the vast majority of the reflected energy does not make it back to the receiver. Much of the processing in a radar system is to improve the signal to noise ratio of the received signal and maximizing range accuracy to determine the position of the target with less error. Various techniques are available to the radar engineer for the design of high range solution system .These techniques may be categorized as simple pulse and pulse compression techniques. NEED FOR CORDIC Digital Signal Processing is dominated by microprocessors with enhancements , single cycle multiplyaccumulate instruction and special addressing modes . Microprocessors are not fast enough for truly demanding DSP tasks. Algorithms optimized for these microprocessors based system do not map well into hardware.The advent of reconfigurable logic computers permits the higher speeds of dedicated hardware solution at costs that are competitive with the traditional software approach. Among these hardwareefficient algorithms is a class of iterative solutions for trigonometric and other transcendental functions that use only shifts & adds to perform. This trigonometric algorithm is called CORDIC. The trigonometric CORDIC algorithms were originally developed as a digital solution for realtime navigation problems CORDIC Theory: An algorithm for vector rotation CORDIC is an acronym for Coordinate Rotation Digital Computer. It is a hardware efficient algorithm, which belong to a class of iterative solutions that use only shifts & adds to perform a wide range of functions including certain trigonometric, hyperbolic, linear and logarithmic functions. CORDIC revolves around the idea of "rotating" the phase of a complex number, by multiplying it by a succession of constant values. however, the "multiplies" can all be powers of 2,so in binary arithmetic they can be done using just shifts and adds; no actual "multiplier" is needed Use Search at http://topicideas.net/search.php wisely To Get Information About Project Topic and Seminar ideas with report/source code along pdf and ppt presenaion



Vladimir Baykov Active In SP Posts: 2 Joined: Jul 2010 
20072010, 01:30 PM
Now one can read full text of my book about CORDIC
published in 1972: http://baykov.de/CORDIC1972.htm http://umup.narod.ru/1115.zip And also: http://baykov.de/CORDIC1985.htm http://web.archive.org/web/1999042118591...ykov3.html Vladimir Baykov 


Vladimir Baykov Active In SP Posts: 2 Joined: Jul 2010 
20072010, 01:43 PM
Now one can read the full text of my book
about CORDIC published in 1975: http://baykov.de/CORDIC1975.htm http://umup.narod.ru/1115.zip and also my PhD Thesis: http://baykov.de/CORDIC1972.htm The second book about CORDIC: http://baykov.de/CORDIC1985.htm http://web.archive.org/web/1999042118591...ykov3.html Vladimir Baykov 


project report maker Active In SP Posts: 119 Joined: Jul 2010 
20072010, 03:25 PM
wow ..its very nice
Use Search at http://topicideas.net/search.php wisely To Get Information About Project Topic and Seminar ideas with report/source code along pdf and ppt presenaion



seminar flower Super Moderator Posts: 10,120 Joined: Apr 2012 
20072012, 01:54 PM
CORDIC Algorithm
12CORDIC Algorithm.ppt (Size: 496 KB / Downloads: 59) Key Ideas Method for Elementary Function Evaluation (e.g., sin(z), cos(z), tan1(y)) Originally Used for Realtime Navigation (Volder 1956) Idea is to Rotate a Vector in Cartesion Plane by Some Angle Complexity Comparable to Division If we have a computationally efficient way of rotating a vector, we can evaluate cos, sin, and tan–1 functions Rotation by an arbitrary angle is difficult, so we perform psuedorotations Use special angles to synthesize a desired angle z z = a(1) + a(2) + . . . + a(m) Review  CORDIC  Rotation Mode Input is Angle, – Initialized in Angle Accumulator Vector Initialized to Lie on xaxis Each Iteration di Chosen by Sign of Angle Attempt to Bring Angle to Zero Result is x Register Contains ~cos Result is y Register Contains ~sin Also Polar to Rectangular if x Register Initialized to Magnitude Review  CORDIC  Vector Mode Input is (Prescaled) Vector in (x,y) Registers Angle, – Initialized to Zero Each Iteration di Chosen to Move Vector to Lie Along Positive xaxis (Want to Reduce y Register to Zero) Result is Original Vector Angle in Angle Accumulator Can be Used for sin1 and cos1 Also Rectangular to Polar Conversion Magnitude in x Register 


