Name
Abstract | ||
|---|---|---|
Here we introduce the new concept of computation coding. Similar to how rate-distortion theory is concerned with the lossy compression of data, computation coding deals with the lossy computation of functions. Particularizing to linear functions, we present an algorithmic approach to reduce the computational cost of multiplying a constant matrix with a variable vector, which requires neither a matrix nor vector having any particular structure or statistical properties. The algorithm decomposes the constant matrix into the product of codebook and wiring matrices whose entries are either zero or signed integer powers of two. For a typical application like the implementation of a deep neural network, the proposed algorithm reduces the number of required addition units several times. To achieve the accuracy of 16-bit signed integer arithmetic for 4k-vectors, no multipliers and only 1.5 adders per matrix entry are needed. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.3390/a15070253 | ALGORITHMS |
Keywords | DocType | Volume |
approximate computing, computational complexity, estimation error, fixed-point arithmetic, linear systems, rate-distortion theory, quantization | Journal | 15 |
Issue | ISSN | Citations |
7 | 1999-4893 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| R. Muller | 1 | 1206 | 124.92 |
| Bernhard Martin Wilhelm Gaede | 2 | 0 | 0.34 |
| Ali Bereyhi | 3 | 0 | 0.34 |