Offered Theses

• Diese Seite als PDF öffnen.

Implementation of non-binary LDPC decoder

Description

This work will focus on implementig some quantized message passing algorithms for non-binary LDPC codes.

Prerequisites

Supervisor:

• Diese Seite als PDF öffnen.

Two applications of Identification

Keywords:
Identifying Zeroes, Detection of Duplicated Data

Short Description:
Consider two practical application, where identification techniques increase efficiency.

Description

Application 1: Given a stream of data packets consisting of a key and some additional data. Packets, that previously have occurred in the stream and have not changed, shall be filtered out.

Application 2: Find a zero of a stochastically given function.

Prerequisites

Supervisor:

• Diese Seite als PDF öffnen.

Implementation of decoders for generalized LDPC codes

Description

This work will focus on implementig some quantized message passing algorithms for generalized LDPC codes and then comparing their performance.

Prerequisites

Supervisor:

• Diese Seite als PDF öffnen.

Protograph-based LDPC Code Design for Finite Number of Iterations

Description

Low-density parity-check (LDPC) codes are usually designed using an extrinsic information transfer (EXIT) analysis to compute the asymptotic iterative decoding threshold for a given code ensemble. The iterative decoding threshold over an additive white Gaussian noise (AWGN) channel is thereby defined as the minimum signal-to-noise ratio (SNR) for which the a posteriori mutual information converges to one as the number of decoding iterations goes to infinity.

For practical applications, however, decoding is often performed using only a small number of iterations. Mulholland et al. investigated a code design for protograph-based LDPC codes where the protograph-based EXIT (PEXIT) analysis [1] is run for the targeted number of decoding iterations only [2]. They showed that for the binary erasure channel (BEC), the obtained iteration-constrained threshold does not match the bit error rate (BER) threshold of finite-length codes.

In this thesis, the student will understand and reproduce the results from [2], apply these tools to the AWGN channel, and compare them to code design tools developed at the institute.

[1] G. Liva and M. Chiani, “Protograph LDPC codes design based on EXIT analysis,” in Proc. IEEE Global Telecommun. Conf. (GLOBECOM), Nov. 2007, pp. 3250–3254.

[2] I. P. Mulholland, E. Paolini, and M. F. Flanagan, “Design of protograph-based LDPC code ensembles with fast convergence properties,” in Proc. Int. ITG Conf. Syst. Commun. Coding (SCC), Feb. 2017, pp. 1–6.

Prerequisites

Supervisor:

• Diese Seite als PDF öffnen.

Joint Beam Alignment and Multi-target Tracking

Keywords:
Multi-target tracking, mmWave beam alignment

Description

The key-enabler of mobility-driven networks such 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. 

Joint radar and vehicular communication based on IEEE 802.11 has been proposed in the literature, where  the same mmWave frequency bands (e.g. 60GHz) are considered for both radar and communication. 

At such a high frequency bands, beamforming both at the transmitter and the receiver is considered essential to compensate the high propagation loss over mmWave frequencies. 

In this master thesis, we study beam alignment for a joint radar and communication system. In particular, we are interested in the multi-target detection (or estimation) problem such that  the transmitter wishes to detect targets reliably (or estimate the multi-target parameters accurately) in a given angular area. A natural question arises as whether it is better to choose a wide beam to perform multi-target detection or scan sub-areas successively with narrow beam to perform hypothesis testing in each sub-area such that the detection/estimation performance is maximized. 

Possible research directions include:

• Understand the basic of radar detection and hypothesis testing for a single-target case.
• Study the multi-target detection/estimation using various waveforms.
• If time allows, extend to the mobility scenario. 

Reference:

M. A. Richards, ``Fundamentals of radar signal processing'',  Tata McGraw-Hill Education, 2005.

Prerequisites

Contact

Supervisor:

• Diese Seite als PDF öffnen.

Efficient Syndrome Distribution Matching

Description

