Login / Signup
Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials.
Francisco Rodríguez-Henríquez
Guillermo Morales-Luna
Julio César López-Hernández
Published in:
IEEE Trans. Computers (2008)
Keyphrases
</>
low complexity
square root
bit parallel
kalman filtering
floating point
arrival rate
computational complexity
distributed video coding
motion estimation
euclidean space
pattern matching
probability density function
database systems
similarity measure