Calculate y = x / (1 + x ^ 2) on FPGA

I need to compute a function y=x/(1+x^2)

on a small FPGA at a fixed point, can you help me find the best algorithm?

I thought about these possibilities:

  • since the FPGA is small i think i will use shift & add / subtract aa a multiplier and divider will use about the same number of cycles, right?
  • This function is similar to digital filter, can I compute without separation using feedback?
  • I don't think I will have a lot of memory, so I would rather not use LUT

Are there any other options? The timing requirement is not very strict, so I thought of a simple shift & subtraction, but if there is something simpler it might be better.

+3
algorithm fpga


source to share


No one has answered this question yet

Check out similar questions:

832
Calculate the distance between two latitude longitude points? (Haversine's formula)
828
Big O, how do you compute / approximate it?
744
How can I tell if my calculation is correct?
383
Fastest fixed length type 6 int array
29
How do you print EXACT the value of a floating point number?
17
How to implement (fast) split bigint?
five
System architecture design for real-time acquisition and "control"
five
Implementing the function for calculating the root
4
Overloaded split operator for HugeInt
0
What do you think of this Equation (which should be implemented in Verilog and FPGA)?



All Articles
Loading...
X
Show
Funny
Dev
Pics