%0 Journal Article
	%A Aki Happonen and  Adrian Burian and  Erwin Hemming
	%D 2007
	%J International Journal of Electronics and Communication Engineering
	%B World Academy of Science, Engineering and Technology
	%I Open Science Index 11, 2007
	%T A Reconfigurable Processing Element for Cholesky Decomposition and Matrix Inversion
	%U https://publications.waset.org/pdf/3614
	%V 11
	%X 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.
	%P 561 - 566