Academic Journals Database
Disseminating quality controlled scientific knowledge

High Throughput Iterative VLSI Architecture for Cholesky Factorization Based Matrix Inversion

ADD TO MY LIST
 
Author(s): D. N. Sonawane | M. S. Sutaone

Journal: International Journal of Computer Applications
ISSN 0975-8887

Volume: 35;
Issue: 8;
Start page: 10;
Date: 2011;
Original page

Keywords: Choleskey Factorization | FPGA's | Iterative Architetcure | Virtex-4

ABSTRACT
Cholesky factorization is the computationally most expensive step in numerically solving positive definite systems. Due to inherently recursive computation process and associated floating point division and square root operations in Cholesky factorization, it is very difficult to obtain acceleration by exploiting parallelism on FPGA's. To solve this problem, approach suggests iterative architecture with parallelly fetching the matrix elements using customized Diagonal Processing Elements 'DPU', Non Diagonal Processing Elements 'NDPU' and Triangular Processing Elements 'TPU' as computational processing units. The use of LNS approach using LUT technique for floating point square root and division arithmetic eventually improves resource and clock cycle utilization. Scheme is implemented using Xilinx Virtex4 FPGA and achieves 0.032us clock latency and obtained a throughput of 31.25Mupdates/s operating at 125 MHz for 4x4 matrix inversion problem.
Why do you need a reservation system?      Affiliate Program