Angebotene Arbeiten

Bei Interesse an einer Bachelor oder Master Arbeit, einer Ingenieurs- oder Forschungspraxis oder einer Werkstudententätigkeit, können Sie sich auch direkt an unsere Doktoranden wenden. Es sind oftmals Themen in Vorbereitung, die hier noch nicht aufgelistet sind und es besteht die Möglichkeit ein Thema entsprechend Ihrer Interessenlage zu finden.
Bitte legen Sie jeder Bewerbung einen Lebenslauf sowie eine Liste der besuchten Lehrveranstaltungen bei.
Wenn Ihre Ingenieurspraxis vom Studiendekanat an einen unserer Professoren zugeteilt wurde, wenden Sie sich damit bitte an Frau Dorn (Raum N2401).

Bachelorarbeiten

Audio Information Transmission - Schuelerversuc

Audio Information Transmission - Schuelerversuc

Beschreibung

Digitale Kommunication ist fuer Schüler und angehende Studenten schwer fassbar. Aus diesem grund wollen wir didgitale Kommunikation erfahrbar - hörbar - machen. Ziel des Projekts ist der Aufbau einer Übertragungsstrecke mit allen Komponenten, die in Nachrichtentechnik 1 und 2 gelehrt werden und einer übertragenun mit Hilfe von Schallwellen. Die Demo soll nach Vollendung Schülern und Studenten vorgeführt werden.

Spezifische Projekte können mit den Betreuern besprochen werden.

Voraussetzungen

  • Gute Kenntnisse in C/C++ und-oder MATLAB
  • Interesse an Kommunikationssystemen
  • Selbsttändige Arbeitsweise

Betreuer:

Capacity Bounds for Time and Bandwidth Constraint Transmissions

Capacity Bounds for Time and Bandwidth Constraint Transmissions

Stichworte:
Energy concentration, Prolate Spheroidal Wave Functions, Sphere packing Bound, Sinc pulses, Raised Cosine Pulses

Beschreibung

In Shannon's paper [1], where the sphere packing bound is introduced, it is outlined how to calculate the finite block length capacity for a Gaussian channel if the required parameters are known. However, the transmit waveform is allowed to have infinite duration. We want to examine what happens when we introduce constraints on the energy concentration of the waveform, i.e., most of its energy is concentrated in a time interval T and a bandwidth W. The problem of the maximal energy concentration was solved in [2]. We want to find upper and lower bound for the finite block length capacity with these constraints.

 

[1] C. Shannon, "Probability of error for optimal codes in a Gaussian channel", The Bell System Technical Journal, 1959

[2] D. Slepian, H. O. Pollack, H. J. Landau, "Prolate Spheroidal Wave Functions, Fourier Analysis and Uncertainty I-V", The Bell System Technical Journal, 1961-1978

Voraussetzungen

  • Digital Communications, Digital Communications II
  • Information Theory
  • Python/MATLAB

Kontakt

delcho.donev@tum.de

Betreuer:

Delcho Donev

The Weight Enumerators of Product Codes

The Weight Enumerators of Product Codes

Stichworte:
weight enumerator, input-output weight enumerator, input-redundancy weight enumerator, distance spectrum

Beschreibung

For product codes (PCs), it is very easy to find the minimum distance and its multiplicity once those of the component codes are known. However, the characterization of its complete distance spectrum is a largely open problem even if those of the component codes are given. In [1], they provide a feasible method to compute the weight enumerators (WEs) of PCs where at least one component code is a single parity check (SPC) code. In addition, an extension to compute the exact input-output weight enumerator (IO-WE) for 2-dimensional PCs with SPC component codes and a lower bound for those with more dimensions are available in [2].

The student will understand the ideas presented there and develop a software to compute them efficiently.

References:

[1] http://ieeexplore.ieee.org/document/512606/

[2]  ttps://dspace.library.uvic.ca/bitstream/handle/1828/5487/Rankin_DavidM_EURASIPJAdvSignalProcess_2005.pdf?sequence=1&isAllowed=y

Voraussetzungen

