A separation algorithm for improved LP-decoding of linear block codes
Tanatmis, A.
Ruzika, S.
Hamacher, H.W.
Punekar, M.
Kienle, F.
Wehn, N.
Dept. of Math., Univ. of Kaiserslautern, Kaiserslautern;
This paper appears in: Turbo Codes and Related Topics, 2008 5th International Symposium on
Publication Date: 1-5 Sept. 2008
On page(s): 37-42
Location: Lausanne,
ISBN: 978-1-4244-2862-5
INSPEC Accession Number: 10368845
Digital Object Identifier: 10.1109/TURBOCODING.2008.4658669
Current Version Published: 2008-10-24
Abstract
We present improvements in linear programming decoding introduced by Feldman et al. with the help of generic integer programming methods. We propose a new IP formulation of the maximum likelihood decoding problem. This formulation makes use of indicator variables which help in detecting violated parity checks immediately. We derive Gomory cuts from our formulation and use them in a separation algorithm to find maximum likelihood codewords. We further propose a novel method of finding cuts induced by redundant parity checks. Under certain circumstances we can guarantee that these RPC cuts are valid and cut off the fractional optimal solutions of LP decoding. We demonstrate the performance of our separation algorithm on two LDPC codes and one BCH code.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
