Reducing the Complexity of the Linear Programming Decoding

Abstract

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(n*(2^n)). Our method decrease the number of the constraint to O(n).

arXiv commentThis Paper is a draft of final paper which represented in 7th International Symposium on Telecommunications (IST'2014)