Necessary:

  • Basics of channel coding
  • C++ (The applicant can suggest an alternative with a good reason)

Related Courses:

  • Channel Coding
  • Channel Codes for Iterative Decoding
  • Coding Theory for Storage and Networks

Kontakt

mustafa.coskun@tum.de

Betreuer:

Mustafa Coskun

Masterarbeiten

Analysis of Deep Neural Networks using Information Theory

Analysis of Deep Neural Networks using Information Theory

Beschreibung

The aim of this thesis is to take the recently introduced methods for explaining individual predictions of DNNs and adapt them to build statistical methods using information theoretic quantities that can help in understanding the internal functionality of the DNN. This can later be used to improve the performance of the DNN or to reduce the inference complexity by pruning the parts which do not play a significant role in the operation of DNN. 

The work will consist of both theory and experimentation. 

 

Voraussetzungen

- Basic knowledge information theory

- Basic knowledge of DNNs and their operation. 

Betreuer:

Two-way MIMO Communications

Two-way MIMO Communications

Stichworte:
MIMO, interactive communications, channel estimation

Beschreibung

Massive MIMO, or equipping a huge number of co-located antennas to a base station, has been considered as a key enabling technique for 5G to fulfill the high performance requirements in terms of spectral efficiency, energy efficiency, coverage, and reliability [Larsson2014 ]. We study massive MIMO on the frequency division duplexing (FDD) mode. MIMO FDD is one of the most challenging problems in the MIMO FDD, because the resource overhead is overwhelming with a conventional closed-loop channel estimation and feedback [Caire2010]. The project aims to take a fresh look at this difficult open problem. 

Let us consider two-way point-to-point MIMO FDD channels and assume that both nodes have M antennas each. W_1 to node 2 over the M * M channel H while node 2 wishes to convey a message W_2 over the M * M channel G. This model with FDD MIMO if into a special case of a two-way communication where both nodes share the same resource [Chapter 17.5, El2011]. Note that the two-way channel is used either to feedback the observations or to convey fresh information symbols. The amount of time needed for feedback depends on the size of the MIMO channels.   

Possible directions are:

  • Study achievable transmission strategies for the case of perfect channel. 
  • Characterize the capacity region. 

 

References

[Larsson2014] EG Larsson, O. Edfors, F. Tufvesson, and TL Marzetta, `` Massive MIMO for next generation wireless systems '', IEEE Communicaions Magazine, vol. 52, no. 2, pp. 186-195, 2014

[Caire2010] G. Caire, N. Jindal, M. Kobayashi, and N. Ravindran, `` Multiuser MIMO achievable rates with downlink training and channel state feedback '', IEEE Transactions on Information Theory, vol. 56, no. 6, pp. 2845-2866, 2010

[El2011] A. El Gamal and YH Kim, `` Network Information Theory '', Cambridge University Press, 2011 

Voraussetzungen

  • Basic knowledge of network information theory, signal processing, linear algebra. 
  • Matlab programming skills.

Kontakt

Prof. Mari Kobayashi 

Room: N406

mari.kobayashi@tum.de

Betreuer:

Mari Kobayashi

Unmanned Aerial Vehicle (UAV)-aided Cellular Networks

Unmanned Aerial Vehicle (UAV)-aided Cellular Networks

Stichworte:
UAV, multi-cell broadcast channel, relay channel, feedback

Beschreibung

Recently, UAVs (ie, known as drones) have recently been viewed as highly selective (see eg [Zeng2016]). 

Considering the network scenario depicted in Figure 1. One macro BS communicating with groups of users through relaying UAVs due to non-line of sight (NLoS) between the macro BS and each group of users. By assuming that the macro BS is equipped by radar, we consider a UAVs UAVs while estimating the channel state of each UAV. The channel estimation is performed by generalized feedback, ie a round-trip channel output available at the BS. The channel at hand to multi-cell broadcast channels with radar-aided backhaul links, or hierarchical downlink channels. Note that multi-cell broadcast channels have been extensively studied in literature (see [Gesbert2010] and references therein). In our setting, the BS-UAV backhaul link evolves in time due to mobility of UAVs.

 

