On the Mesh Array for Matrix Multiplication
arXiv:1010.5421
Abstract
This article presents new properties of the mesh array for matrix multiplication. In contrast to the standard array that requires 3n-2 steps to complete its computation, the mesh array requires only 2n-1 steps. Symmetries of the mesh array computed values are presented which enhance the efficiency of the array for specific applications. In multiplying symmetric matrices, the results are obtained in 3n/2+1 steps. The mesh array is examined for its application as a scrambling system.
6 pages
Cited by in corpus (8)
- New Results on Scrambling Using the Mesh Array
- Efficiency of Matrix Multiplication on the Cross-Wired Mesh Array
- Random Sequences from Primitive Pythagorean Triples
- Goldbach Triples and Key Distribution
- Random Sequences Based on the Divisor Pairs Function
- The Algebra of Two Dimensional Patterns
- Cryptographic Hardening of d-Sequences
- Using Variable Threshold to Increase Capacity in a Feedback Neural Network