Pipelined Computation of Very Large Word-Length LNS Addition/Subtraction Computation with Exponential Convergence Rate

Very large word-length logarithmic number system (LNS) addition/subtraction requires a lot of hardware and long pipeline latency. In this paper, we proposed an algorithm that utilized two novel methods to solve these problems. With this algorithm, the convergence rate of LNS addition/subtraction uni...

Full description

Saved in:
Bibliographic Details
Main Authors: Rui-Lin Chen, Chichyang Chen
Format: Conference Proceeding
Language:English
Subjects:
Arithmetic
Circuits
Computer networks
Computer science
Convergence
Cost function
digit on-line algorithms
Hardware
high-precision exponential algorithm
logarithmic number system
on-line logarithmic algorithm
Pervasive computing
pipelined architecture
Pipelines
Table lookup
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Very large word-length logarithmic number system (LNS) addition/subtraction requires a lot of hardware and long pipeline latency. In this paper, we proposed an algorithm that utilized two novel methods to solve these problems. With this algorithm, the convergence rate of LNS addition/subtraction unit can be exponential. All the possible cases are thoroughly tested by simulations and thus we have proved the correctness of the algorithm.
ISSN:1087-4089
2375-527X
DOI:10.1109/I-SPAN.2009.101