Possible directions are:

  • For the case of a single and static relaying UAV, study relay strategies to maximize the network throughput. 
  • Study the tradeoff between the quality of channel estimation and the resulting network throughput. 
  • Generalize to the case of multiple static relaying UAVs or / and moving UAVs. 

 

This thesis can be done in collaboration with Prof. David Gesbert at EURECOM, Sophia-Antipolis, France. 

 

References

[Zeng2016] Y. Zeng, R. Zhang, TJ Lim, `` Wireless communications with unmanned aerial vehicles: opportunities and challenges '', IEEE Communications Magazine, vol. 54, no. 5, pp. 36-42, 2016

[Gesbert2010] D. Gesbert, S. Hanly, H. Huang, S. Shamai, O. Simeone, and W. Yu, `` Multi-cell MIMO Cooperative Networks: A New Look at Interference '', IEEE Journal on Selected Areas in Communications, vol. 28. no. 9, pp. 1380-1408, 2010.

Voraussetzungen

  • Basic knowledge of network information theory, signal processing. 
  • Matlab programming skills.

Kontakt

Prof. Mari Kobayashi 

Room: N406

mari.kobayashi@tum.de

Betreuer:

Mari Kobayashi

Waveform Design for Joint Radar and V2X Communication

Waveform Design for Joint Radar and V2X Communication

Stichworte:
waveform, radar, mutual information, state estimation

Beschreibung

