Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

FCCM
2005
IEEE

favoriteEmaildiscussreport

142views VLSI» more FCCM 2005»

FPGA-Based Vector Processing for Solving Sparse Sets of Equations

13 years 10 months ago

FPGA-Based Vector Processing for Solving Sparse Sets of Equations

Download web.njit.edu

The solution to a set of sparse linear equations Ax = b, where A is an n×n sparse matrix and b is an n-element vector, can be obtained using the W-matrix method. An enhanced vector processor is implemented on an FPGA for this problem. Performance results are presented. The effect of pipelined multiple functional units, multiple data buses, instruction chaining, hardware synchronization, pipelined scattering, matrix density, and distribution of non-zero elements is analyzed.

Muhammad Z. Hasan, Sotirios G. Ziavras

Real-time Traffic

Enhanced Vector Processor | FCCM 2005 | Hardware | N×n Sparse Matrix | Sparse Linear Equations |

claim paper

Related Content

» Comparison of sparse least squares support vector regressors trained in primal and dual

» Sparse Least Squares Support Vector Regressors Trained in the Reduced Empirical Feature Sp...

» Image editing based on Sparse MatrixVector multiplication

» Parallel Monte Carlo Algorithms for Sparse SLAE Using MPI

» Eliminating Structure and Intensity Misalignment in Image Stitching

» Improved MFOCUSS Algorithm With Overlapping Blocks for Locally Smooth Sparse Signals

» Rank Awareness in Joint Sparse Recovery

» Algorithms for robust linear regression by exploiting the connection to sparse signal reco...

» Ordering Unstructured Meshes for Sparse Matrix Computations on Leading Parallel Systems

Post Info
More Details (n/a)

Added	24 Jun 2010
Updated	24 Jun 2010
Type	Conference
Year	2005
Where	FCCM
Authors	Muhammad Z. Hasan, Sotirios G. Ziavras

Comments (0)