TY - JFULL AU - Aki Happonen and Adrian Burian and Erwin Hemming PY - 2007/12/ TI - A Reconfigurable Processing Element for Cholesky Decomposition and Matrix Inversion T2 - International Journal of Electronics and Communication Engineering SP - 560 EP - 566 VL - 1 SN - 1307-6892 UR - https://publications.waset.org/pdf/3614 PU - World Academy of Science, Engineering and Technology NX - Open Science Index 11, 2007 N2 - Fixed-point simulation results are used for the performance measure of inverting matrices by Cholesky decomposition. The fixed-point Cholesky decomposition algorithm is implemented using a fixed-point reconfigurable processing element. The reconfigurable processing element provides all mathematical operations required by Cholesky decomposition. The fixed-point word length analysis is based on simulations using different condition numbers and different matrix sizes. Simulation results show that 16 bits word length gives sufficient performance for small matrices with low condition number. Larger matrices and higher condition numbers require more dynamic range for a fixedpoint implementation. ER -