Previous [ 1] [ 2] [ 3] [ 4] [ 5] [ 6] [ 7] [ 8] [ 9] [ 10] [ 11] [ 12]

@

Journal of Information Science and Engineering, Vol. 21 No. 2, pp. 429-437 (March 2005)

A Fast Base-K Logarithm with Redundant Representation

Che Wun Chiou and Ted C. Yang
Department of Electronic Engineering
Ching Yun University
Chungli, 320 Taiwan
E-mail: cwchiou@cyu.edu.tw
*Department of Information Engineering
Chaoyang University of Technology
Taichung County, 413 Taiwan
E-mail: president@mail.cyut.edu.tw

A new generation algorithm for the base-K logarithm is presented. Intermediate results for computation of the logarithm are presented in the redundant signed digit (RSD) representation, and additions and subtractions were performed without carry propagation. Based on the properties of RSD arithmetic, higher performance is obtained as compared with the conventional logarithm in the classical binary form.

Keywords: logarithm, carry-free addition, redundant representation, computer arithmetic, multiplication

Full Text () Received September 23, 2002; revised December 1, 2003 & January 29, 2004; accepted February 18, 2004.
Communicated by Gen-Huey Chen.