DocumentCode :
2602859
Title :
Interior-point algorithms for linear-programming decoding
Author :
Vontobel, Pascal O.
Author_Institution :
Hewlett-Packard Labs., Palo Alto, CA
fYear :
2008
fDate :
Jan. 27 2008-Feb. 1 2008
Firstpage :
433
Lastpage :
437
Abstract :
Interior-point algorithms constitute a very interesting class of algorithms for solving linear-programming problems. In this paper we study efficient implementations of such algorithms for solving the linear program that appears in the linear-programming decoder formulation.
Keywords :
decoding; linear programming; interior point algorithms; linear-programming decoding; linear-programming formulation; linear-programming solution; Cost function; Data communication; Decoding; Equations; Laboratories; Linear code; Linear programming; Memoryless systems; Parity check codes; Vectors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory and Applications Workshop, 2008
Conference_Location :
San Diego, CA
Print_ISBN :
978-1-4244-2670-6
Type :
conf
DOI :
10.1109/ITA.2008.4601085
Filename :
4601085
Link To Document :
بازگشت