Finite wordlength properties of matrix inversion algorithms in fixed-point and logarithmic number system
2011 (English)In: 2011 20th European Conference on Circuit Theory and Design (ECCTD), Piscataway, NJ, USA: IEEE , 2011, 673-676 p.Conference paper (Refereed)
Matrix inversion is sensitive towards the number representation used. In this paper simulations of matrix inversion with numbers represented in the fixed-point and logarithmic number systems (LNS) are presented. A software framework has been implemented to allow extensive simulation of finite wordlength matrix inversion. Six different algorithms have been used and results on matrix condition number, wordlength, and to some extent matrix size are presented. The simulations among other things show that the wordlength requirements differ significantly between different algorithms in both fixed-point and LNS representations. The results can be used as a starting point for a matrix inversion hardware implementation.
Place, publisher, year, edition, pages
Piscataway, NJ, USA: IEEE , 2011. 673-676 p.
IdentifiersURN: urn:nbn:se:liu:diva-72745DOI: 10.1109/ECCTD.2011.6043633ISBN: 978-1-4577-0618-9OAI: oai:DiVA.org:liu-72745DiVA: diva2:461965
20th European Conference on Circuit Theory and Design, August 29-31, Linköping, Sweden