Vortrag
Polar codes: algorithms and implementation aspects
Vortrag von Dr. Pascal Giard
Datum: 06.06.18 Zeit: 15.00 - 16.00 Raum:
Error-correcting codes are an essential ingredient of all modern communication systems. Polar codes are the first type of such codes with an explicit construction to asymptotically achieve the symmetric capacity of memoryless channels using a low-complexity decoding algorithm.
In his seminal work on polar codes, Erdal Arıkan showed that using a particular linear transformation on a vector of bits leads to a polarization phenomenon, where some of the bits become almost completely reliable when transmitted over certain types of channels while the remainder become almost completely unreliable (thus useless for communication). Polar codes exploit this phenomenon. By packing information bits only into the fully-reliable locations and by using an appropriate decoding algorithm, reliable communication can be established at a rate that corresponds to the channel capacity.
The widely-recognized disruptive impact of polar codes is illustrated by the recent, rapid adoption of this young class of codes as part of the next-generation mobile-communication standard (5G) that is currently under development by the 3GPP.
Many decoding algorithms for polar codes were developed and implemented, addressing various application requirements: from error-correction performance rivaling that of low-density parity-check (LDPC) or turbo codes to very high throughput or low-complexity decoders.
In this talk, we review the state-of-the-art algorithms, and their corresponding implementations. Doing so we underline the challenges that were met along the way as well as those that still need to be addressed.