This image shows Marvin Geiselhart, M.Sc.

Marvin Geiselhart, M.Sc.

Research Assistant
Institute of Telecommunications

Contact

Pfaffenwaldring 47 (ETI 2)
70569 Stuttgart
Germany
Room: 2.332

Subject

My research focusses currently on short length channel coding. In particular, I am interested in

  • Concatenated Codes
  • Low Latency Decoding Algorithms
  • Iterative and Ensemble Decoding

I also enjoy building webdemos and interactive programs to make communications more approachable and exploring its concepts playful.

The following interactive program demonstrates the concept of geometric shaping. For different arrangements ("constellations") of the transmit symbols in the I/Q-plane, one can communicate different amount of information per symbol through an AWGN channel. Drag the constellation points with your mouse and see how close you can get to Shannon's capacity curve (hint: not only the positions, but also the labeling, i.e. the corresponding bit patterns, matter)!

The mutual information curve is computed via Monte Carlo simulation of thousands of bits in your browser in real time. Implemented in p5js.

 If you are a student interested in these or similar topics, feel free to contact me for a bachelor, research or master thesis.

  1. 2022

    1. M. Geiselhart, A. Elkelesh, J. Clausius, and S. ten Brink, “A Polar Subcode Approach to Belief Propagation List Decoding,” 2022 [Online]. Available: http://arxiv.org/abs/2205.06631
    2. M. Geiselhart, M. Ebada, A. Elkelesh, J. Clausius, and S. ten Brink, “Automorphism Ensemble Decoding of Quasi-Cyclic LDPC Codes by Breaking Graph Symmetries,” IEEE Communications Letters, pp. 1–1, 2022.
    3. M. Geiselhart, M. Ebada, A. Elkelesh, J. Clausius, and S. ten Brink, “Automorphism Ensemble Decoding of Quasi-Cyclic LDPC Codes by Breaking Graph Symmetries.” 2022 [Online]. Available: http://arxiv.org/abs/2202.00287
  2. 2021

    1. M. Geiselhart, A. Elkelesh, M. Ebada, S. Cammerer, and S. Ten Brink, “Automorphism Ensemble Decoding of Reed—Muller Codes,” IEEE Transactions on Communications, pp. 1–1, 2021.
    2. M. Geiselhart, A. Elkelesh, M. Ebada, S. Cammerer, and S. ten Brink, “Iterative Reed-Muller Decoding,” 2021 [Online]. Available: http://arxiv.org/abs/2107.12613
    3. M. Geiselhart, A. Elkelesh, M. Ebada, S. Cammerer, and S. ten Brink, “On the Automorphism Group of Polar Codes,” in 2021 IEEE International Symposium on Information Theory (ISIT), 2021, pp. 1230–1235.
    4. M. Geiselhart, A. Elkelesh, M. Ebada, S. Cammerer, and S. ten Brink, “On the Automorphism Group of Polar Codes,” 2021 [Online]. Available: http://arxiv.org/abs/2101.09679
  3. 2020

    1. M. Geiselhart, A. Elkelesh, M. Ebada, S. Cammerer, and S. ten Brink, “Automorphism Ensemble Decoding of Reed-Muller Codes,” 2020 [Online]. Available: http://arxiv.org/abs/2012.07635
    2. M. Geiselhart, A. Elkelesh, M. Ebada, S. Cammerer, and S. ten Brink, “CRC-Aided Belief Propagation List Decoding of Polar Codes,” in 2020 IEEE International Symposium on Information Theory (ISIT), 2020, pp. 395–400 [Online]. Available: https://ieeexplore.ieee.org/document/9174249
    3. M. Ebada, S. Cammerer, A. Elkelesh, M. Geiselhart, and S. ten Brink, “Iterative Detection and Decoding of Finite-Length Polar Codes in Gaussian Multiple Access Channels,” in 2020 54th Asilomar Conference on Signals, Systems, and Computers, 2020, pp. 683–688 [Online]. Available: https://ieeexplore.ieee.org/document/9443374
SS 2022 Master Lab Course "Multimedia Communications"
WS 2021/22 Übertragungstechnik 1
SS 2021 Bachelor Fachpraktikum "Digitale Nachrichtenübertragung"
WS 2020/21 Übertragungstechnik 1, Bachelor Fachpraktikum "Digitale Nachrichtenübertragung"
SS 2020 Nachrichtentechnik 2, Bachelor Fachpraktikum "Digitale Nachrichtenübertragung"
To the top of the page