Re-submitted to IEEE Transactions on Computers
نویسندگان
چکیده
In this paper we analyze some of the main properties of a double base number system, using bases 2 and 3; in particular we emphasize the sparseness of the representation. A simple geometric interpretation allows an efficient implementation of the basic arithmetic operations and we introduce an index calculus for logarithmic-like arithmetic with considerable hardware reductions in look-up table size. We discuss the application of this new number system in the area of digital signal processing; we illustrate the discussion with examples of finite impulse response filtering.
منابع مشابه
Submitted to : Ieee Transactions on Computers ,
| In this paper we provide polynomial time approximation techniques which allow us to calculate, to arbitrary levels of accuracy and with high probability of success, the spectral coeecients and autocorrelation coeecients of Boolean functions, given that those functions are expressed in either Sum-of-Products (SOP) or Product-of-Sums form. For spectral coeecients of a function in SOP form, anal...
متن کاملState of the Journal
WELCOME to the middle-of-the year update on the state of the journal, where, as usual, you’ll find information about current and new initiatives as well as the presentation of the new associate editors and the farewell to those whose term has expired. Today, July 2016, the IEEE Transactions on Computers (TC) is just in the middle of their 65th year of continued and successful publication, and t...
متن کاملState of the Journal
Dimitris Gizopoulos is a professor in the Department of Informatics & Telecommunications, the National and Kapodistrian University of Athens where he leads the Computer Architecture Laboratory. His research focuses on the dependability, performance, and power efficiency of computing systems architectures built around high-performance and embedded multicore CPUs as well as GPUs. He has published...
متن کاملCorrection to the 2005 , IEEE Transactions on Computers paper : ” Digit Selection for SRT Division and Square Root ”
It has been pointed out by counterexamples in a 2013 paper in the IEEE Transactions on Computers [1], that there is an error in the previously ibid. in 2005 published paper [2] on the construction of valid digit selection tables for SRT type division and square root algorithms. The error has been corrected, and new results found on selection constants for maximally redundant digit sets.
متن کامل