A Generator-Matrix-Based Approach for Adaptively Generating Cut-Inducing Redundant Parity Checks

Hossein Falsafain, Seyed Rasoul Mousavi

Research output: Contribution to journalArticle

Abstract

A generator matrix (GM)-based approach for adaptively deriving cut-inducing redundant parity checks (RPCs) during the adaptive linear programming decoding algorithm is presented. More precisely speaking, if the decoder gets stuck in a non-integral pseudocodeword, then the resulting RPCs are likely to provide violated forbidden-set inequalities that can separate this non-integral optimal solution from the feasible region. The described approach can be viewed as a GM-based counterpart of the approach proposed by Zhang and Siegel in 2012. For binary linear codes of low rate, while providing the same error-correcting performance, our approach requires much less computational time compared to its analogue.
Original languageEnglish
Pages (from-to)640-643
Number of pages4
JournalIEEE Communications Letters
Volume20
Issue number4
Early online date16 Feb 2016
DOIs
Publication statusPublished - Apr 2016

Fingerprint Dive into the research topics of 'A Generator-Matrix-Based Approach for Adaptively Generating Cut-Inducing Redundant Parity Checks'. Together they form a unique fingerprint.

  • Cite this