# Approximate Computing

**Lecturers:**

### Module description:

Approximate Computing and

Exercises to Approximate Computing

**Lecture, location, and time:**

Thursday, 14:15 – 15:45 h. Room 02.112.128 Registration on StudOn

**The first lecture will take place on Thursday 28.04.2022 at 14:15 hrs.**

**Exercises, location, and time**:

Tuesday, 10:00 – 12:00 h Room 02.133-128 (Chetana Pradhan, Pierre-Louis Sixdenier)

**The first exercise will take place on Tuesday 03.05.2022 at 10:00 hrs.**

### Course (slides, exercises, other files):

All important documents can be found in StudOn

#### Introduction:

Approximate Computing denotes a quite young research area that exploits the fact and capability of many applications and systems to tolerate imprecision and/or inexactness of computed results. Prominent areas of applications and novel techniques of computing approximate rather than exact results have brought up new implementations either at hardware and/or software levels for important emergent workloads such as searching, mining, image processing, and data retrieval.

Although hardware technology is improving at a fast pace, energy and power are becoming more and more important constraints apart from exactly computing results in an acceptable amount of time. The main goals of approximate computing techniques are therefore to exploit the possible trade-off between power/energy consumption, accuracy, performance, and/or cost, e.g., utilized hardware resources.

#### Course purpose:

#### Course content:

The following topics will be covered:

**Introduction to Approximate Computing****Challenges****Approximate Arithmetics****Approximate Algorithms****Applications**

Approximate computing is a lecture on a 4 SWS (4 hours/week) basis. Lecture and Exercises will give 5 ECTS.

#### Resources:

Approximate Computing: An Emerging Paradigm For Energy-Efficient Design

Approximate Computing: A Survey