Code Size and Accuracy-Aware Synthesis of Fixed-Point Programs for Matrix Multiplication - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2014

Code Size and Accuracy-Aware Synthesis of Fixed-Point Programs for Matrix Multiplication

Abstract

In digital signal processing, many primitives boil down to a matrix multiplication. In order to enable savings in time, energy consumption, and on-chip area, these primitives are often implemented in fixed-point arithmetic. Various conflicting goals undermine the process of writing fixed-point codes, such as numerical accuracy, run-time latency, and size of the codes. In this article, we introduce a new methodology to automate the synthesis of small and accurate codes for matrix multiplication in fixed-point arithmetic. Our approach relies on a heuristic to merge matrix rows or columns in order to reduce the synthesized code size, while guaranteeing a target accuracy. We suggest a merging strategy based on finding closest pairs of vectors, which makes it possible to address in a few seconds problems such as the synthesis of small and accurate codes for size-64 and more matrix multiplication. Finally, we illustrate its efficiency on a set of benchmarks, and we show that it allows to reduce the synthesized code size by more than 50% while maintaining good numerical properties.
Fichier principal
Vignette du fichier
MaNaRe-PECCS2014-submitted.pdf (885.51 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-00860383 , version 1 (30-09-2015)

Identifiers

Cite

Matthieu Martel, Mohamed Amine Najahi, Guillaume Revy. Code Size and Accuracy-Aware Synthesis of Fixed-Point Programs for Matrix Multiplication. PECCS: Pervasive and Embedded Computing and Communication Systems, Jan 2014, Lisbonne, Portugal. ⟨10.5220/0004884802040214⟩. ⟨lirmm-00860383⟩
471 View
407 Download

Altmetric

Share

Gmail Facebook X LinkedIn More