Name
Title | ||
|---|---|---|
Fast Residue-to-Binary Conversion Using Base Extension and the Chinese Remainder Theorem |
Abstract | ||
|---|---|---|
Residue number systems are attractive due to their basic arithmetic operations, such as addition and multiplication, are carry-free; this facilitates low-power, high-speed implementations. But converting from residue to conventional notation is generally problematic. In this paper, we propose a high-speed architecture for reverse conversion; this is based on Base Extension and the Chinese Remainder Theorem. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1142/S021812660700371X | JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS |
Keywords | Field | DocType |
residue number systems,reverse conversion,base extension,Chinese Remainder Theorem | Notation,Algebra,Residue (complex analysis),Chinese remainder theorem,Arithmetic,Multiplication,Residue number system,Mathematics,Binary number | Journal |
Volume | Issue | ISSN |
16 | 3 | 0218-1266 |
Citations | PageRank | References |
1 | 0.35 | 1 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Amos R. Omondi | 1 | 17 | 3.88 |