ARITH 2005 - PDF Preprint Papers

ARITH 2005 IEEE Symposium on Computer Arithmetic

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ARITH-2005 Paper

click to vote

ARITH
2005
IEEE

183views Applied Computing» more ARITH 2005»

A Hardware Algorithm for Integer Division

13 years 10 months ago

Download arith.polito.it

Abstract— A hardware algorithm for integer division is proposed. It is based on the digit-recurrence, non-restoring division algorithm. Fast computation is achieved by the use of...

Naofumi Takagi, Shunsuke Kadowaki, Kazuyoshi Takag...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	183	A Hardware Algorithm for Integer Division	claim
2	168	The Residue Logarithmic Number System: Theory and Implementation	claim
3	152	Arithmetic Operations in the Polynomial Modular Number System	claim
4	142	Error-Free Computation of 8x8 2-D DCT and IDCT Using Two-Dimensional Algebraic Integer Quantization	claim
5	137	Floating-Point Fused Multiply-Add: Reduced Latency for Floating-Point Addition	claim
6	134	N-Bit Unsigned Division via N-Bit Multiply-Add	claim
7	129	Fast Modular Reduction for Large Wordlengths via One Linear and One Cyclic Convolution	claim
8	124	An Improved Unified Scalable Radix-2 Montgomery Multiplier	claim
9	124	The Vector Floating-Point Unit in a Synergistic Processor Element of a CELL Processor	claim
10	121	A Linear-System Operator Based Scheme for Evaluation of Multinomials	claim
11	118	Data Dependent Power Use in Multipliers	claim
12	107	Efficient Mapping of Addition Recurrence Algorithms in CMOS	claim
13	105	Low Latency Pipelined Circular CORDIC	claim
14	105	Gal's Accurate Tables Method Revisited	claim
15	98	Correctly Rounded Multiplication by Arbitrary Precision Constants	claim
16	98	Quasi-Pipelined Hash Circuits	claim
17	95	Table Lookup Structures for Multiplicative Inverses Modulo 2k	claim
18	92	Dedication	claim
19	89	A Fast-Start Method for Computing the Inverse Tangent	claim
20	89	High-Radix Implementation of IEEE Floating-Point Addition	claim
21	87	Some Functions Computable with a Fused-Mac	claim
22	84	Division by Constant for the ST100 DSP Microprocessor	claim
23	82	Long Number Bit-Serial Squarers	claim
24	81	Efficient Function Approximation Using Truncated Multipliers and Squarers	claim
25	80	Low Latency Digit-Recurrence Reciprocal and Square-Root Reciprocal Algorithm and Architecture	claim
26	79	Towards the Post-Ultimate libm	claim
27	77	Synthesis of Saturating Counters Using Traditional and Non-Traditional Basic Counters	claim
28	76	Guaranteed Proofs Using Interval Arithmetic	claim
29	74	Single Precision Reciprocals by Multipartite Table Lookup	claim
30	73	Parallel Montgomery Multiplication in GF(2k) Using Trinomial Residue Arithmetic	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers