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).
Bachelor or Master Theses
|Development of a powerline communication PHY layer and channel simulator|
|The task of the (OSI) PHY layer in a communications system is the physical transmission of data. At the transmitter side, the PHY accepts packets from the MAC layer and transmits them to the receiver. At the destination, the PHY receives the data and passes the packet to the MAC layer of that device. The student's task is to build a MATLAB simulator which takes packets from transmitters and delivers them to receivers. It has to drop and delay some packets with respect to different criteria. The connection to transmitters and receivers (clients) has to be done through D-Bus over the MATLAB Mex interface. Prerequisites: Good programming skills, digital communications and basic knowledge about Linux.|
|Supervisor: Karl-Tasnad Kernetzky|
|Development of a hardware powerline channel emulator|
|The channel characteristics for powerline communications can be considered quite harsh. Plenty of interfering devices, different kinds of noise, high attenuation and signal reflections disturb communication. In order to test powerline modems, there has to be a reliable and reproducible way of disturbing signals. The student's task is to build a hardware channel emulator which is controllable over Ethernet. The attenuation, different noise sources and filters should be included in the device. Prerequisites: Some programming skills, digital communications.|
|Supervisor: Karl-Tasnad Kernetzky|
|MIMO Multiport Communications|
|The topic of the thesis is to develop a simulator for MIMO communications including the transmit and receive RF frontends of a single user link. The simulator should be able to support different types of antenna elements and array configurations as well as matching circuits and amplifier models. In addition it should be able to estimate rates of communication over deterministic and stochastic channels.|
|Supervisor: Andrei Nedelcu|
|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 )
Basic knowledge of Algorithms
Basic knowledge of Information Theory
|Supervisor: Shirin Saeedi|
|Bayesian inference and tracking techniques for non-Lorentzian lineshape optical sources|
Objectives of the project
|Supervisor: Luca Barletta, Darko Zibar (DTU)|
|Modulation and Channel Coding|
Scope:I offer master thesis topics in the area of modulation, signaling and channel coding. The goal is to design transmission schemes for reliable communication close to the theoretical limits. We consider wireless, optical and wired communication channels and take power, bandwidth, and latency constraints into account.
Prerequisites: you should have attended one or more of the following courses: Information Theory, Channel Coding, Coded Modulation, Channel Codes for Iterative Decoding.
Start: October 1st.
|Supervisor: Georg Böcherer|
|I offer bachelor and master thesis topics in the area of information theory. The goal is to understand the fundamental limits of communications systems. Please contact me if you are interested.|
|Supervisor: Roy Timo|
|Code Design for Secrecy|
The thesis consists of code design for security primitives with given channel parameters, desired block lengths and BERs.
Prerequisites: Channel Coding lecture is necessary, any other advanced channel coding lecture is a plus.
|Supervisor: Onur Günlü|
|Probabilistic Signal Shaping for Short-Reach Optical Fiber Systems|
|Optical fiber systems form the backbone of the internet. Despite their large usable bandwidth, they are going to running out of capacity due to an increasing demand for services such as high-definition video streaming. In order to obtain the largest possible transmission rates for a fixed link, a non-uniformly spaced input can replace the common uniform input. Prerequisites for this thesis: digital communications (must!), basics in optical communication systems (important), information theory (equally important). If you are interested in this work, please contact me at firstname.lastname@example.org to set up a personal meeting.|
|Supervisor: Tobias Fehenberger|
|Efficient Algebraic Decoding of Subspace Codes for Network Coding|
|Subspace codes were proposed by Kötter and Kschischang in 2008 for error control in random linear network coding (RLNC). The main idea is to encode information by the choice of a subspace rather than a choice of a vector. A basis for the selected subspace is then transmitted over a channel. The decoder returns the subspace that is closest to the received subspace according to some metric.
I offer topics on efficient (list and unique) decoding algorithms for subspace and rank-metric codes that allow to correct errors beyond the unique decoding radius.
You should be interested in Channel Coding and should have good knowledge in (linear) Algebra.
|Supervisor: Hannes Bartz|
|Blind Digital Signal Processing of Probabilistically Shaped QAM Constellations for Coherent Optical Communication Systems|
This project will be carried out in part at the Technical University of Munich (TUM), Institute for Communications Engineering, and in part at the Technical University of Denmark, Department of Photonics Engineering (DTU Fotonik).• Requirement: Master student of TUM or DTU
• Duration: 6 months fulltime
• Contact TUM: Prof. Gerhard Kramer email@example.com
• Contact DTU: Prof. Søren Forchhammer firstname.lastname@example.org
Coded modulation is a technique to match the communication system to the communication channel. In this study the focus is on shaping the symbol probabilities in a QAM system for optical communication to achieve high spectral efficiency. In  efficient probabilistic shaping was used in an ASK system and analyzed and simulated for the AWGN channel. Numerical fiber simulations have shown that shaping improves the BER at a fixed distance in comparison to uniformly distributed signaling  or enables increased transmission distances . Recent experiments demonstrate large increases in reach  and transceiver sensitivity  of shaped inputs over uniformly distributed signaling. In , the digital signal processing (DSP) contains a data-aided equalization stage. In , a novel radius-directed equalization scheme that takes into account the probability of the QAM rings was used. Both approaches suggest that the blind equalisation schemes originally designed for uniform signaling must be adapted for probabilistic signaling.Objectives
The objective of the project is to study digital signal processing, in particular equalization, for probabilistically shaped QAM for an optical channel. As a starting point, the fiber channel is modelled by an AWGN channel with continuous polarization rotations at a fixed frequency. For this channel model and shaped QAM input, equalization schemes are studied. In a second stage, numerical fiber simulations via the split-step Fourier method are used to verify the performance of the new equalization schemes. Lastly, experimental measurements are carried out to test the equalization in a real setup. The experimental part is carried out in the laboratory of DTU Fotonik.Literature
 G. Böcherer, P. Schulte, and F. Steiner, “Bandwidth efficient and rate-matched low-density parity-check coded modulation,” IEEE Trans. Commun. (to appear), 2015.
