Article

An improved Chen's parity detection technique for the two-moduli set.

International Journal of Computer Mathematics (Impact Factor: 0.54). 01/2011; 88:938-942. DOI: 10.1080/00207160.2010.488689
Source: DBLP

ABSTRACT This paper improved Chen's residue number system (RNS) parity detection technique such that the original two-moduli set {2−1, 2+1} is extended to {2p−1, 2p+1}, where h and p are positive integers. Given an RNS number X=(x1, x2) based on the extended two-moduli set, it is found that the parity of X is (p mod 2)·y0 ⊕ y1 if x1≥x2, where y1y0 denotes the binary representation of x1+x2 mod 4. On the contrary, if x1

0 Bookmarks
 · 
41 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: A novel general algorithm for signed number division in the residue number system (RNS) is presented. The parity checking technique used for sign and overflow detection in this algorithm is more efficient and practical than conventional methods. Sign magnitude arithmetic division is implemented using binary search. There is no restriction to the dividend and the divisor (except zero divisor), and no quotient estimation is necessary before the division is executed. Only simple operations are needed to accomplish this RBS division. All these characteristics have made the algorithm simple, efficient, and practical for implementation on a real RNS divider
    IEEE Transactions on Computers 09/1992; 41(8):1026-1032. · 1.38 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: The book is a systematic presentation of main algorithms available for performing basic arithmetic operations (addition, subtraction, multiplication and division in both fixed- and floating-point presentation) as well as more complex operations such as square root, exponential, logarithmic, trigonometric functions in computers. A lot of material is devoted to high-speed algorithms. Conventional as well as negative-radix, signed-radix, logarithmic, and residue number systems are covered. The first edition of this book has appeared in 1993. This is the second edition after 9 years. The contents of this edition is considerably extended. New sections include floating-point, prefix, carry-look-ahead, Ling adders, and fused multiply-add units. The remaining material was enlarged and updated. The focus is concentrated on understanding and fundamental principles of algorithms independently of any particular technology of their implementation. Each of 11 sections is supplemented by numerous exercises and exhaustive list of references. There are a number of “smart” exercises requiring something to prove, to show, to design, to estimate. There are given WWW links to additional study materials such as updates of the book, solutions to selected problems, on-line simulator for many algorithms contained in this book (www.ecs.umass.edu/ece/koren/arith/simulator). The book may be used as a textbook for in a senior-level or first year graduate level course in computer arithmetic as well as a reference book for engineers.
    01/1993; Prentice Hall., ISBN: 978-0-13-151952-7