title: Generating lookup table for arctan computation
body: <p>I have seen many implementations for this but I got this new idea about which I couldn't be sure. So I need an opinion here. </p>
  
  <p>The idea is that instead of looking up the table for <code>arctan(gy/gx)</code>, look for <code>1/gx</code> in one table and multiply the result with <code>gy</code>. Then lookup for <code>arctan</code>. The reason for doing so is to reduce hardware cost as division is more expensive than multiplication. But the limitation is that I can have a <code>maximum of 10 address bits</code>. Whereas, multiplication will give me twice the number of bits in <code>gx</code>. <code>gx</code> itself is 8 bits. If I right shift <code>gy*(1/gx)</code> by 6 bits to get a 10 bit address, </p>
  
  <p>What could be the degree of error?</p>