Toggle Main Menu Toggle Search

Open Access padlockePrints

ROM-less LNS

Lookup NU author(s): Dr Nick Coleman


Full text for this publication is not currently held within this repository. Alternative links are provided below where available.


The logarithmic number system has been proposed as an alternative to floating-point arithmetic. Multiplication, division and square-root operations are accomplished with fixed-point methods, but addition and subtraction are considerably more challenging. Recent work has demonstrated that these operations too can be done with similar speed and accuracy to their FP equivalents, but the necessary circuitry is complex. In particular, it is dominated by the need for large ROM tables for the storage of non-linear functions. This paper describes two algorithms, a new co-transformation procedure and an improvement to an existing interpolation method, that reduce these tables to an extent that allows their easy synthesis in logic. An implementation shows substantial reductions in area and delay from the previous best 32-bit realisation, with equivalent accuracy.

Publication metadata

Author(s): Ismail RC, Coleman JN

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: 20th IEEE Symposium on Computer Arithmetic

Year of Conference: 2011

Pages: 43-51

ISSN: 1063-6889

Publisher: IEEE


DOI: 10.1109/ARITH.2011.15

Library holdings: Search Newcastle University Library for this item

ISBN: 9781424494576