Foto von Mustafa Cemil Coskun

Mustafa Cemil Coskun

Technische Universität München

Lehrstuhl für Nachrichtentechnik (Prof. Kramer)

Postadresse

Postal:
Theresienstr. 90
80333 München

Biography

  • Ph.D. candidate at the Institute for Communications Engineering (LNT) at TUM/Institute of Communications and Navigation at German Aerospace Center (DLR) since 2017
  • M.Sc. in Communications Engineering (MSCE) from Technical University of Munich (TUM), Germany in 2017 with high distinction
  • B.Sc. in Electrical and Electronics Engineering from Bogazici University, Turkey in 2014 with high honor

Abschlussarbeiten

Angebotene Abschlussarbeiten

Laufende Abschlussarbeiten

Bachelorarbeiten

The Weight Enumerators of Product Codes

The Weight Enumerators of Product Codes

Stichworte:
weight enumerator, input-output weight enumerator, input-redundancy weight enumerator, distance spectrum

Beschreibung

For product codes (PCs), it is very easy to find the minimum distance and its multiplicity once those of the component codes are known. However, the characterization of its complete distance spectrum is a largely open problem even if those of the component codes are given. In [1], they provide a feasible method to compute the weight enumerators (WEs) of PCs where at least one component code is a single parity check (SPC) code. In addition, an extension to compute the exact input-output weight enumerator (IO-WE) for 2-dimensional PCs with SPC component codes and a lower bound for those with more dimensions are available in [2].

The student will understand the ideas presented there and develop a software to compute them efficiently.

References:

[1] http://ieeexplore.ieee.org/document/512606/

[2]  ttps://dspace.library.uvic.ca/bitstream/handle/1828/5487/Rankin_DavidM_EURASIPJAdvSignalProcess_2005.pdf?sequence=1&isAllowed=y

Voraussetzungen

Necessary:

  • Basics of channel coding
  • C++ (The applicant can suggest an alternative with a good reason)

Related Courses:

  • Channel Coding
  • Channel Codes for Iterative Decoding
  • Coding Theory for Storage and Networks

Kontakt

mustafa.coskun@tum.de

Betreuer:

Mustafa Coskun

Student

Enes Aksoy

Forschungspraxis oder MSCE Forschungspraxis

List Viterbi Decoder for Short Convolutional Codes

List Viterbi Decoder for Short Convolutional Codes

Beschreibung

Short convolutional codes with large memory are best codes for short blocklengths at the expense of high complexity [1]. The student should understand first the Viterbi algorithm and then implement list Viterbi decoder [2].

[1] https://arxiv.org/pdf/1610.00873.pdf

[2] http://www2.ensc.sfu.ca/people/faculty/cavers/ENSC805/readings/42comm02-seshadri.pdf

Voraussetzungen

Necessary:

  • Basics of channel coding
  • Matlab or C++

Related Courses:

  • Channel Coding
  • Channel Codes for Iterative Decoding

Kontakt

mustafa.coskun@tum.de

Betreuer:

Mustafa Coskun

Student

Wenqi Jia

PAT using Polar Codes

PAT using Polar Codes

Beschreibung

Over the fading channels, channel coefficients should be estimated to use most of the decoding algorithms, e.g., Viterbi, BP, etc. In this internship the student is expected to understand the Polar Codes together with the successive cancellation decoding algorithm and use them in a PAT scheme over block-fading channels.

Betreuer:

Mustafa Coskun - (DLR)

Student

Marvin Xhemrishi

Bounds on the block error probability of short codes

Bounds on the block error probability of short codes

Beschreibung

The asymptotic bounds for the channel codes are not relevant for short codes, e.g. blocklength up to 1000 bits. Therefore, error bounds which are relevant for such codes will be implemented.

Betreuer:

Mustafa Coskun

Student

Ilhem Brayek

Research Interests

  • Channel Coding
  • Low-Latency Coding and Channel Estimation

Projekte

  • Efficient Coding and Modulation for Satellite Links with Severe Delay Constraints

Publikationen

2018

  • Coşkun, M. C.; Liva, G.; Östman, J.; Durisi, G.: Low-Complexity Joint Channel Estimation and List Decoding of Short Codes. Doctoral Seminar, 2018 mehr…
  • Coşkun, M. C.; Liva, G.; Amat, A. G.; Lentmaier, M.: Successive Cancellation Decoding of Single Parity-Check Product Codes: Analysis and Improved Decoding Algorithms. Latin American Week on Coding and Information (LAWCI), Jul 2018 mehr…
  • Coşkun, M. C.; Liva, G.; Östman, J.; Durisi, G.; Ström E. G.: Pilot-Assisted Short Packet Transmission over Memoryless Block-Fading Channels. TUM-COM Workshop on Ultra-Reliable Low-Latency Communications and Applications for 5G, Jul 2018 mehr…
  • Coşkun, M. C.; Liva, G.; Östman, J.; Durisi, G.; Ström E. G.: Pilot-Assisted Short Packet Transmission over Memoryless Block-Fading Channels. European School of Information Theory (ESIT) 2018, May 2018 mehr…
  • Coşkun, M. C.; Liva, G.; Amat, A. G.; Lentmaier, M: Successive Cancellation Decoding of Single Parity-Check Product Codes: Analysis and Improved Decoding Algorithms. Doctoral Seminar, Jan 2018 mehr…
  • Östman, J. ; Durisi, G.; Ström, Erik G.; Coşkun, M. C.; Liva, G.: Short Packets over Block-Memoryless Fading Channels: Pilot-Assisted or Noncoherent Transmission? IEEE Transactions on Communications, Jan 2018, 1-1 mehr… Volltext ( DOI )
  • Entschlüsselungsverfahren sowie Kommunikationssystem. 2018, (anderer Eintrag) mehr…

2017

  • Coşkun, M. C.; Liva, G.; Amat, A. G.; Lentmaier, M.: Successive Cancellation Decoding of Single Parity-Check Product Codes. IEEE Int. Symp. Inf.Theory (ISIT), Jun 2017Aachen, Germany mehr… Volltext (mediaTUM)
  • Coşkun, M. C.; Liva, G.: Successive Cancellation List Decoding of Single Parity-Check Product Codes. 18th Joint Workshop on Communications and Coding (JWCC), Mar 2017 mehr…
  • Coşkun, M. C.; Liva, G.: Successive Cancellation List Decoding of Single Parity-Check Product Codes. European School of Information Theory (ESIT) 2017, 2017 mehr…