A Fast Base-K Logarithm with Redundant Representation
نویسندگان
چکیده
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.
منابع مشابه
On Progress of Investigations in Continued Logarithm Arithmetic
This is a work-in-progress on research of exact real arithmetic using continued fraction paradigm. We introduce a new redundant extension of continued logarithm representation, which offers the lacking real number computability. In a uniform way, we contrast this new representation with existing alternatives and using few examples we discuss their practical aspects. It follows from this compari...
متن کاملA Margin-based Model with a Fast Local Searchnewline for Rule Weighting and Reduction in Fuzzynewline Rule-based Classification Systems
Fuzzy Rule-Based Classification Systems (FRBCS) are highly investigated by researchers due to their noise-stability and interpretability. Unfortunately, generating a rule-base which is sufficiently both accurate and interpretable, is a hard process. Rule weighting is one of the approaches to improve the accuracy of a pre-generated rule-base without modifying the original rules. Most of the pro...
متن کامل7.1 Clique Number of Random Graphs
(Throughout this section, log denotes base-2 logarithm.) We now sketch a proof of this theorem. Proof: Let Xk be the number of k-cliques in a graph G drawn from Gn, 2 . By linearity of expectation we have g(k) := E[Xk] = ( n k ) 2−( k 2) and let us define k0(n) to be the largest value of k such that g(k) ≥ 1. An easy calculation (Exercise!) shows that k0(n) ∼ 2 log n. (To see this is plausible,...
متن کاملMulti-base Representations of Integers: Asymptotic Enumeration and Central Limit Theorems
In a multi-base representation of an integer (in contrast to, for example, the binary or decimal representation) the base (or radix) is replaced by products of powers of single bases. The resulting numeral system has desirable properties for fast arithmetic. It is usually redundant, which means that each integer can have multiple different digit expansions, so the natural question for the numbe...
متن کاملA generalized architecture for efficient multi-segment logarithm approximation
This paper presents a novel hardware architecture for the approximation of the base-2 logarithm of integers at a high accuracy and with low resource requirements. The generalized piecewise linear approximation approach allows the utilization of a very large number of linear segments for the approximation of the logarithm function, whereas state of the art architectures are limited to a maximum ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Inf. Sci. Eng.
دوره 21 شماره
صفحات -
تاریخ انتشار 2005