2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512)
DOI: 10.1109/iscas.2004.1328724
|View full text |Cite
|
Sign up to set email alerts
|

Direct versus iterative methods for fixed-point implementation of matrix inversion

Abstract: Fixed-point simulation results are used for performance measure of inverting matrices using direct and iterative methods. As direct method the Cholesky decomposition is being used. For the iterative counterpart, the Newton's iteration has been implemented. The fixed-point implementation of matrix inversion is tested and analyzed for both cases. We compare our solutions by using some numerical examples.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
13
0

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 17 publications
(13 citation statements)
references
References 9 publications
0
13
0
Order By: Relevance
“…The Newton iterative method for matrix inversion [9][10] is an extension of the Newton method used for locating the root of a function ݂ሺܺሻ. According to this procedure, the generic step ݅ of the iterative process is:…”
Section: B Newton Methods For Matrix Inversionmentioning
confidence: 99%
See 1 more Smart Citation
“…The Newton iterative method for matrix inversion [9][10] is an extension of the Newton method used for locating the root of a function ݂ሺܺሻ. According to this procedure, the generic step ݅ of the iterative process is:…”
Section: B Newton Methods For Matrix Inversionmentioning
confidence: 99%
“…The dynamics of the signal in the critical points of the algorithm has been analysed to achieve an optimal trade-off between math precision and calculation effort. A careful use of fixed and block floating point math, the exploitation of the Newton method for matrix inversion [9][10], several simplifications and approximations, allowed reducing the calculations load without compromising the accuracy. An in vivo test on the carotid artery of a volunteer is presented.…”
Section: Introductionmentioning
confidence: 99%
“…2) Newton Iteration method: The Newton iteration (NI) is also known as the Newton-Raphson method and it is an iterative method for finding the approximation of the matrix inverse [66]. For G, estimation of the matrix inversion at nth iteration is given by…”
Section: A Linear Detectors Based On the Approximate Matrix Inversionmentioning
confidence: 99%
“…This Because Gauss-Seidel method [6] emphasizes the precision more, and we emphasizes the low complexity more, so we mainly compare with PE method. In this paper, we adopt matrix inversion based on Newton iteration (NI) [7], [8] in massive MIMO data detection, and introduce the relationship between NI-based and PE-based matrix inversion method. Compared with [3], NI method can obtain the same precision and complexity, or higher precision at the cost of complexity by controlling the number of iterations.…”
Section: Introductionmentioning
confidence: 99%