Residue number systems : theory and implementation / Amos Omondi, Benjamin Premkumar.

By:

Omondi, Amos R

Contributor(s):

Premkumar, Benjamin

Material type: Text

TextSeries: Advances in computer science and engineering. Texts ; ; v. 2.Publication details: London : Imperial College Press ; Singapore ; Hackensack, NJ : Distributed by World Scientific Pub., ©2007.Description: 1 online resource (xiv, 296 pages) : illustrationsContent type:

text

Media type:

computer

Carrier type:

online resource

ISBN:

9781860948671
1860948677
1281867586
9781281867582

Subject(s): Genre/Form:

Additional physical formats: Print version:: Residue number systems.DDC classification:

512.72 22

LOC classification:

QA244 .O36 2007eb

Online resources:

Click here to access online

Contents:

1. Introduction -- 2. Mathematical fundamentals -- 3. Forward conversion -- 4. Addition -- 5. Multiplication -- 6. Comparison, overflow-detection, sign-determination, scaling, and division -- 7. Reverse conversion -- 8. Applications.

Summary: Residue number systems (RNSs) and arithmetic are useful for several reasons. First, a great deal of computing now takes place in embedded processors, such as those found in mobile devices, for which high speed and low-power consumption are critical; the absence of carry propagation facilitates the realization of high-speed, low-power arithmetic. Second, computer chips are now getting to be so dense that full testing will no longer be possible; so fault tolerance and the general area of computational integrity have become more important. RNSs are extremely good for applications such as digital signal processing, communications engineering, computer security (cryptography), image processing, speech processing, and transforms, all of which are extremely important in computing today. This book provides an up-to-date account of RNSs and arithmetic. It covers the underlying mathematical concepts of RNSs; the conversion between conventional number systems and RNSs; the implementation of arithmetic operations; various related applications are also introduced. In addition, numerous detailed examples and analysis of different implementations are provided.

Item type:

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Home library	Collection	Call number	Materials specified	Status	Date due	Barcode
Electronic-Books	OPJGU Sonepat- Campus	E-Books EBSCO			Available

Includes bibliographical references and index.

Print version record.

Residue number systems (RNSs) and arithmetic are useful for several reasons. First, a great deal of computing now takes place in embedded processors, such as those found in mobile devices, for which high speed and low-power consumption are critical; the absence of carry propagation facilitates the realization of high-speed, low-power arithmetic. Second, computer chips are now getting to be so dense that full testing will no longer be possible; so fault tolerance and the general area of computational integrity have become more important. RNSs are extremely good for applications such as digital signal processing, communications engineering, computer security (cryptography), image processing, speech processing, and transforms, all of which are extremely important in computing today. This book provides an up-to-date account of RNSs and arithmetic. It covers the underlying mathematical concepts of RNSs; the conversion between conventional number systems and RNSs; the implementation of arithmetic operations; various related applications are also introduced. In addition, numerous detailed examples and analysis of different implementations are provided.

eBooks on EBSCOhost EBSCO eBook Subscription Academic Collection - Worldwide

There are no comments on this title.

to post a comment.