# Computer Arithmetics

Semestr: Winter

Range: 2+2s

Completion:

Credits: 4

Programme type: Undefined

Study form: Fulltime

Course language:

### Summary:

The basic principles of the computer arithmetic are presented. The implementations of basic arithmetic operations and theirs implementation by logical circuits are considered for both unsigned and signed numbers. The floating-point and decimal numbers representations are discussed. The most important methods and algorithms to evaluate the elementary functions (e.g. square root, sin, logarithms etc.) and theirs implementation by logical circuits are presented. Some non-conventional number systems are discussed.

### Course syllabus:

1. Binary adders and subtractors; solving the carry propagation problem
2. Signed number adders and subtractors
3. Shifts and shifters; extension and shortening of representation
4. Multiplication
5. Division
6. Floating point operations
7. Using decimal member system
8. Square root evaluation and usage of iterative methods
9. Evaluation of some elementary functions I.
10. Evaluation of some elementary functions II.
11. Rapid multiplication
12. Rapid division
13. Some nonconventional number systems
14. Spare

### Seminar syllabus:

1. Some non-conventional applications of number systems
2. Conventional number systems
3. Signed number representations
5. Signed number adders and subtractors design I.
6. Signed number adders and subtractors design II.
7. Shifter and shift register design
8. Multiply unit design
9. Division unit design
10. Floating-point unit design I.
11. Floating-point unit design II.
12. Square root unit design
13. Some non-conventional number systems units
14. Spare and assessment

### Literature:

1. Omondi,A.R.: Computer Arithmetic Systems. New York: Prentice-Hall. 1994
2. Scott,N.S. Computer Number Systems & Arithmetic. Englewood Cliffs: Prentice-Hall. 1985
3. Koren,I. Computer Arithmetic Algorithms. Englewood Cliffs: Prentice-Hall. 1993.