Login / Signup

Finite wordlength properties of matrix inversion algorithms in fixed-point and logarithmic number systems.

Carl IngemarssonOscar Gustafsson
Published in: ECCTD (2011)
Keyphrases
  • fixed point
  • matrix inversion
  • finite number
  • computational complexity
  • worst case
  • dynamical systems
  • computational cost
  • machine learning
  • similarity measure
  • sufficient conditions