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.
['Rui-Lin Chen', 'Chichyang Chen']
Pipelined Computation of Very Large Word-Length LNS Addition/Subtraction Computation with Exponential Convergence Rate