DocumentCode :
1787094
Title :
Reducing the complexity of the linear programming decoding
Author :
Tavakoli, Hamidreza
Author_Institution :
Dept. of Electr. Eng., Univ. of Guilan, Rasht, Iran
fYear :
2014
fDate :
9-11 Sept. 2014
Firstpage :
582
Lastpage :
584
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(n2n). Our method decrease the number of the constraint to O(n).
Keywords :
computational complexity; decoding; linear programming; LP decoding; complexity reduction; linear programming decoding; variation check degrees; Complexity theory; Decoding; Equations; Iterative decoding; Linear programming; Mathematical model; Check Degree Distribution; Complexity; Linear Programming Decoder;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Telecommunications (IST), 2014 7th International Symposium on
Conference_Location :
Tehran
Print_ISBN :
978-1-4799-5358-5
Type :
conf
DOI :
10.1109/ISTEL.2014.7000772
Filename :
7000772
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=1787094
بازگشت