Reducing the Complexity of the Linear Programming
Paper ID : 1338-IST
Hassan Tavakoli *
University of Guilan
In this paper we show how the complexity of Linear Programming (LP) decoder can decrease. We use the degree 3 check equation to model all variation check degrees. The complexity of LP decoding is directed relative to the number of constraint. Number of constraint for original LP decoder is O(n2^n ). Our method decrease the number of the constraint to O(n).
Linear Programming Decoder, Complexity, Check Degree Distribution