The key-enabler of mobility-driven networks as well as vehicle-to-everything (V2X) communications is the ability to continuously track and react to the dynamically changing environment (hereafter called the network `` state ') while exchanging information with each other The same millimeter wave frequency bands are used as a radar and data communication system. One of the important tools for waveform design is to use the information theory to maximize the mutual information [Bell1993, Blum2007, Nehorai2007]. While these works focus on extracting the information on the state parameters (eg velocity or range) as much as possible, or equivalently decreasing the uncertainty, it is possible to convey a message to the receiver simultaneously. 

The objective is summarized below. 

  • Understand the seminal paper on the waveform design [Bell1993].
  • Adapt the waveform design to a joint sensing and communication system.
  • If time allows, extend the study to the multi-user case [Nehorai2007]

 

References

[Bell1993] MR Bell, `` Information Theory and radar waveform design '', IEEE Transactions on Information Theory, vol. 39, no. 5, pp. 1578--1597, 1993

[Blum2007] Y. Yang and RS Blum, `` MIMO radar waveform design based on mutual information and minimum mean-square error estimation '', IEEE Transactions on Aerospace and Electronic Systems, vol. 43, no. 1, 2007

[Nehorai2007] A. Leshem, O. Naparstek, and A. Nehorai, "Information theoretic adaptive radar waveform design for multiple extended targets", IEEE Journal of Selected Topics in Signal Processing, vol. 1, no. 1, pp. 42-55, 2007 

Voraussetzungen

  • Basic knowledge of information theory, signal processing, convex optimization. 
  • Matlab programming skills.

Kontakt

Prof. Mari Kobayashi

Room: N406

mari.kobayashi@tum.de

Betreuer:

Mari Kobayashi

Polar Coding with Non-Binary Kernels

Polar Coding with Non-Binary Kernels

Beschreibung

This thesis will focus on polar codes with non-binary kernels on GF(q). Some of the following tasks might be covered: 

  • Kernel selection
  • Decoder implementation
  • Efficient construction
  • Comparison of binary and non-binary polar codes

Voraussetzungen

  • Channel Coding
  • Information Theory
  • Matlab/C++

Betreuer:

Data Storage in DNA

Data Storage in DNA

Beschreibung

Encoding information into synthetic DNA is a novel approach for data storage. Due to its natural robustness and size in molecular dimensions, it can be used for long-term and very high-density archiving of data. Since the DNA molecules can be corrupted by thermal process and the writing/reading process of DNA molecules can be faulty, it is necessary to encode the data using error-correcting codes.
In this thesis, the student analyzes errors that occur in such a storage system and designs coding schemes that can be used for error correction.

Betreuer:

Adaptive List Decoding for Polar Codes

Adaptive List Decoding for Polar Codes

Beschreibung

The finite-length performance of polar codes can be improved by using successive cancellation list decoding. In this thesis, decoder design/implementation and performance prediction are investigated.

Voraussetzungen

  • Information Theory
  • Channel Coding
  • Channel Codes for Iterative Decoding
  • Matlab/C++

Betreuer:

Forschungspraxis oder MSCE Forschungspraxis

Capacity Bounds for Time and Bandwidth Constraint Transmissions

Capacity Bounds for Time and Bandwidth Constraint Transmissions

Stichworte:
Energy concentration, Prolate Spheroidal Wave Functions, Sphere packing Bound, Sinc pulses, Raised Cosine Pulses

Beschreibung

In Shannon's paper [1], where the sphere packing bound is introduced, it is outlined how to calculate the finite block length capacity for a Gaussian channel if the required parameters are known. However, the transmit waveform is allowed to have infinite duration. We want to examine what happens when we introduce constraints on the energy concentration of the waveform, i.e., most of its energy is concentrated in a time interval T and a bandwidth W. The problem of the maximal energy concentration was solved in [2]. We want to find upper and lower bound for the finite block length capacity with these constraints.

 

[1] C. Shannon, "Probability of error for optimal codes in a Gaussian channel", The Bell System Technical Journal, 1959

[2] D. Slepian, H. O. Pollack, H. J. Landau, "Prolate Spheroidal Wave Functions, Fourier Analysis and Uncertainty I-V", The Bell System Technical Journal, 1961-1978

Voraussetzungen

  • Digital Communications, Digital Communications II
  • Information Theory
  • Python/MATLAB

Kontakt

delcho.donev@tum.de

Betreuer:

Delcho Donev

Analysis of Deep Neural Networks using Information Theory

Analysis of Deep Neural Networks using Information Theory

Beschreibung

The aim of this thesis is to take the recently introduced methods for explaining individual predictions of DNNs and adapt them to build statistical methods using information theoretic quantities that can help in understanding the internal functionality of the DNN. This can later be used to improve the performance of the DNN or to reduce the inference complexity by pruning the parts which do not play a significant role in the operation of DNN. 

The work will consist of both theory and experimentation. 

 

Voraussetzungen

- Basic knowledge information theory

- Basic knowledge of DNNs and their operation. 

Betreuer:

The Weight Enumerators of Product Codes

The Weight Enumerators of Product Codes

Stichworte:
weight enumerator, input-output weight enumerator, input-redundancy weight enumerator, distance spectrum

Beschreibung

For product codes (PCs), it is very easy to find the minimum distance and its multiplicity once those of the component codes are known. However, the characterization of its complete distance spectrum is a largely open problem even if those of the component codes are given. In [1], they provide a feasible method to compute the weight enumerators (WEs) of PCs where at least one component code is a single parity check (SPC) code. In addition, an extension to compute the exact input-output weight enumerator (IO-WE) for 2-dimensional PCs with SPC component codes and a lower bound for those with more dimensions are available in [2].

The student will understand the ideas presented there and develop a software to compute them efficiently.

References:

[1] http://ieeexplore.ieee.org/document/512606/

[2]  ttps://dspace.library.uvic.ca/bitstream/handle/1828/5487/Rankin_DavidM_EURASIPJAdvSignalProcess_2005.pdf?sequence=1&isAllowed=y

Voraussetzungen

Necessary:

  • Basics of channel coding
  • C++ (The applicant can suggest an alternative with a good reason)

Related Courses:

  • Channel Coding
  • Channel Codes for Iterative Decoding
  • Coding Theory for Storage and Networks

Kontakt

mustafa.coskun@tum.de

Betreuer:

Mustafa Coskun

Ingenieurpraxis

Satellite Link - Channel channel Model

Satellite Link - Channel channel Model

Kurzbeschreibung:
Implementierung des DVBS-2 Satelliten Kanalmodells.

Beschreibung

Die Aufgabe des Studenten ist die implementierung des DVB-S2 Satelliten Kanalmodells in Matlab.

Im Satellitenbereich ist der Übertragungskanal durch Nichtlinearitäten der Verstärker gekennzeichnet. Die auftretenden Effekte wurden beschrieben und sollen in diser Arbeit in ein Kanalmodell implementiert werden.

 

Voraussetzungen

  • Grundlagenkenntnisse in MATLAB und C
  • Nachrichtentechnik 1
  • Interesse an Digitaler Datenübertragung und Signalverarbeitung
  • Selbstständiges Arbeiten.

Betreuer:

Audio Information Transmission - Schuelerversuc

Audio Information Transmission - Schuelerversuc

Beschreibung

Digitale Kommunication ist fuer Schüler und angehende Studenten schwer fassbar. Aus diesem grund wollen wir didgitale Kommunikation erfahrbar - hörbar - machen. Ziel des Projekts ist der Aufbau einer Übertragungsstrecke mit allen Komponenten, die in Nachrichtentechnik 1 und 2 gelehrt werden und einer übertragenun mit Hilfe von Schallwellen. Die Demo soll nach Vollendung Schülern und Studenten vorgeführt werden.

Spezifische Projekte können mit den Betreuern besprochen werden.

Voraussetzungen

  • Gute Kenntnisse in C/C++ und-oder MATLAB
  • Interesse an Kommunikationssystemen
  • Selbsttändige Arbeitsweise

Betreuer:

Capacity Bounds for Time and Bandwidth Constraint Transmissions

Capacity Bounds for Time and Bandwidth Constraint Transmissions

Stichworte:
Energy concentration, Prolate Spheroidal Wave Functions, Sphere packing Bound, Sinc pulses, Raised Cosine Pulses

Beschreibung

In Shannon's paper [1], where the sphere packing bound is introduced, it is outlined how to calculate the finite block length capacity for a Gaussian channel if the required parameters are known. However, the transmit waveform is allowed to have infinite duration. We want to examine what happens when we introduce constraints on the energy concentration of the waveform, i.e., most of its energy is concentrated in a time interval T and a bandwidth W. The problem of the maximal energy concentration was solved in [2]. We want to find upper and lower bound for the finite block length capacity with these constraints.

 

[1] C. Shannon, "Probability of error for optimal codes in a Gaussian channel", The Bell System Technical Journal, 1959

[2] D. Slepian, H. O. Pollack, H. J. Landau, "Prolate Spheroidal Wave Functions, Fourier Analysis and Uncertainty I-V", The Bell System Technical Journal, 1961-1978

Voraussetzungen

  • Digital Communications, Digital Communications II
  • Information Theory
  • Python/MATLAB

Kontakt

delcho.donev@tum.de

Betreuer:

Delcho Donev

The Weight Enumerators of Product Codes

The Weight Enumerators of Product Codes

Stichworte:
weight enumerator, input-output weight enumerator, input-redundancy weight enumerator, distance spectrum

Beschreibung

For product codes (PCs), it is very easy to find the minimum distance and its multiplicity once those of the component codes are known. However, the characterization of its complete distance spectrum is a largely open problem even if those of the component codes are given. In [1], they provide a feasible method to compute the weight enumerators (WEs) of PCs where at least one component code is a single parity check (SPC) code. In addition, an extension to compute the exact input-output weight enumerator (IO-WE) for 2-dimensional PCs with SPC component codes and a lower bound for those with more dimensions are available in [2].

The student will understand the ideas presented there and develop a software to compute them efficiently.

References:

[1] http://ieeexplore.ieee.org/document/512606/

[2]  ttps://dspace.library.uvic.ca/bitstream/handle/1828/5487/Rankin_DavidM_EURASIPJAdvSignalProcess_2005.pdf?sequence=1&isAllowed=y

Voraussetzungen

Necessary:

  • Basics of channel coding
  • C++ (The applicant can suggest an alternative with a good reason)

Related Courses:

  • Channel Coding
  • Channel Codes for Iterative Decoding
  • Coding Theory for Storage and Networks

Kontakt

mustafa.coskun@tum.de

Betreuer:

Mustafa Coskun