Name
Abstract | ||
|---|---|---|
Algorithms for Euclidean (i.e., integer) division by a constant operation are presented. They allow fast computation for some values of the divisor (known at compile time) or also when both quotient and modulus are required. These algorithms are based on the multiply-accumulate instruction and the 40-bit arithmetic available in DSPs such as the ST100 DSP from STMicroelectronics. The results are demonstrated in the case of standard speech coding applications. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1109/ARITH.2005.17 | IEEE Symposium on Computer Arithmetic |
Keywords | Field | DocType |
digital arithmetic,digital signal processing chips,multiplying circuits,speech coding,ST100 DSP microprocessor,digital arithmetic,division by constant,multiply-accumulate instruction | Integer,Speech coding,Arbitrary-precision arithmetic,Computer science,Compile time,Parallel computing,Quotient,Theoretical computer science,Divisor,Saturation arithmetic,Euclidean division | Conference |
ISSN | ISBN | Citations |
1063-6889 | 0-7695-2366-8 | 3 |
PageRank | References | Authors |
0.64 | 4 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jean-Michel Muller | 1 | 466 | 66.61 |
| Arnaud Tisserand | 2 | 358 | 39.33 |
| Benoit de Dinechin | 3 | 3 | 0.64 |
| Christophe Monat | 4 | 17 | 3.47 |