个性化文献订阅>文章检索

文章名     作者     期刊名     摘要     卷     期         如果没有找到您所需要的文献，请点击 ——此处申请     共14条记录   Guest Editors' Introduction: Special Section on Computer Arithmetic [作者：Bruguera, J; Cornea, M; Das Sarma, D,期刊：IEEE Transactions on Computers, 页码：145-147 , 文章类型： Editorial Material，,卷期：2011年60-2] Reducing the Computation Time in (Short Bit-Width) Two's Complement Multipliers [作者：Lamberti, F; Andrikos, N; Antelo, E; Montuschi, P,期刊：IEEE Transactions on Computers, 页码：148-156 , 文章类型： Article，,卷期：2011年60-2] Two's complement multipliers are important for a wide range of applications. In this paper, we present a technique to reduce by one row the maximum height of the partial product array generated by a radix-4 Modified Boot... Exact and Approximated Error of the FMA [作者：Boldo, S; Muller, JM,期刊：IEEE Transactions on Computers, 页码：157-164 , 文章类型： Article，,卷期：2011年60-2] The fused multiply accumulate-add (FMA) instruction, specified by the IEEE 754-2008 Standard for Floating-Point Arithmetic, eases some calculations, and is already available on some current processors such as the Power P... Improved Division by Invariant Integers [作者：Moller, N; Granlund, T,期刊：IEEE Transactions on Computers, 页码：165-175 , 文章类型： Article，,卷期：2011年60-2] This paper considers the problem of dividing a two-word integer by a single-word integer, together with a few extensions and applications. Due to lack of efficient division instructions in current processors, the divisio... Simulation-Based Verification of Floating-Point Division [作者：Guralnik, E; Aharoni, M; Birnbaum, AJ; Koyfman, A,期刊：IEEE Transactions on Computers, 页码：176-188 , 文章类型： Article，,卷期：2011年60-2] Floating-point division is known to exhibit an exceptionally wide array of corner cases, making its verification a difficult challenge. Despite the remarkable advances in formal methods, the intricacies of this operation... Area-Efficient Multipliers Based on Multiple-Radix Representations [作者：Dimitrov, VS; Jarvinen, KU; Adikari, J,期刊：IEEE Transactions on Computers, 页码：189-201 , 文章类型： Article，,卷期：2011年60-2] In this paper, we shall introduce several new algorithms for integer multiplication that are based on specific multiple-radix representation of one of the multiplicands. We provide extensive theoretical analysis and expe... A Real/Complex Logarithmic Number System ALU [作者：Arnold, MG; Collange, S,期刊：IEEE Transactions on Computers, 页码：202-213 , 文章类型： Article，,卷期：2011年60-2] The real Logarithmic Number System (LNS) offers fast multiplication but uses more expensive addition. Cotransformation and higher order table methods allow real LNS ALUs with reasonable precision on Field-Programmable Ga... Computing Floating-Point Square Roots via Bivariate Polynomial Evaluation [作者：Jeannerod, CP; Knochel, H; Monat, C; Revy, G,期刊：IEEE Transactions on Computers, 页码：214-227 , 文章类型： Article，,卷期：2011年60-2] In this paper, we show how to reduce the computation of correctly rounded square roots of binary floating-point data to the fixed-point evaluation of some particular integer polynomials in two variables. By designing par... Midpoints and Exact Points of Some Algebraic Functions in Floating-Point Arithmetic [作者：Jeannerod, CP; Louvet, N; Muller, JM; Panhaleux, A,期刊：IEEE Transactions on Computers, 页码：228-241 , 文章类型： Article，,卷期：2011年60-2] When implementing a function f in floating-point arithmetic, if we wish correct rounding and good performance, it is important to know if there are input floating-point values x such that f(x) is either the middle of two... Certifying the Floating-Point Implementation of an Elementary Function Using Gappa [作者：de Dinechin, F; Lauter, C; Melquiond, G,期刊：IEEE Transactions on Computers, 页码：242-253 , 文章类型： Article，,卷期：2011年60-2] High confidence in floating-point programs requires proving numerical properties of final and intermediate values. One may need to guarantee that a value stays within some range, or that the error relative to some ideal ... Hybrid Binary-Ternary Number System for Elliptic Curve Cryptosystems [作者：Adikari, J; Dimitrov, VS; Imbert, L,期刊：IEEE Transactions on Computers, 页码：254-265 , 文章类型： Article，,卷期：2011年60-2] Single and double scalar multiplications are the most computational intensive operations in elliptic curve based cryptosystems. Improving the performance of these operations is generally achieved by means of integer reco... Fast Architectures for the eta(T) Pairing over Small-Characteristic Supersingular Elliptic Curves [作者：Beuchat, JL; Detrey, J; Estibals, N; Okamoto, E; Rodriguez-Henriquez, F,期刊：IEEE Transactions on Computers, 页码：266-281 , 文章类型： Article，,卷期：2011年60-2] This paper is devoted to the design of fast parallel accelerators for the cryptographic eta(T) pairing on supersingular elliptic curves over finite fields of characteristics two and three. We propose here a novel hardwar... Performing Arithmetic Operations on Round-to-Nearest Representations [作者：Kornerup, P; Muller, JM; Panhaleux, A,期刊：IEEE Transactions on Computers, 页码：282-291 , 文章类型： Article，,卷期：2011年60-2] During any composite computation, there is a constant need for rounding intermediate results before they can participate in further processing. Recently, a class of number representations denoted RN-Codings were introduc... ISRA-Based Grouping: A Disk Reorganization Approach for Disk Energy Conservation and Disk Performance Enhancement [作者：Liao, XL; Bai, S; Wang, YP; Hu, SM,期刊：IEEE Transactions on Computers, 页码：292-304 , 文章类型： Article，,卷期：2011年60-2] Reducing disk energy consumption and improving disk performance in high-performance computer systems are increasingly pressing issues for reasons of disk economy and efficiency. To achieve these goals, we define the conc...