On matrix-vector product based sub-quadratic arithmetic complexity schemes for field multiplication

2007 ◽  
Author(s):  
M. A. Hasan
Keyword(s):  
Vector Product ◽  
Arithmetic Complexity ◽  
Field Multiplication ◽  
Matrix Vector

Symmetric matrix-vector product on a ring of processors

1990 ◽  
Vol 35 (5) ◽  
pp. 239-248
Author(s):  
Ken Grigg ◽  
Serge Miguet ◽  
Yves Robert
Keyword(s):  
Symmetric Matrix ◽  
Vector Product ◽  
Matrix Vector

FPGA Coprocessor for Simulation of Neural Networks Using Compressed Matrix Storage

2011 ◽  
pp. 255-275
Author(s):  
Jörg Bornschein
Keyword(s):  
Neural Network ◽  
Neural Networks ◽  
Sparse Matrix ◽  
Receptive Fields ◽  
The State ◽  
Connectivity Matrix ◽  
Vector Product ◽  
Sparse Connectivity ◽  
Matrix Vector ◽  
Direct Implementation

An FPGA-based coprocessor has been implemented which simulates the dynamics of a large recurrent neural network composed of binary neurons. The design has been used for unsupervised learning of receptive fields. Since the number of neurons to be simulated (>104) exceeds the available FPGA logic capacity for direct implementation, a set of streaming processors has been designed. Given the state- and activity vectors of the neurons at time t and a sparse connectivity matrix, these streaming processors calculate the state- and activity vectors for time t + 1. The operation implemented by the streaming processors can be understood as a generalized form of a sparse matrix vector product (SpMxV). The largest dataset, the sparse connectivity matrix, is stored and processed in a compressed format to better utilize the available memory bandwidth.

Sign in / Sign up

Export Citation Format

Share Document