Title
Efficient Implementation of Interior Point Decoding Based on Barrier Function for LDPC Codes
Abstract
In this paper, an efficient implementation of the interior point algorithm recently proposed by Wadayama [5] 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.
Year
DOI
Venue
2010
10.1109/WCNC.2010.5506378
WCNC
Field
DocType
Citations 
Mathematical optimization,Sequential decoding,Low-density parity-check code,Computer science,Algorithm,Real-time computing,Polytope,Linear programming,Decoding methods,List decoding,Interior point method,Computational complexity theory
Conference
0
PageRank 
References 
Authors
0.34
0
3
Name
Order
Citations
PageRank
Telex Magloire Nkouatchah Ngatched18419.21
Attahiru Sule Alfa251071.89
Jun Cai337339.29