P-CORDIC: A precomputation based rotation CORDIC algorithm
Summary: This paper presents a CORDIC (coordinate rotation digital computer) algorithm and architecture for the rotation mode in which the directions of all micro-rotations are precomputed while maintaining a constant scale factor. Thus, an examination of the sign of the angle after each iteration is no longer required. The algorithm is capable to perform the CORDIC computation for an operand word-length of 54 bits. Additionally, there is a higher degree of freedom in choosing the pipeline cutsets due to the novel feature of independence of the iterations \(i\) and \(i-1\) in the CORDIC rotation.
- High-speed CORDIC based on an overlapped architecture and a novel \(\sigma\)-prediction method
- The differential CORDIC algorithm: Constant scale factor redundant implementation without correcting iterations
- scientific article; zbMATH DE number 4129990
- Fast CORDIC algorithm based on a new recoding scheme for rotation angles and variable scale factors
- Modified CORDIC algorithm with reduced iterations
- Fast CORDIC algorithm based on a new recoding scheme for rotation angles and variable scale factors
- P-CORDIC
- Very-high radix CORDIC rotation based on selection by rounding
- High-speed CORDIC based on an overlapped architecture and a novel \(\sigma\)-prediction method
- Optimization and implementation of scaling-free CORDIC-based direct digital frequency synthesizer for body care area network systems
- CORDIC as a switched nonlinear system
- scientific article; zbMATH DE number 4129990 (Why is no real title available?)
- Modified CORDIC algorithm with reduced iterations
- The quantization effects of the CORDIC algorithm
- A novel implementation of CORDIC algorithm using backward angle recoding (BAR)
- The differential CORDIC algorithm: Constant scale factor redundant implementation without correcting iterations
This page was built for publication: P-CORDIC: A precomputation based rotation CORDIC algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1773586)