High Throughput Exponential (Clock-Driven Logic)

Complete the following steps to compute exp(x when x is outside the range [-1, 1):

1. Find an integer q and a real number r, where r is in the range [0, ln(2)), such that x = q * ln(2) + r.
2. Compute 2^q * exp(r), which is equivalent to exp(x). Because r is in the valid range of [-1, 1), you can then use this node to compute exp(r).

The CORDIC algorithm represents x internally as a fixed-point number with a 1-bit integer word length. The word length of x must be less than or equal to 64 bits, which means the fractional word length must be less than or equal to 63 bits. If you wire a value to x that has a fractional word length greater than 63 bits, this node rounds off the lower bits to achieve a fractional word length of 63 bits. For example, if you wire a fixed-point data type with a configuration of I60<-5, 55> to x, this node coerces the configuration to be I58<-5,53>.

If you wire a fixed-point data type to x with a fractional word length greater than 63 bits and an integer word length less than -62 bits, this node coerces the configuration to be I1<-62, 63> if the data type is signed. If the data type is unsigned, the coerced configuration is U1<-62, 63>.