Updating matrix inverse in fixed-point representation: direct versus iterative methods
Maija Ylinen, A. Burian, Jarmo Takala · 2004
The VLSI implementations of digital signal processing algorithms gain huge performance improvements if fixed-point arithmetic is being used. Inspired by the fact, fixed-point algorithms for both direct and iterative methods to update the inverse of a matrix were implemented and compared. Also, an algorithm to approximate an overdetermined system for an efficient and fast implementation of the Sherman-Morrison formula is proposed.