An O(1) time optimal algorithm for multiplying matrices on reconfigurable mesh (Q685469)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An O(1) time optimal algorithm for multiplying matrices on reconfigurable mesh |
scientific article; zbMATH DE number 417388
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An O(1) time optimal algorithm for multiplying matrices on reconfigurable mesh |
scientific article; zbMATH DE number 417388 |
Statements
An O(1) time optimal algorithm for multiplying matrices on reconfigurable mesh (English)
0 references
17 October 1993
0 references
We propose an architecture based on the reconfigurable mesh which can compute two \(N\times N\) matrix multiplication in constant time.
0 references
parallel processing
0 references
VLSI
0 references
area-time complexity
0 references
matrix multiplication
0 references
0.8744267
0 references
0.87371004
0 references
0.87350965
0 references
0.8695313
0 references
