Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Introduction of the Residue Number Arithmetic Logic Unit With Brief Computational Complexity Analysis (1512.00911v1)

Published 3 Dec 2015 in cs.OH

Abstract: Digital System Research has pioneered the mathematics and design for a new class of computing machine using residue numbers. Unlike prior art, the new breakthrough provides methods and apparatus for general purpose computation using several new residue based fractional representations. The result is that fractional arithmetic may be performed without carry. Additionally, fractional operations such as addition, subtraction and multiplication of a fraction by an integer occur in a single clock period, regardless of word size. Fractional multiplication is of the order O(p), where p equals the number of residues. More significantly, complex operations, such as sum of products, may be performed in an extended format, where fractional products are performed and summed using single clock instructions, regardless of word width, and where a normalization operation with an execution time of the order O(p) is performed as a final step.

Citations (2)

Summary

We haven't generated a summary for this paper yet.