Improved Maximum Likelihood Decoding using sparse Parity-Check Matrices
Tobias Dietz,
Technische Universität Kaiserslautern –
Abstract:
Maximum-likelihood decoding is an important and powerful tool in communications to obtain the optimal performance of a channel code.
Unfortunately, simulating the maximum-likelihood performance of a code is a hard problem whose complexity grows exponentially with the blocklength of the code. In order to optimize the performance, we minimize the number of ones in the underlying parity-check matrix, formulate it as an integer program and give a heuristic algorithm to solve it. Using these minimized matrices, we significantly reduce the runtime of several ML decoders for several codes, resulting in speedups of up to 81% compared to the original matrices.
Date: 2018-Oct-10 Time: 11:30:00 Room: 336
For more information:
Upcoming Events
INESC-ID ESR Talks – February 2023

If you are a masters/PhD student or a postdoctoral fellow, come and present your work in an informal and friendly environment – and savour some tasty snacks!
Individual talks will be 10-15 minutes plus time for feedback. Enroll on your selected date by emailing pedro.ferreira[at]inesc-id.pt.
Happening on the second Wednesday of every month (4pm-5pm):
- 15 February (Alves Redol, Room 9)
- 15 March (Alves Redol, Room 9)
- 12 April (Alves Redol, Room 9)
- 10 May (Alves Redol, Room 9)
- 14 June (Alves Redol, Room 9)
- 12 July (Alves Redol, Room 9)
We hope to see you there!