Master Thesis in Communication Systems

Available internal projects

These projects are related to one of our current research projects and you will work in close collaboration with our faculty and Ph.D. students. To apply for an internal project, please send an email to the contact person for the project, and include a short description of yourself and a grade transcript. Generally, students applying for internal projects must have a strong background in mathematics and good skills in computer programming. Some knowledge of hardware is useful for some of the projects.

Wireless System Studies

1. Low-Complexity Coded Cooperation Schemes for Wireless Networks
	Study and compare different types of relaying protocols.
2. Superposition modulation based retransmission schemes
	Study the performance and optimization of superposition modulation based retransmission schemes
3. Distributed beamforming algorithms
	Evaluation of distributed beamforming algorithms for the MISO interference channel.
4. Performance Analysis of Distributed Space-Time Coding for Wireless Relays Channels
	Study the performance of distributed space-time coding for wireless relay channels using MATLAB.
5. Fixed complexity soft MIMO detection for MIMO-OFDM
	Via numerical (computer) simulations examine the performance of MIMO detection algorithms in a MIMO-OFDM system.
6. Comparison of anti-jamming techniques
	Investigate anti-jamming solutions for the TETRA system.
7. Error propagation in differential signaling of scheduling decisions
	Investigate the impact of error propagation in schemes for differential signaling of scheduling information in wireless systems.
8. Capacity of MIMO channels with Peak and Average Transmit Power Constraints
	Investigate the posibilities of extrapolating SISO Quadrature capacity results to the MIMO case.
9. Frame Length Optimization in OFDMA Downlink with Scheduling Overhead
	Investigate the problem of frame length optimization for OFDMA downlink systems by taking into account both the channel conditions and the cost of conveying the scheduling overhead.

Modern Coding Theory

10. Error-correction performance of punctured irregular LDPC-codes
	Develop simulation tools in C++ and study the error-correction performance of irregular LDPC codes under various puncturing strategies.
11. Soft blind decoding algorithms
	Implement a soft viterbi decoder with various supporting features for blind decdoding and compare blind decoding performance.
12. Software for density evolution studies of LDPC codes
	Develop simulation tools in C++ and study the density evolution of LDPC codes.

Implementation Projects

13. Validation of AMC/HARQ Techniques for the LTE Networks
	Validate some techniques related to AMC and HARQ for the LTE networks, which are proposed to reduce the latency.
14. Validation of Scheduling Techniques for LTE Networks
	Validate some techniques related to scheduling for the LTE networks, which are proposed to reduce the latency.
15. Spectrum sensing on the USRP/GNUradio
	Build a hardware demonstrator for spectrum sensing of OFDM signals using the universal software radio platform (USRP).
16. Validation of Framing and Low-Layer Signaling Techniques for the LTE Networks
	Validate some techniques related to framing and low-layer signaling for the LTE networks, which are proposed to reduce the latency.
17. Parallel Implementation of MIMO Detectors
	Investigate different parallel implementation aspects of today's state of the art MIMO detectors on a shared memory architecture: graphical processing units (GPUs) using CUDA or dedicated super computers using OpenMP.
18. Efficient computation of eigenvalue-based spectrum sensing methods
	Implement and evaluate efficient algorithms for computation of eigenvalue-based spectrum sensing algorithms.
19. Acoustic communication system
	Design and construction of a demonstrator for data transmission over an acoustic channel.

Classic Coding Theory and Finite Field Arithmetics

20. Construction of optical orthogonal codes
	Investigation of sets of binary sequences with special properties.
21. Generation of binary superimposed codes for additive channels
	Computer search for binary superimposed codes for additive channels with good parameters.
22. Arithmetic in prime fields based on Eisenstein integers
	Compare arithmetic operations in some prime field(s) using different representations.

Have your own idea about a possible master thesis project? Contact one of the faculty members in our division.