Please use this identifier to cite or link to this item:
https://idr.l1.nitk.ac.in/jspui/handle/123456789/8803
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Oza, S.S. | - |
dc.contributor.author | Shah, A.P. | - |
dc.contributor.author | Thokala, T. | - |
dc.contributor.author | Sumam, David S. | - |
dc.date.accessioned | 2020-03-30T10:22:46Z | - |
dc.date.available | 2020-03-30T10:22:46Z | - |
dc.date.issued | 2016 | - |
dc.identifier.citation | 2015 International Conference on Computing and Network Communications, CoCoNet 2015, 2016, Vol., , pp.333-342 | en_US |
dc.identifier.uri | https://idr.nitk.ac.in/jspui/handle/123456789/8803 | - |
dc.description.abstract | The Coordinate Rotational Digital Computer (CORDIC) algorithm allows computation of trigonometric, hyperbolic, natural log and square root functions. This iterative algorithm uses only shift and add operations to converge. Multiple fixed radix variants of the algorithm have been implemented on hardware. These have demonstrated faster convergence at the expense of reduced accuracy. High radix adaptive variants of CORDIC also exist in literature. These allow for faster convergence at the expense of hardware multipliers in the datapath without compromising on the accuracy of the results. This paper proposes a 12 stage deep pipeline architecture to implement a high radix adaptive CORDIC algorithm. It employs floating point multipliers in place of the conventional shift and add architecture of fixed radix CORDIC. This design has been synthesised on a FPGA board to act as a coprocessor. The paper also studies the power, latency and accuracy of this implementation. � 2015 IEEE. | en_US |
dc.title | Pipelined implementation of high radix adaptive CORDIC as a coprocessor | en_US |
dc.type | Book chapter | en_US |
Appears in Collections: | 2. Conference Papers |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.