Implementation of parallel computational algorithms on a modified CORDIC arithmetic logic
Thesis/Dissertation
·
OSTI ID:5475150
CORDIC (COordinate Rotation Digital Computer) is a powerful technique for evaluating trigonometric, hyperbolic, exponential and logarithmic functions and for performing a variety of plane coordinate transformations. Furthermore, the algorithm is also suitable for other computations such as multiplication, division, and the conversion between binary and mixed-radix number systems. The basis for the algorithm is coordinate rotation in a linear, circular, or hyperbolic coordinate system depending on which function is to be calculated. The algorithm involves iterative procedures that require only additions, shift operations, and recall of prestored constants. However, the iterative nature of the algorithm dictates hardware implementations that are highly sequential in nature, resulting in slow speed of processing. The growing need for processing at high speed has resulted in a constant push for the development of faster computing structures balanced against the constraint to minimize computational complexity. With the advent of VLSI, many processing elements can now be realized on a single chip, and a large collection of processors have therefore become economically feasible. So, with this possibility in mind, the CORDIC iteration equations were modified in order to eliminate their sequential nature and to incorporate more parallelism.
- Research Organization:
- Michigan State Univ., East Lansing (USA)
- OSTI ID:
- 5475150
- Country of Publication:
- United States
- Language:
- English
Similar Records
A silicon compiler for dedicated mathematical systems based on CORDIC arithmetic processors
Algorithms for iterative array multiplication
Pipeline and parallel-pipeline FFT processors for VLSI implementations
Thesis/Dissertation
·
Sat Dec 31 23:00:00 EST 1988
·
OSTI ID:5585219
Algorithms for iterative array multiplication
Journal Article
·
Fri Aug 01 00:00:00 EDT 1986
· IEEE Trans. Comput.; (United States)
·
OSTI ID:5441231
Pipeline and parallel-pipeline FFT processors for VLSI implementations
Journal Article
·
Tue May 01 00:00:00 EDT 1984
· IEEE Trans. Comput.; (United States)
·
OSTI ID:6084101