Probabilistic parity shaping (PPS) has recently been proposed for energy-efficient transmission where the capacity-achieving distribution requires shaped parity bits, e.g., when applying intensity modulation or on-off keying (OOK). A key component of this transmission scheme is the syndrome distribution matcher (SDM), which maps the syndrome of the systematic part of the code to a valid parity sequence under a cost constraint. Since this problem is equivalent to the syndrome decoding problem, syndrome distribution matching can be performed efficiently for code classes having an efficient syndrome decoding algorithm.

In this thesis, the student will review syndrome decoding algorithms for different code classes, identify the most promising code classes and decoding algorithms for syndrome distribution matching, implement these algorithms, and analyze their performance.

[1] G. Böcherer, D. Lentner, A. Cirino, F. Steiner, “Probabilistic Parity Shaping for Linear Codes," Feb. 2019. Available: https://arxiv.org/abs/1902.10648

Prerequisites

Supervisor:

• Diese Seite als PDF öffnen.

Learning Aided SC Flip Decoding for Polar Codes

Description

Polar codes achieve the capacity of binary-input discrete memoryless channels asymptotically in the block length under successive cancellation (SC) decoding. Polar codes have been adopted for the control channel in 5G enhanced mobile broadband (eMBB).

Due to the serial nature of SC decoding, an erroneous bit decision can be caused by the channel noise or previous erroneous bit estimates. The main idea of SC flip decoding is trying to correct the first erroneous bit decision by sequentially flipping the unreliable decisions. 

The optimal flipping strategy is considered difficult due to lack of an analytical solution. Alternatively, (deep) learning aided SC flip algorithm are investigated in this thesis.

[1] O. Afisiadis, A. Balatsoukas-Stimming, and A. Burg, “A low-complexity improved successive cancellation decoder for polar codes,” in Proc. 48th Asilomar Conf. Signals, Systems and Computers, pp. 2116-2120, 2014.

[2] L. Chandesris, V. Savin, and D. Declercq, “Dynamic-SCFlip Decoding of Polar Codes,” IEEE Trans. Commun., vol. 66, no. 6, pp. 2333-2345, Jun., 2018.

[3] X. Wang, et al. "Learning to Flip Successive Cancellation Decoding of Polar Codes with LSTM Networks." arXiv preprint arXiv:1902.08394 (2019).

[4] N. Doan, et al. "Neural Dynamic Successive Cancellation Flip Decoding of Polar Codes." arXiv preprint arXiv:1907.11563 (2019).

Supervisor:

• Diese Seite als PDF öffnen.

Polar Coding with Non-Binary Kernels

Description

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

Prerequisites

Supervisor:

• Diese Seite als PDF öffnen.

Adaptive List Decoding for Polar Codes

Description

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.

Reference:

[1] I. Tal and A. Vardy. "List decoding of polar codes." IEEE Transactions on Information Theory 61.5 (2015): 2213-2226.

[2] P. Yuan and F. Steiner. "Efficient Decoding Algorithms for Polar Codes based on 2×2 Non-Binary Kernels." International Symposium on Turbo Codes & Iterative Information Processing. 2018.

Prerequisites

Supervisor:

• Diese Seite als PDF öffnen.

Implementation of non-binary LDPC decoder

Description

This work will focus on implementig some quantized message passing algorithms for non-binary LDPC codes.

Prerequisites

Supervisor:

• Diese Seite als PDF öffnen.

Implementation of decoders for generalized LDPC codes

Description

This work will focus on implementig some quantized message passing algorithms for generalized LDPC codes and then comparing their performance.

Prerequisites

Supervisor:

• Diese Seite als PDF öffnen.

Learning Aided SC Flip Decoding for Polar Codes

Description

Polar codes achieve the capacity of binary-input discrete memoryless channels asymptotically in the block length under successive cancellation (SC) decoding. Polar codes have been adopted for the control channel in 5G enhanced mobile broadband (eMBB).

Due to the serial nature of SC decoding, an erroneous bit decision can be caused by the channel noise or previous erroneous bit estimates. The main idea of SC flip decoding is trying to correct the first erroneous bit decision by sequentially flipping the unreliable decisions. 

