Persönlicher Status und Werkzeuge

Open Theses

You may also contact one of our doctoral candidates directly, if you are interested in a Bachelor or Master thesis, a student job, an "Ingenieurspraxis" or a "Forschungspraxis". It often happens, that topics are being prepared which are not adverdised yet. It may also be possible to find a topic matching your specific interests.
Please include a curriculum vitae together with a list of attended courses when applying for a thesis.
If your "Ingenieurspraxis" is selected to be supervised by one of our professors, please hand in the documents to Doris Dorn (Room N2401).

Master/Diploma Theses


A Deterministic Approach to the Gaussian Multiple-Input Multiple-Output (MIMO) Broadcast Channel
Multi-user communication systems (such as wireless systems) are different than point to point channels in two key aspects; namely, the broadcast nature of transmissions (e.g., wireless transmissions can be picked up by any receiver in the vicinity of the transmitter) and the superposition (e.g., a wireless receiver picks up a linear combination of transmissions from all transmitters in its vicinity). Recently a deterministic approach to multi-user information theory has proved promising by achieving progress in some of the long-standing open problems by finding approximate solutions. The idea behind a deterministic approach, on a high level, is to focus on the interaction of signals rather than the background noise, through a simpler appropriate model; find exact solutions for the simpler model; and then translate the intuitions and techniques to new techniques and/or approximate solutions on noisy models.
The goal of thesis is to undertake a deterministic approach to Gaussian MIMO broadcast channels.
Prerequisite: Linear Algebra, Information Theory
Supervisor: Shirin Saeedi

Role of Feedback in Broadcasting
This project intends to investigate the role of feedback in broadcast channels. More information available upon request. Pre-requisite (at least one of the following):
Basic knowledge of Network Coding (see [2])
Basic knowledge of Algorithms
Basic knowledge of Information Theory
Supervisor: Shirin Saeedi

Ingenieurspraxis


Weiterentwicklung des Netzwerkanalyse Tools mit Schwerpunkt auf Testcases
Supervisor: Gerhard Kramer, Fa. Infineon Technologies AG, Neubiberg, Hr. B. Lippmann

Open Student Jobs

no news in this list.

Theses in Progress

Bachelor Theses


Firat Beytemür: Implementation of a ADS-B Receiver

Automatic dependent surveillance-broadcast (ADS-B) is a technology in which an aircraft determines its position via satellite navigation and periodically broadcasts it, enabling it to be tracked. In this work, the student should understand the basics of this technology and implements a receiver to decode ADS-B signals.

ADS-B signals are transmitted over a carrier at 1090MHz with a bandwith of about 50kHz. These signals can be easily received with the software-defined radio (SDR) equipment we have at our institute and can be processed with standard computer equipment. The tasks for this work can be summarized as follows:

  • Understanding the basics of the ADS-B technology.
  • Learning the basics of software-defined radio concept.
  • Baseband processing of the ADS-B signals (estimation, synchronization, etc.)
  • Decoding of the information included in the ADS-B frames.
  • Implementation of a graphical user interface
Supervisor: Onurcan İşcan, Andrei Nedelcu

Arda Can Özensoy: How many cars can YOU park?
Alfred Renyi wrote a curious paper in the late 1950s: He assumed an infinitely parking lane and placed cars, all equally long, randomly on this lane. He found out that you cannot even use 75% of the available parking space [1]!
But I bet you can do better by a more realistic model: Assume cars are between 3 and 6 meters long, and assume that if a car arrives at the parking lane, it will take the first free parking slot (into which it fits). Cars arrive and leave randomly and independently.
The first part of the Bachelor's project is to write a Matlab simulation and determine the efficiency of this parking scheme. Besides some knowledge in Matlab, for this task you should know a little bit about stochastic processes and random variables. The second part involves a literature survey, where you shall find out how this parking/packing problem connects with communications engineering (e.g., code design, communication networks, etc.).

[1]: Renyi's Parking Constant on Wolfram Mathworld (with illustration)
Supervisor: Bernhard Geiger

Hiba Arnout: Implementation of an Efficient Lumping Algorithm
In 2003, Derisavi, Hermanns, and Sanders proposed an efficient algorithm to detect the coarsest partition of the state space, w.r.t. which a given Markov chain is lumpable. The algorithm is based on splitting a set of states which violates the conditions for lumpability into sets which satisfy them; it is shown to have a computational complexity of O(m log n), where n is the number of states of the Markov chain and m the number of transitions (i.e., the number of nonzero entries of its transition probabilities matrix).

