The invention discloses a
CORDIC inverse trigonometric function solving
system based on prefix
binary tree mapping, and the
system comprises a prefix
binary tree mapping module which is used for carrying out the multi-stage prefix comparison of an input independent variable x, and directly outputting a unit vector corresponding to the (k + 1) th iteration, so as to replace the first k stages of micro-rotation iterations of a
CORDIC algorithm; and the
CORDIC iteration module is used for taking the unit vector output by the prefix
binary tree mapping module as an initial value, taking an input independent variable x as an initial comparison value, continuing to finish the rest (M-k-1)-level iteration from the (k + 1)-th level, and outputting a final iteration result. According to the CORDIC anti-trigonometric function solving
system based on prefix binary tree mapping provided by the invention, on the premise of keeping the calculation precision, the early-stage
iteration process of a CORDIC
algorithm is effectively replaced, the calculation
resource consumption and the
operation time delay are remarkably reduced, meanwhile, the precision loss caused by approximate
gain compensation is thoroughly avoided, and the calculation efficiency is improved. Therefore, the requirement of a real-time high-
performance computing system for high-precision transcendental function operation is met.