On Using the Logarithmic Number System for Finite Wordlength Matrix Inversion
2011 (English)In: The 54th IEEE International Midwest Symposium on Circuits and Systems: IEEE MWSCAS 2011, Piscataway, NJ, USA: IEEE , 2011, 1-4 p.Conference paper (Refereed)
Matrix inversion is a key operation in for instance adaptivefilters and MIMO communication system receivers. For ill-conditionedchannel matrices long wordlengths are required for fixed-point implementationof matrix inversion. In this work, the wordlength/error tradeoffsfor matrix inversion using different algorithms with fixed-point andlogarithmic number systems (LNS) are considered. LNS provides higherresolution for small numbers and a larger dynamic range. Also, it willalter the cost of the basic operations in the algorithms. The results showthat also the wordlength required to achieve a comparable error differsignificantly between different algorithms and for most algorithms isreduced for LNS compared to fixed-point.
Place, publisher, year, edition, pages
Piscataway, NJ, USA: IEEE , 2011. 1-4 p.
, Midwest Symposium on Circuits and Systems. Conference Proceedings, ISSN 1548-3746
Matrix Inversion, Logarithmic number system, LNS
National CategoryOther Electrical Engineering, Electronic Engineering, Information Engineering
IdentifiersURN: urn:nbn:se:liu:diva-71358DOI: 10.1109/MWSCAS.2011.6026264ISBN: 978-1-61284-857-0 (print)ISBN: 978-1-61284-855-6 (e-ISBN)OAI: oai:DiVA.org:liu-71358DiVA: diva2:447684
2011 IEEE 54th International Midwest Symposium on Circuits and Systems (MWSCAS), Seoul, Korea, August 7-10, 2011