New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

impl. of sqrtf_neon_hpf() #7

Open

GoogleCodeExporter opened this issue Nov 11, 2015 · 0 comments

Labels

auto-migrated Priority-Medium Type-Defect

GoogleCodeExporter commented Nov 11, 2015


sqrtf_neon_hpf() first computes the inverse of the square root, and then the 
reciprocal, i.e.

t = 1/sqrt(x)
r = 1/t

it might be easier/faster to compute the inverse of the square root, and then 
multiply by the original value, i.e.

t = 1/sqrt(x)
r = x * t

Original issue reported on code.google.com by [email protected] on 15 Sep 2011 at 11:53

The text was updated successfully, but these errors were encountered:

GoogleCodeExporter added Priority-Medium Type-Defect auto-migrated labels

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment