Coding and Algorithms for Memories
| Lecturer (assistant) | |
|---|---|
| Number | 0000000229 |
| Type | lecture with integrated exercises |
| Duration | 3 SWS |
| Term | Sommersemester 2022 |
| Language of instruction | English |
| Position within curricula | See TUMonline |
| Dates | See TUMonline |
- 25.04.2022 16:45-18:15 N2409, Seminarraum , Lecture
- 28.04.2022 15:00-16:30 N2409, Seminarraum , Tutorial
- 02.05.2022 16:45-18:15 N2409, Seminarraum , Lecture
- 05.05.2022 15:00-16:30 N2409, Seminarraum , Tutorial
- 09.05.2022 16:45-18:15 N2409, Seminarraum , Lecture
- 12.05.2022 15:00-16:30 N2409, Seminarraum , Tutorial
- 16.05.2022 16:45-18:15 N2409, Seminarraum , Lecture
- 19.05.2022 15:00-16:30 N2409, Seminarraum , Tutorial
- 23.05.2022 16:45-18:15 N2409, Seminarraum , Lecture
- 30.05.2022 16:45-18:15 N2409, Seminarraum , Lecture
- 02.06.2022 15:00-16:30 N2409, Seminarraum , Tutorial
- 09.06.2022 15:00-16:30 N2409, Seminarraum , Tutorial
- 13.06.2022 16:45-18:15 N2409, Seminarraum , Lecture
- 20.06.2022 16:45-18:15 N2409, Seminarraum , Lecture
- 23.06.2022 15:00-16:30 Online: Videokonferenz / Zoom etc.
- 27.06.2022 16:45-18:15 N2409, Seminarraum , Lecture
- 30.06.2022 15:00-16:30 N2409, Seminarraum , Tutorial
- 04.07.2022 16:45-18:15 N2409, Seminarraum , Lecture
- 07.07.2022 15:00-16:30 N2409, Seminarraum , Tutorial
- 11.07.2022 16:45-18:15 N2409, Seminarraum , Lecture
- 14.07.2022 15:00-16:30 N2409, Seminarraum , Tutorial
- 18.07.2022 16:45-18:15 N2409, Seminarraum , Lecture
- 21.07.2022 15:00-16:30 N2409, Seminarraum , Tutorial
- 25.07.2022 16:45-18:15 N2409, Seminarraum , Lecture
- 28.07.2022 15:00-16:30 N2409, Seminarraum , Tutorial
Admission information
Objectives
This course will address the study of memories from their physics, architecture, information, coding, and systems perspectives. The focus will be given for coding and algorithms for the management of memories and data storage. The focus will be mainly given to the study of non-volatile memories such as hard disk drives, flash memories, phase-change memories, and DNA storage.
Description
This course deals with coding and algorithms for memories and data storage systems. The following topics will be studied in the course.
* Write-once memory: capacity and code constructions.
* Solids-state drives: Architecture, write amplification, and management algorithms.
* Stuck-at cells: code constructions and bounds.
* Constrained codes: Knuth's balancing algorithm, run-length limited codes, two-dimensional constrained codes.
* Permutations: codes and bounds for the Kendall's tau metric.
* The generalized sphere packing bound
* Reconstructions: codes and algorithms
* Insertions and deletions: codes and balls size analysis
* Write-once memory: capacity and code constructions.
* Solids-state drives: Architecture, write amplification, and management algorithms.
* Stuck-at cells: code constructions and bounds.
* Constrained codes: Knuth's balancing algorithm, run-length limited codes, two-dimensional constrained codes.
* Permutations: codes and bounds for the Kendall's tau metric.
* The generalized sphere packing bound
* Reconstructions: codes and algorithms
* Insertions and deletions: codes and balls size analysis
Prerequisites
Linear algebra
Teaching and learning methods
Lecture: The fundamental theoretical contents are presented in the lecture by a slide presentation and a virtual board via zoom and will be illustrated with examples. Students are encouraged to ask questions and discuss the topics of the lecture.
Tutorial: In an accompanying tutorial, the contents of the lecture are applied to examples.
Tutorial: In an accompanying tutorial, the contents of the lecture are applied to examples.