The task of the project is to implement this algorithm in a modular way, such that the condition for lumpability can be exchanged by either information-theoretic criteria or by criteria for quasi-lumpability. Finally, a series of experiments should verify the functionality of the algorithm and assess whether a this splitting method can effectively detect a quasi-lumpable partition.
Supervisor: Bernhard Geiger

Stephanie Dangl: A Soft-Information Model for Random Linear Network Coding
Random Linear Network Coding (RLNC) is a powerful approach to achieve the capacity in multicast networks. Subspace codes are an efficient family of error correction codes in RLNC. The idea behind these codes is to map information on a subspace and to transmit a basis for this subspace. In this thesis, a model incorporating soft-information (reliability information) of the received packets (basis vectors) using a linear inner code is considered. First the student should become familiar with linear block codes (e.g BCH, Reed--Solomon codes), concatenated coding schemes and the basics of Generalized Minimum Distance (GMD) decoding. In the next step, suitable inner codes to acquire the reliability information of the received packets should be chosen and implemented in MATLAB. The performance of the coding schemes should be evaluated and compared by performing simulations in MATLAB.
Supervisor: Hannes Bartz, Dr. Vladimir Sidorenko

Franziska Pöller: Hybrid Beamforming for Massive MIMO

Supplying each antenna of a massive IMO base array with an individual radio-frequency (RFC) chain may not be possible due to cost or space constraints. An RFC-chain includes e.g. a digital-to-analog converter and an power amplifier. Hybrid beamforming is a well-known concept which requires less RFC-chains. Digital beamforming with less RFC-chains is followed by analog beamforming. The analog beamforming is realized by phase-shifters, which are cheap compared to full RFC-chains.

The student should implement a an algorithm which determines the hybrid beamforming weights. The optimal number of RFC-chains and phase shifters should be determined. The student may then improve the algorithm.

Supervisor: Stefan Dierks, Markus Jäger

Said Ben Bouzid: Antenna Selection in Massve MIMO

Supplying each antenna of a massive MIMO base array with an individual radio-frequency (RF) chain may not be possible due to cost or space constraints. An RF-chain includes e.g. a digital-to-analog converter and an power amplifier. Instead of using all antennas for a transmission it is possible to select a subset of the available antennas so as to reduce the number of radio frequency (RF) chains. This strategy is called antenna selection.

The student should implement an algorithm which determines the set of selected antennas based on information theoretic results. The student should determine the optimal number of RF-chains depending on the channel conditions. The student may extend the algorithm, possibly to a broadcast channel scenario.

Supervisor: Markus Jäger, Stefan Dierks

Torsten Ohlenforst: Generierung eines AES67 Audiostreams aus Audiokanälen auf einer Embedded Plattform
Es soll ein Systems aufgebaut werden, mit welchem es möglich ist aus Audiokanälen einen Audio-Stream zu generieren, welcher die Anforderungen von AES67 erfüllt und einen solchen auch wieder in Audiokanäle wandeln kann. Hierzu soll eine Embedded Plattform unter Linux genutzt werden.
Supervisor: Tobias Fehenberger, Dipl.-Ing. Helmut Scholz, Dipl.-Ing. Christian Muschelknautz

Master/Diploma Theses


Zhaoqi Zhu: Preamble-based Channel Estimation in Coherent Spatial Division Multiplexing OFDM Transmission System
The robustness of the channel estimation is a key for coherent spatial division multiplexing OFDM transmission system. Time-multiplex(TM) preamble structure has been widely adopted in the polarisation division multiplexing OFDM transmission and in the scenario of spatial division multiplexing OFDM transmission supporting 3 spatial modes. When scaling to higher number of spatial modes, the TM based channel estimation introduces huge overhead and is sensitive to laser phase noise. Therefore, subcarrier-orthogonal(SO) preamble structure is a potential candidate for channel estimation. In this work, the TM and SO preamble-based channel estimation will be investigated under the influence of laser phase noise, mode-dependent loss and strong/weak coupling regime of the few mode fiber.
Supervisor: Yingkan Chen

