Compressed Modular Matrix Multiplication - Archive ouverte HAL Access content directly
Conference Papers Year : 2008

Compressed Modular Matrix Multiplication


We propose to store several integers modulo a small prime into a single machine word. Modular addition is performed by addition and possibly subtraction of a word containing several times the modulo. Modular Multiplication is not directly accessible but modular dot product can be performed by an integer multiplication by the reverse integer. Modular multiplication by a word containing a single residue is a also possible. Therefore matrix multiplication can be performed on such a compressed storage. We here give bounds on the sizes of primes and matrices for which such a compression is possible. We also explicit the details of the required compressed arithmetic routines.
Fichier principal
Vignette du fichier
compmatmul.pdf (162.5 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00259950 , version 1 (29-02-2008)
hal-00259950 , version 2 (13-03-2008)



Jean-Guillaume Dumas, Laurent Fousse, Bruno Salvy. Compressed Modular Matrix Multiplication. MICA'2008 - Milestones in Computer Algebra, May 2008, Tobago, Trinidad and Tobago. pp.133-140. ⟨hal-00259950v2⟩
285 View
266 Download



Gmail Facebook X LinkedIn More