Share Email Print
cover

Proceedings Paper

Bipartite implementation of the residue logarithmic number system
Author(s): Mark G. Arnold; Jie Ruan
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

The Logarithmic Number System (LNS) has area and power advantages over fixed-point and floating-point number systems in some applications that tolerate moderate precision. LNS multiplication/division require only addition/subtraction of logarithms. Normally, LNS is implemented with ripple-carry binary arithmetic for manipulating the logarithms; however, this paper uses carry-free residue arithmetic instead. The Residue Logarithmic Number System (RLNS) has the advantage of faster multiplication and division. In contrast, RLNS addition requires table-lookup, which is its main area and delay cost. The bipartite approach, which uses two tables and an integer addition, is introduced here to optimize RLNS addition. Using the techniques proposed here, RLNS with dynamic range and precision suitable for MPEG applications can be synthesized. Synthesis results show that bipartite RLNS achieves area savings and shorter delays compared to naive RLNS.

Paper Details

Date Published: 16 September 2005
PDF: 9 pages
Proc. SPIE 5910, Advanced Signal Processing Algorithms, Architectures, and Implementations XV, 59100O (16 September 2005); doi: 10.1117/12.616473
Show Author Affiliations
Mark G. Arnold, Lehigh Univ. (United States)
Jie Ruan, Lehigh Univ. (United States)


Published in SPIE Proceedings Vol. 5910:
Advanced Signal Processing Algorithms, Architectures, and Implementations XV
Franklin T. Luk, Editor(s)

© SPIE. Terms of Use
Back to Top