Stefan Thiel: Analysis of AM Demodulation in Speech-based Airborne Communications Under Multipath Propagation
This master thesis is in cooperation with the radio communications department at Rohde&Schwarz. Airborne radio communication is based on Amplitude Modulation (AM). To use them with existing low-directivity antennas in airplanes, the effects of multipath propagation have to be considered. The student will investigate the channel effects on airborne communications (Ground-Air, Air-Air) and compare possible receiver designs. For this aim, realistic multipath-propagation scenarios will be defined for airborne communications. The models and the suggested designs will be tested with Matlab/Simulink. The student will evaluate the results and compare multiple techniques to improve communication quality.
Supervisor: Onur Günlü, Dipl.-Ing. Ludger Korsmeier and Dipl.-Ing. Michael Gerth (Rohde&Schwarz)

Li Chen: Aggregation Methods for Markov Chains
The purpose of this thesis is to investigate state space aggregation methods using information-theoretic cost function. The main cost functions investigated shall be the I(Y_1;Y_2) and H(Y_2|Y_1) - H(Y_2|X_1). The former, which should be maximized, is related to information-theoretic clustering and to near complete decomposability of Markov chains. The latter, which should be minimized, is related to lumpability, the phenomenon of a function of a Markov chain being Markov. Both cost functions should be optimized over all possible partitions of the state space, which is a combinatorial problem.

In order to reduce the computational complexity of the search, sub-optimal aggregation methods shall be adopted from the literature: Agglomerative, sequential, or splitting methods shall be investigated. Furthermore, it is interesting to see if a relaxation of the cost functions admits the application of established algorithms, like the information bottleneck method.

The aggregation methods shall be evaluated at the hand of a few examples, e.g., quasi-lumpable and nearly completely decomposable Markov chains, examples from natural language processing or synthetic biology, and the Ehrenfest diffusion model.
Supervisor: Bernhard Geiger

QIPING SHAO: OFDM and FBMC
Supervisor: Patrick Schulte

Peihong Yuan: Rate-adaptive Coded Modulation for low SNRs
Supervisor: Markus Stinner

Anastasios Dimas: Peeling Decoding Analysis of Non-binary LDPC Codes
The performance of non-binary LDPC (NB-LDPC) codes on the binary erasure channel (BEC) is analyzed. Existing analysis tools of their binary counterparts are extended for NB-LDPC codes. Therefore, the binary extension of the NB-LDPC codes is constructed and its behaviour is investigated analytically.
Supervisor: Markus Stinner

Arun sattanathan Gothandaraman : Firmware development and testing for Optical communication transceivers
Tasks & Responsibilities: - Architect, design, code, debug, test and document new/existing designs with a major focus on the embedded hardware elements of the design - Work to minimize the need for third party development resources bringing into balance in-house vs. outsourced services - Collaborate with HW designers on the selection of components for new designs where applicable - Develop test procedures and support design of test and design qualification systems- - Provide documentation of all designs
Supervisor: Norbert Hanik, Julio Ramirez (DLR)

Frank Löw: Identifikation, Development, and Simulation of Protocol Concepts for a Battery-Driven Backbone-Router
The aim of this thesis is to develop low-power protocols for a multi-hop backbone network in a wireless sensor network.
Supervisor: Youlong Wu, Shirin Saeedi, Hekatron Vetriebs GmbH, Philipp Alber

Ingenieurspraxis


Dominik Fienko: Integration BS2000 SE Serie in Enterprise System Management
Supervisor: Gerhard Kramer, Fa. Fujitsu Technology Solutions, PDG ES S SWE 057, München

Mahmoud Marcam Helmy: Erstellung einer App für Smartphones der BITS mobile ERP Linie auf Basis von IOS Plattformen
Supervisor: Gerhard Kramer, BITS better it solutions GmbH, Wallenmahd 47, A-6850 Dornbirn

Alexander Jesipow: Durchführung von manuellen und automatisierten Testprozeduren mit ALEXA und AMIRA Filmkameras
Supervisor: Fa. ARRI,München, Hr. O. Gonschorekt

Mohamed Salah Ben Slimen : SDR - Digital Modulation Real Time Receiver in Simulink

Software Defined Radio is a relatively new concept in thinking and designing communications systems. What defines it is that almost all parts of a transciever (transmitter/receiver) are implemented as software modules on a general purpose computer, rather than on dedicated hardware. The radio frequency part of the receiver is thus also reconfigurable through software and will represent just an interface.

