Number Systems: A Path into Rigorous Mathematics aims to introduce number systems to an undergraduate audience in a way that emphasises the importance of rigour, and with a focus on providing detailed but accessible explanations of theorems and their proofs. The book continually seeks to build upon students' intuitive ideas of how numbers and arithmetic work, and to guide them towards the means to embed this natural understanding into a more structured framework of understanding. The author’s motivation for writing this book is that most previous texts, which have complete coverage of the subject, have not provided the level of explanation needed for first-year students. On the other hand, those that do give good explanations tend to focus broadly on Foundations or Analysis and provide incomplete coverage of Number Systems. Features Approachable for students who have not yet studied mathematics beyond school Does not merely present definitions, theorems and proofs, but also motivates them in terms of intuitive knowledge and discusses methods of proof Draws attention to connections with other areas of mathematics Plenty of exercises for students, both straightforward problems and more in-depth investigations Introduces many concepts that are required in more advanced topics in mathematics.

This book offers a rigorous and coherent introduction to the five basic number systems of mathematics, namely natural numbers, integers, rational numbers, real numbers, and complex numbers. It is a subject that many mathematicians believe should be learned by any student of mathematics including future teachers. The book starts with the development of Peano arithmetic in the first chapter which includes mathematical induction and elements of recursion theory. It proceeds to an examination of integers that also covers rings and ordered integral domains. The presentation of rational numbers includes material on ordered fields and convergence of sequences in these fields. Cauchy and Dedekind completeness properties of the field of real numbers are established, together with some properties of real continuous functions. An elementary proof of the Fundamental Theorem of Algebra is the highest point of the chapter on complex numbers. The great merit of the book lies in its extensive list of exercises following each chapter. These exercises are designed to assist the instructor and to enhance the learning experience of the students.

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.

This new and expanded monograph improves upon Mohan's earlier book, Residue Number Systems (Springer, 2002) with a state of the art treatment of the subject. Replete with detailed illustrations and helpful examples, this book covers a host of cutting edge topics such as the core function, the quotient function, new Chinese Remainder theorems, and large integer operations. It also features many significant applications to practical communication systems and cryptography such as FIR filters and elliptic curve cryptography. Starting with a comprehensive introduction to the basics and leading up to current research trends that are not yet widely distributed in other publications, this book will be of interest to both researchers and students alike.

This book introduces readers to alternative approaches to designing efficient embedded systems using unconventional number systems. The authors describe various systems that can be used for designing efficient embedded and application-specific processors, such as Residue Number System, Logarithmic Number System, Redundant Binary Number System Double-Base Number System, Decimal Floating Point Number System and Continuous Valued Number System. Readers will learn the strategies and trade-offs of using unconventional number systems in application-specific processors and be able to apply and design appropriate arithmetic operations from these number systems to boost the performance of digital systems.

This book provides readers a comprehensive introduction to alternative number systems for more efficient representations of Deep Neural Network (DNN) data. Various number systems (conventional/unconventional) exploited for DNNs are discussed, including Floating Point (FP), Fixed Point (FXP), Logarithmic Number System (LNS), Residue Number System (RNS), Block Floating Point Number System (BFP), Dynamic Fixed-Point Number System (DFXP) and Posit Number System (PNS). The authors explore the impact of these number systems on the performance and hardware design of DNNs, highlighting the challenges associated with each number system and various solutions that are proposed for addressing them.

Fundamental arithmetic operations support virtually all of the engineering, scientific, and financial computations required for practical applications, from cryptography, to financial planning, to rocket science. This comprehensive reference provides researchers with the thorough understanding of number representations that is a necessary foundation for designing efficient arithmetic algorithms. Using the elementary foundations of radix number systems as a basis for arithmetic, the authors develop and compare alternative algorithms for the fundamental operations of addition, multiplication, division, and square root with precisely defined roundings. Various finite precision number systems are investigated, with the focus on comparative analysis of practically efficient algorithms for closed arithmetic operations over these systems. Each chapter begins with an introduction to its contents and ends with bibliographic notes and an extensive bibliography. The book may also be used for graduate teaching: problems and exercises are scattered throughout the text and a solutions manual is available for instructors.