## Module Handbook

• Dynamischer Default-Fachbereich geändert auf INF

# Course INF-02-09-K-2

## Course Type

SWS Type Course Form CP (Effort) Presence-Time / Self-Study
- K Lecture with exercise classes (V/U) 8.0 CP 156 h
4 V Lecture 56 h
2 U Exercise class (in small groups) 28 h
(4V+2U) 8.0 CP 84 h 156 h

## Basedata

SWS 4V+2U 8.0 CP = 240 h 1 Sem. in SuSe [2] Bachelor (Fundamentals) [DE] German Grimm, Christoph, Prof. Dr. (PROF | DEPT: INF) Schneider, Klaus, Prof. Dr. (PROF | DEPT: INF) Schürmann, Bernd, PD Dr.-Ing. (WMA | DEPT: INF, GS) [INF-PFL] Mandatory Modules [NORM] Active

## Possible Study achievement

• Verification of study performance: proof of successful participation in the exercise classes (ungraded)
• Details of the examination (type, duration, criteria) will be announced at the beginning of the course.

## Contents

Coding and information theory:
• Concept of information
• Efficient prefix codes (Huffmann, Shannon-Fano, etc.)
• Redundant codes for error detection and correction

Computational arithmetic:

• Radix-B and B-complement numbers and their calculation methods
• Fixed point numbers and floating point numbers (IEEE 754)

Propositional logic:

• Syntax and Semantics
• Normal forms
• Binary decision diagrams

Combinatorial circuits (switching networks):

• Simple circuits for radix B and B-complement numbers
• Efficient circuits for radix B and B-complement numbers (e.g. Carry-Lookahead addition, Wallace multiplication, Goldschmidt division, etc.)
• Logic minimization: Quine/McCluskey method, Karnaugh/Veitch diagrams, symbolic logic minimization, etc.

Sequential circuits

• Transducers and acceptors
• Mealy vs. Moore machines
• Determinate and minimize finite automata
• State coding and sequential circuit synthesis with FlipFlops
• Formal verification of sequential circuits

Processor architecture

• Instruction set architecture
• Von-Neumann, Harvard architecture, RISC/CISC architectures
• Operating and control units
• Example: MIPS or ARM instruction set
• Assembler programming

## Literature

• Skript.
• S.P. Dandamudi, Fundamentals of Computer Organization and Design, Springer, 2002.
• Giovanni De Micheli, Synthesis and Optimization of Digital Circuits, McGraw-Hill, 1994.
• Gary D. Hachtel and Fabio Somenzi, Logic Synthesis and Verification Algorithms, Kluwer, 1996.
• C. Hamacher, Z. Vranesic, S. Zaky, N. Manjikian; Computer Organization and Embedded Systems; McGraw Hill, 2012.
• K. Hwang; Computer Arithmetic, Principles, Architecture and Design; John Wiley and Sons; 1979.
• M. Lu; Arithmetic and Logic in Computer Systems; Wiley Interscience, 2004.
• C. Meinel and T. Theobald, Algorithms and Data Structures in VLSI Design: OBDD - Foundations and Applications, Springer, 1998.
• S. M. Mueller and W.J. Paul, Computer Architecture: Complexity and Correctness, Springer Verlag, 2000.
• Walter Oberschelp und Gottfried Vossen: Rechneraufbau und Rechnerstrukturen, Oldenbourg, 2006.
• B. Parhami, Computer Arithmetic - Algorithms and Hardware Designs, Oxford University Press, 2000.
• D.A. Patterson, J.L. Hennessy, Computer Organization Design - The Hardware Software Inferface, Morgan Kaufmann Publishers, 2014.
• Gerhard H. Schildt, Daniela Kahn, Christopher Kruegel, Christian Moerz: Einführung in die Technische Informatik, Springer, 2005.

None

None

## References to Course [INF-02-09-K-2]

Module Name Context
[INF-02-09-M-2] Digital Systems and Computer Architecture P: Obligatory 4V+2U, 8.0 LP
[INF-82-58ITI-M-2] Foundations of Technical Computer Science for "Informationstechnik/Informatik" P: Obligatory 4V+2U, 8.0 LP
[INF-82-58-M-2] Foundations of Technical Computer Science P: Obligatory 4V+2U, 8.0 LP