|Supervisor: Gerhard Kramer, Tobias Fehenberger, Prof. Søren Forchhammer|
|Rate-Distortion Theory for Sparse Sources|
|Rate-Distortion Theory for Sparse Sources
This project investigates information theory limits for the lossy compression of sparse sources.
Motivated by the recent mathematical theory Compressed Sensing that deals with the efficient acquisition and reconstruction of sparse signals, we try to determine the fundamental limits of digitally storing data created by such sources.
A sparse source emits a string of symbols of which - loosely speaking - only a few contain information. There are different ways to model these sources. An example is the Gaussian spike source which emits a Gaussian symbol with probability p and a zero with probability 1-p.
Possible directions of a project are:
- Investigating different source models
- (Numerically) determining the rate distortion function of a sparse source
- Computing finite length performance bounds for sparse sources
- Information Theory (must)
- Pleasure with mathematics (must)
- Multiuser information theory (beneficial)
|Supervisor: Lars Palzer|
Theses in Progress
|Mohamed Aziz Ben Slimane: DVB-T transmission with GNURadio and USRP|
|The main purpose is to set up a standard compliant DVB-T transmitter in software (GNU-Radio) that can be used to broadcast a webcam signal via USRP. The receiver will consist of a commercially available USB Dongle. The transmitter should be designed to support different codecs as well as different code and modulation schemes that are standard compliant. It should also allow the injection of a virtual channel (including noise, frequency and phase offsets) to test the adaptability of the transmission scheme.|
|Supervisor: Andrei Nedelcu|
|Tobit Klug: Modelling and Mitigation of impulsive noise in PLC transmission system|
|Supervisor: Elisabeth Oberleithner|
|Andrea Nicholas Beretta: Funktionale Absicherung der Informations- und Kommunikationssysteme (I&K) im Automotive Umfeld für verschiedene Funktionen|
|Supervisor: Gerhard Kramer, Fa. Telemotive AG, Frankfurter Ring 115a. 80807 München|
|Jun Jian Tay: Performance Analysis of Regular and Spatially Coupled LDPC Codes|
|Spatially coupled (SC-) LDPC codes are known to reach capacity. Yet, it is unknown what the advantages in the finite-length regime are. The task of the student is to compare coupled LDPC codes with their underlying counterpart for finite code lengths using finite-length scaling laws and to verify the results by simulations.|
|Supervisor: Markus Stinner|
|Muhammed Efe: Candy Crush Codes|
|Candy Crush Codes  are a stupid idea for non-linear block codes whose constraints are taken from the game rules of Candy Crush Saga. Although the codes themselves will not be "good" in a communication-theoretic sense, they are at least interesting in their combinatorial properties or for didactic reasons. Moreover, even though the first step will be to look at block codes, it should be possible to encode and decode also sequentially, essentially admitting infinite blocklengths.
This research internship should investigate the code's combinatorial properties (i.e., rate as function of field size and candy flavors), en- and decoding schemes, error probabilities for M-ary symmetric channels, and, if possible, improve code design such that the codes become useful (e.g., have a guaranteed Hamming distance). At the basis of all these investigations is of course a detailed literature survey of nonlinear codes with two-dimensional constraints.
: Blog Post
|Supervisor: Bernhard Geiger, Andrei Nedelcu, Luca Barletta|
|Alberto Diago Gallardo : Atmospheric Influence on Free Space Optical Communications|
|The work is based on Free Space Optical (FSO) communications and will include the following parts: • Case Study: Ground-to-Ground laser Links: o Link budget calculations; (Done) o Tracking Power budget calculations; o Scintillation analysis (optional: atmospheric simulations and fade statistics); (Ongoing) o Atmospheric Attenuation: Link availability calculations. (Ongoing) • Support the design, integration of testing of the “Frame-Steering Concept” as a demonstrator terminal for static links. (Ongoing) • Outdoor link demonstration and measurement campaign. • Analysis and evaluation of the measurement data.|
|Supervisor: Norbert Hanik, Luis Martin Navajas|
|Daniel Külzer: Interference Coordination in a Local Area Scenario|
The performance of current cellular networks is degraded by interference between neighboring cells (so called inter-cell interference). It can be improved if the base stations share the channel state information of the useful and interfering links. With this information the base stations can coordinate their transmission strategies. This is called interference coordination.
One form of interference coordination is large-scale MIMO. For many antennas at each base station it is possible to null the interference caused to other users, while serving the users associated to the base station.
The student should implement large-scale MIMO and compare it to network MIMO in a local area scenario.
Prerequisite: Linear Algebra, Digital Communications (Nachrichtentechnik)
|Supervisor: Stefan Dierks|
|Frank Löw: Identification, 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|
|Boxiao Ma: Multipath Assisted Positioning: Mapping of Virtual Transmitters|
|Positioning is one of the most important fields of application for wireless radio transmissions. In critical environments, such as urban canyon or indoors, the position accuracy using wireless signals is drastically reduced. In these environments, multipath effects, low received signal power and non-line-of-sight propagation reduce the position accuracy. With Channel-SLAM, we proposed a paradigm shift in how to process the received signal in order to provide accurate position estimation for mobile receivers: rather than mitigating multipath, we propose to exploit multipath. Channel-SLAM treats multipath components as signals emitted from virtual transmitters which are time synchronized to the physical transmitter and static in their position. Hence, multipath propagation increases the number of transmitter by virtual transmitters resulting in more accurate position estimation or enabling positioning in situations where the number of physical transmitters is insufficient. Channel-SLAM estimates the receiver position and the positions of the virtual transmitters simultaneously and does not require any prior information such as room-layout or a database for fingerprinting. This Master thesis builds on and extends the previous work on Channel-SLAM. In order to exploit multipath components for multiple receivers, this Master thesis shall derive a mapping algorithm for virtual transmitters. The positions of virtual transmitters do not change over time, however, the virtual transmitters are only visible in a certain area. Hence, each virtual transmitter can be described by a static position and a visibility region. Thus, this master thesis shall derive a representation of the visibility region of virtual transmitters and shall extend the current Channel-SLAM approach. Additionally, the results should be verified by simulations and measurements. The results might give valuable geometric information on the locations of reflector and scatterers, which might enable to obtain geometric information of all kinds of environments by using wireless signals.|
|Supervisor: Norbert Hanik, Christian Gentner (DLR)|
|Yuchen Wu: Higher-Order Markov Aggregations|
|In , we used an information-theoretic characterization of lumpability as a cost function for Markov chain aggregation, i.e., for replacing a Markov chain on a large state space by a Markov chain on a smaller state space. We showed that the cost function can be interpreted as the Kullback-Leibler divergence rate between the original chain and chain that is obtained by lifting the aggregated one. We furthermore showed that by relaxing the problem, the information bottleneck method can be used for obtaining the aggregation.
This thesis should extend the work to higher-order aggregations, i.e., to replacing a Markov chain on a large state space by a higher-order Markov chain on a smaller state space. Higher-order Markov chains allow for smaller modelling errors but come at the cost of a higher model complexity -- investigating higher-order aggregations thus admit trading one design goal for the other.
The main questions are whether the corresponding cost function can also be interpreted as a Kullback-Leibler divergence rate and whether the information bottleneck method can again be employed for aggregation. In case we find a lifting that admits an interpretation as a Kullback-Leibler divergence rate, it is worth changing the lifting method to the one presented in , investigating connections to the spectral theory of Markov chains.
: B. C. Geiger, T. Petrov, G. Kubin, and H. Koeppl, “Optimal Kullback-Leibler aggregation via information bottleneck,” IEEE Trans. Autom. Control, vol. 60, no. 4, pp. 1010–1022, Apr. 2015, open-access: arXiv:1304.6603 [cs.SY].
: K. Deng, P. G. Mehta, and S. P. Meyn, “Optimal Kullback-Leibler aggregation via spectral theory of Markov chains,” IEEE Trans. Autom. Control, vol. 56, no. 12, pp. 2793–2808, Dec. 2011.
|Supervisor: Bernhard Geiger|
|Vijay Pravin Maharajan: Radio Network Demand Management and Traffic Forecasting using Network Data|
|Data growth in the Telecommunications sector is enormous and all the data are valuable. In fact 95% of data generated in this world is never seen by the human eye. Millions of devices are connected to Internet and are talking to each other. And hence, Big Data Analysis is vital in almost all the industries now. It is a term applied to data sets whose size is beyond the ability of commonly used software tools to capture, manage and process the data within a tolerable elapsed time. In order to manage the network demand as well as to forecast the traffic, telecommunications industry is assessing the possibility of using Big Data Analytics as an alternative solution. The main advantages of using Big Data is the fact that it can handle a bulk amount of structured as well as unstructured data and a huge variety of data sets. Hence, it can be used in predicting the growing market. For the above mentioned reasons, Telefonica GmbH & Co. OHG is involved in bringing together all the necessary informations from some of the departments and use it for managing the Radio Network Demand and also to forecast the generic traffic growth by using Big Data Analysis. As part of this initiative, the main objective of this Master’s Thesis is to analyse the network traffic from the intentional as well as the meta data which is been generated in the network. Different data sets will be taken into account for traffic forecasting just to see how the market swings and the growing demand of it. Analysing the Key Performance Indicators (KPIs) which is said to be the key in Business Activity Monitoring constitutes the starting point of this Master’s Thesis. As secondary objectives, regular (weekly/monthly) network traffic reports are analysed in order to keep an eye on roaming impacts (National and International) and also in analysing the applications (eg., WhatsApp voice service impact) which are widely used. In addition to it, used case analysis such as keeping track of voice service, seasonality effects and also verifying the capacity measures. The external documentation of the project shall be provided. Tools used: Datameer, MyCom, MapInfo, SalCus, MS Excel|
|Supervisor: Norbert Hanik, Carlos Anriquez (Telefonica)|
|Nicolas Blum: Algorithm Development for FFT-based FM Multitone Signal|
|Supervisor: Andrei Nedelcu, Joerg Biedermann (Rohde & Schwarz)|
|Tobias Prinz: Polar Codes|
|Supervisor: Georg Böcherer|
|Sara-Lee Steffan: Development and design of an optical transceiver module|
|Supervisor: Norbert Hanik, Philipp Putzer (OHB System AG)|
|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|
|Ulrich Patrick Sandoval: Weiterentwicklung des Netzwerkanalysetools (NAT) mit Schwerpunkt auf Testfälle|
|Supervisor: Gerhard Kramer, Fa. Infineon Technologies, Neubiberg, Hr. Lippmann|
|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|
|Burak Tas: Analog- und Digital-Radio: Konzeption und Automatisierung von Testspezifikationen|
|Supervisor: Gerhard Kramer, Telemotive AG, Breitwiesen, 73347 Mühlhausen|
|Simon Heine: Softwareentwicklung für Hochfrequenz- und taktische Funkgeräte|
|Supervisor: Gerhard Kramer, Fa. Rohde & Schwarz GmbH & Co. KG, Mühldorfstr. 15, 81671 München|
|Jonas Zucker: Kalibrierung/Justage der Ipetronik internen Datenerfassungsmodule|
|Supervisor: Norbert Hanik, IPETRONIK Eichstätt GmbH, Industriestr. 10, 85072 Eichstätt, Hr. S. Löffler|
|Ahmet Burakhan Koyuncu: Hardwarenahe Optimierung und Laufzeitverbesserungen der Software, Design und Optimierung von Schnittstellen|
|Supervisor: Norbert Hanik, MVTec Software GmbH, Neherstr. 1, 81675 München, Hr. T. Hopfner|
|Tim Heinlein: Einarbeitung in das automatisierte Regression Test System der Data Application Unit|
|Supervisor: Norbert Hanik, Fa. Rohde & Schwarz GmbH & Co. KG, 81671 München, Hr. T. Rösner|
|Lukas Püttner: Evaluierung verschiedener Tools zur Extraktion und Auswertung von Metadaten aus IP-Verkehrsdaten|
|Supervisor: Norbert Hanik, ESG Elektroniksystem- und Logistik GmbH, 82256 Fürstenfeldbruck|
|Christian Bogner: Identifizierung und Verfolgung der Out-of-Spec Geräte in Hinblick auf ISO9001 Compliance|
|Supervisor: Norbert Hanik, Fa. Intel Deuschland|
|Mohamed Chennoufi: Website/wiki for Code performance|
|Aim of the project is to build a basic platform where users can upload error correction codes that are evaluated and results are shown on the wiki.|
|Supervisor: Patrick Schulte|
|Francesco Montanari: Dynamic Dead Pixel Correction|
|Supervisor: Norbert Hanik, Fa. ARRI, Arnold & Richter Cine Technik GmbH & Co KG, München, Fr. E. Kögel|
Forschungspraxis (12 ECTS)
|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|
|Houda Bannour: Shielded Twisted Single Pair Cable Approximated Characterization|
|Based on previous work, a twisted single pair cable model is obtained from scattering parameters measurements. More specifically, cable impedance and wave propagation transfer functions have been derived, for both differential and common modes, including high frequencies loss effects. In addition, RLGC cable parameters have been extracted. Simulink simulations have been performed to evaluate the model accuracy. The resulting model can be generalized for the use of different cable lengths. This work was accomplished for two types of aeronautical cables, namely the MLB24 and WF24 cables. The results have been applied to an Airbus aircraft cable system, to evaluate its compatibility for the use with BroadR-Reach and RTPGE (Reduced Twisted Pair Gigabit Ethernet) physical layer standards.|
|Supervisor: Andrei Nedelcu, Mr. Alexandros Elefsiniotis, M.Sc. Sebastian Hahn|
|Yunhong Ju: Model Selection for Real Data|
|The student will first learn how to apply different model selection methods. The second step is the comparison of these methods in terms of their performance for different source statistics and sample sizes. The selection of the best modeling method and the best model for real security primitive output data will follow. The student is expected to write a report about the comparison results of selected methods and implement a Matlab script illustrating the results.|
|Supervisor: Onur Günlü|
|Hussein Hammoud: Lossy Compression of the Bernoulli-Gaussian Spike Source in the Finite Blocklength Regime|
|The subject of this research internship is lossy compression for the Bernoulli-Gaussian (BG) spike source. This source emits independent and identically distributed random variables each of which is the product of a Bernoulli random variable with and an independent Gaussian random variable. We are interested in the optimum coding rate for a given finite block length subject to the constraints that source symbols which are equal to zero are reconstructed as zeros and those that are not equal to zero satisfy an average squared error distortion constraint.|
|Supervisor: Lars Palzer|