EE Seminar: Naama Litichever

~~
Speaker: Naama Litichever
M.Sc. student under the supervision of Prof. Simon Litsyn

Wednesday, January 21st, 2015  at  15:30
Room 011, Kitot Bldg., Faculty of Engineering

Sub-Optimal Decoding of Polar Codes
Abstract
 Polar codes, introduced by Arikan, are the first known practical codes to achieve the Shannon capacity over symmetric discrete memoryless channels. Their code construction is based on the channel polarization phenomenon. The encoding as well as the decoding procedure of polar codes can be implemented with O(N logN) complexity, where N is the block length of the code.
 Arikan used the binary u + v; v mapping to construct polar codes. Later
works showed that other kernel matrices, both binary and non-binary, can be used to construct polar codes. Non-binary kernels have great performance potential, but this comes with a very high price of complexity. In this thesis, we propose a sub-optimal decoding algorithm for polar codes with both binary and non-binary kernels, that lowers their decoding complexity. The reduced complexity makes the use of high-order non-binary kernels feasible.
 List decoding algorithms are very common in polar codes' decoding due to their high performance. We suggest here a list decoding algorithm, for binary kernels, which improves the list decoding of polar codes in terms of complexity and latency without any performance degradation.
 Moreover, we generalize this algorithm for the non-binary case, providing a non-binary list decoding algorithm with lower latency and complexity in comparison with the well-known polar codes list decoder, and with the same performance.

 

21 בינואר 2015, 15:30 
חדר 011, בניין כיתות-חשמל 
אוניברסיטת תל אביב עושה כל מאמץ לכבד זכויות יוצרים. אם בבעלותך זכויות יוצרים בתכנים שנמצאים פה ו/או השימוש
שנעשה בתכנים אלה לדעתך מפר זכויות, נא לפנות בהקדם לכתובת שכאן >>