Full metadata record
DC FieldValueLanguage
dc.contributor.authorChih, JCen_US
dc.contributor.authorChen, SGen_US
dc.date.accessioned2014-12-08T15:27:05Z-
dc.date.available2014-12-08T15:27:05Z-
dc.date.issued2000en_US
dc.identifier.urihttp://hdl.handle.net/11536/19300-
dc.description.abstractThis work proposes a new CORDIC algorithm, which considerably reduces rotation number. It is achieved by combining several design techniques. Particularly, a new angle recoding scheme for table lookup is developed to speed up the convergence rate of the rotation angle. The required lookup table is small. Other design techniques used include: the leading-one bit detection, the variable-scale-factor compensation algorithm [6]. The number of the shift-and-add operations required in the compensation algorithm can be also further reduced by using the same residue recoding scheme. Simulations show that in aver;ige the new design needs only 3.5; iterations to generate results with 22-bit precision, which is much less than the existing designs (normally need 22 iterations). The new encoding scheme can be applied to other iterative convergence computation function such as division operation.en_US
dc.language.isoen_USen_US
dc.titleA fast CORDIC algorithm based on a novel angle recoding schemeen_US
dc.typeProceedings Paperen_US
dc.identifier.journalISCAS 2000: IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS - PROCEEDINGS, VOL IV: EMERGING TECHNOLOGIES FOR THE 21ST CENTURYen_US
dc.citation.spage621en_US
dc.citation.epage624en_US
dc.contributor.department電子工程學系及電子研究所zh_TW
dc.contributor.departmentDepartment of Electronics Engineering and Institute of Electronicsen_US
dc.identifier.wosnumberWOS:000088844700156-
Appears in Collections:Conferences Paper