The optimal flipping strategy is considered difficult due to lack of an analytical solution. Alternatively, (deep) learning aided SC flip algorithm are investigated in this thesis.

[1] O. Afisiadis, A. Balatsoukas-Stimming, and A. Burg, “A low-complexity improved successive cancellation decoder for polar codes,” in Proc. 48th Asilomar Conf. Signals, Systems and Computers, pp. 2116-2120, 2014.

[2] L. Chandesris, V. Savin, and D. Declercq, “Dynamic-SCFlip Decoding of Polar Codes,” IEEE Trans. Commun., vol. 66, no. 6, pp. 2333-2345, Jun., 2018.

[3] X. Wang, et al. "Learning to Flip Successive Cancellation Decoding of Polar Codes with LSTM Networks." arXiv preprint arXiv:1902.08394 (2019).

[4] N. Doan, et al. "Neural Dynamic Successive Cancellation Flip Decoding of Polar Codes." arXiv preprint arXiv:1907.11563 (2019).

Supervisor:

• Diese Seite als PDF öffnen.

Code construction for quasi-cyclic LDPC codes based on PEG and ACE

Description

Finite length low-density parity-check codes can be constructed based on different approaches. The most obvious approach is a random, unconstrained construction, where the edges in the parity-check matrix are placed based on the desired edge distribution pairs.

In general, this approach leads to suboptimal performance, as the codes have  a lot of small cycles, which deteriorate the belief propagation decoding. To mitigate this, greedy approaches like progressive edge (PEG) have been proposed. PEG can further be complemented by taking the extrinsic cycle degree into accout [2], which also provides an additional measure for the "harmfullness" of a cycle in the Tanner graph.

In this research internship, the student is asked to implement a tool for building finite length QC LDPC codes which uses both PEG and ACE for girth optimization and conditioning.

[1] X.-Y. Hu, E. Eleftheriou, and D. M. Arnold, “Regular and irregular progressive edge-growth Tanner graphs,” IEEE Trans. Inf. Theory, vol. 51, no. 1, pp. 386–398, Jan. 2005.

[2] T. Tian, C. R. Jones, J. D. Villasenor, and R. D. Wesel, “Selective avoidance of cycles in irregular LDPC code construction,” IEEE Trans. Commun., vol. 52, no. 8, pp. 1242–1247, 2004.

Prerequisites

Supervisor:

• Diese Seite als PDF öffnen.

The trade-off in Error Correction for Partially Stuck Memory Cells

Keywords:
BCH, Cyclic, Error Correction , Masking

Short Description:
This project focuses on the trade-off between error correction capability and maximum stored information in partially stuck cells.

Description

This project focuses on finding the trade-off between the maximum information to be stored and the error correction ability for a partitioned BCH code by selecting the best* cyclotomic cosets combinations. A student must provide a program that can propose the best scenario to correct a certain number of errors while storing at most information symbols. This program will help in calculating any code length and presenting the result based on the desired number of corrected errors.

* These combinations should maximize the information symbols and keep the error correction capability unchanged. For example, a BCH code has factors (some of them power three minimal polynomials and others power one minimal polynomial),  what is the best combinations that keep the longest chain of the congestive cyclotomic cosets to design a distance to correct a certain number of errors while storing at most the information symbols?

Prerequisites

Supervisor:

• Diese Seite als PDF öffnen.

Polar Coding with Non-Binary Kernels

Description

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

Prerequisites

Supervisor:

• Diese Seite als PDF öffnen.

Adaptive List Decoding for Polar Codes

Description

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.

Reference:

[1] I. Tal and A. Vardy. "List decoding of polar codes." IEEE Transactions on Information Theory 61.5 (2015): 2213-2226.

[2] P. Yuan and F. Steiner. "Efficient Decoding Algorithms for Polar Codes based on 2×2 Non-Binary Kernels." International Symposium on Turbo Codes & Iterative Information Processing. 2018.

Prerequisites

Supervisor: