Skip to Main Content
In this paper, an efficient implementation of the interior point algorithm recently proposed by Wadayama  for linear programming (LP) decoding of low-density parity-check (LDPC) codes is presented. The main idea behind the modification is to approximate the barrier function for the fundamental polytope defining the code so that it contains only one linear constraint for each of the parity-check constraints. Simulation results show that the approximations introduced do not result in any performance degradation, while considerably reducing the decoding complexity and latency.
Date of Conference: 18-21 April 2010