Simulink is a graphical programming tool from Mathworks and is especially good for fast prototyping and simulating of complex systems. It provides many custom made software modules and light and easy way to set up graphical user interfaces.

The purpose of this project is that following the principles of SDR radio and the facilities offered by Matlab/Simulink you could build a real-time receiver for digital modulated transmissions. Links:

http://en.wikipedia.org/wiki/Software-defined_radio

http://en.wikipedia.org/wiki/Digital_Audio_Broadcasting

http://de.mathworks.com/products/simulink/

Supervisor: Andrei Nedelcu

Nawel Attia: Nonlinear Error Correction Codes for Erasure Channels: Sudoku
Supervisor: Patrick Schulte

Lei Zhang: Optimierung und Qualitätssicherung des Vodafone GSM-, UMTS- und LTE-Mobilfunknetzes
Supervisor: Norbert Hanik, Fa. Vodafon e GmbH, München, Hr. Quicel

Hasan Yagiz Özkan: Image Tracking Algorithm Development
Supervisor: Gerhard Kramer, Fa. Bases Teknoloji Arge Sanay, Hr. T. Cirak, Istanbul

Forschungspraxis (12 ECTS)


Atif Javed: GSM and 3G CCS7 signaling and roamaing platforms
a) Understanding GSM and 3G network architectures. b) Literature review of CCS7 protocol. c) Perform basic configurations on following roaming platforms. d) Analyzing and troubleshooting customer problems for International Roaming services e) Coordination and implementation of IREG testing with International Roaming partners
Supervisor: Andrei Nedelcu, Lutz Förster

Andreas Lang: Implementing the Split-Step Fourier Method
The Nonlinear Schrödinger Equation (NLSE) is a nonlinear partial differential equation that describes the propagation of light in a nonlinear optical fiber. Since there is no closed-form solution to the NLSE, numerical methods are used to approximately solve it. The most popular among these methods is the split-step Fourier method (SSFM). The student’s task in this Forschungspraxis/Ingenieurspraxis is to implement the SSFM in Matlab-Enabled C (mex) with CUDA support.
Supervisor: Tobias Fehenberger

Yuchen Wu: Using Information Theory to Quantify Sudoku Difficulty
Sudoku games come in many difficulties; those with many clues are in general easier to solve than those with few clues. But is this a rule without exception? Or are there Sudokus with, say, 40 clues which are more complicated to solve than some Sudokus with 35 clues? If this is true, the number of clues is not a good measure of difficulty. Many other difficulty metrics depend on the runtime of a given solver, and hence depend on the implementation or the solving algorithm.
In this Forschungspraxis, the following assumption is made: Sudokus are easy to solve if the clues are highly redundant. And redundancy can be measured (or estimated) using information theory (see [1] and the references therein). There are already first attempts at information-theoretic difficulty ratings [2], and recently Sudoku puzzles have been considered as a method of coding for erasure channels [3]. The goal of this Forschungspraxis is to survey the existing literature, implement an information-theoretic difficulty rating and compare it to other, existing algorithm-based difficulty ratings. In the ideal case you will even find a new method to rate Sudokus, or you might discover a strong connection between difficulty ratings and parameters of Sudoku codes. In any case, this is a Forschungspraxis you can talk about at a student's party!

[1]: Griffith and Ho, "Quantifying Redundant Information in Predicting a Target Random Variable"
[2]: When Sudoku come across Information Theory
[3]: Atkins and Sayir, "Density Evolution for SUDOKU codes on the Erasure Channel"
Supervisor: Bernhard Geiger, Ali Amjad

Onur Ayan: Automated test and software processes for radio controllers
Tasks during the internship: _ Expansion of the software update process for the new radio controller _ Automated test program for different TX-datarates of the radios
Supervisor: Andrei Nedelcu, Stefan Bayer,Peter Eberl

Mustafa Cemil Coşkun: Staircase Codes for Optical Communications
Staircase codes are a relatively new class of algebraic channel codes for high-speed optical communications. Their large coding gains and reasonable decoding complexity have made them a promising option for data rates of 100 Gbit/s and more. The student's task of this Forschungspraxis is to understand the concept of staircase codes and implement them in Matlab or C.
Supervisor: Tobias Fehenberger, Georg Böcherer