EE Seminar: Efficient Linear Programming Decoding of HDPC and MDPC codes

~~
Shay Tabiby, 
M.Sc. student under the supervision of Prof. Yair Be'ery

Wednesday, June 10, 2015 at 15:00
Room 011, Kitot Bldg., Faculty of Engineering

Efficient Linear Programming Decoding of HDPC and MDPC codes

Abstract

A new Linear Programming (LP) decoding algorithm for block codes is presented along with detailed performance and complexity analysis for several classes of codes and decoding algorithms. The codes include High Density Parity Check (HDPC) codes, Moderate Density Parity Check (MDPC) codes and Polar codes. The decoding algorithms include Belief  Propagation (BP), few versions of LP and the new LP decoder (denoted SGD). The SGD decoder is based on a sparse representation of the Tanner graph which utilizes the more reliable bits to increase the reliability of the less reliable bits in order to make the LP algorithm converge. The new decoder achieves better performance and complexity than the latest most advanced LP decoders for BCH codes and the same performance as Successive Cancellation List decoder for Polar codes.