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

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 t...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE communications letters Ročník 20; číslo 4; s. 640 - 643
Hlavní autoři: Falsafain, Hossein, Mousavi, Sayyed Rasoul
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.04.2016
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Adaptive algorithms
Adaptive linear programming (ALP) decoding
Algorithms
Binary codes
cut-inducing redundant parity-check (RPC)
cutting plane algorithm
Decoding
Generators
heuristic separation algorithm
Inequalities
Linear codes
Linear matrix inequalities
Linear programming
Maximum likelihood decoding
Optimization
Parity
Phase change materials
Redundant
cutting plane algorithm
heuristic separation algorithm
Adaptive linear programming (ALP) decoding
cut-inducing redundant parity check (RPC)
ISSN:1089-7798, 1558-2558
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2016.2530706