Efficient implementation of linear system solution block using LDLT factorization

Two implementation forms of linear system solution are described in this paper. Cholesky LL
^T
decomposition require square roots, whereas LDL
^T
decomposition can avoid taking square roots by one more forward-substitute computation. Through computational complexity and hardware size analysis, it is shown that matrix inversion using LDL
^T
decomposition is faster than cholesky decomposition using square root function. Moreover the LDL
^T
decomposition has better performance of 31.4% in hardware size.